Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 180K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 726K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 403K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 69K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 222K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 285K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 632K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 877K 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 Peterson-PT-6-LTLFireability-00
FORMULA_NAME Peterson-PT-6-LTLFireability-01
FORMULA_NAME Peterson-PT-6-LTLFireability-02
FORMULA_NAME Peterson-PT-6-LTLFireability-03
FORMULA_NAME Peterson-PT-6-LTLFireability-04
FORMULA_NAME Peterson-PT-6-LTLFireability-05
FORMULA_NAME Peterson-PT-6-LTLFireability-06
FORMULA_NAME Peterson-PT-6-LTLFireability-07
FORMULA_NAME Peterson-PT-6-LTLFireability-08
FORMULA_NAME Peterson-PT-6-LTLFireability-09
FORMULA_NAME Peterson-PT-6-LTLFireability-10
FORMULA_NAME Peterson-PT-6-LTLFireability-11
FORMULA_NAME Peterson-PT-6-LTLFireability-12
FORMULA_NAME Peterson-PT-6-LTLFireability-13
FORMULA_NAME Peterson-PT-6-LTLFireability-14
FORMULA_NAME Peterson-PT-6-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748950924729

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 11:42:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 11:42:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 11:42:06] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-06-03 11:42:06] [INFO ] Transformed 1330 places.
[2025-06-03 11:42:06] [INFO ] Transformed 2030 transitions.
[2025-06-03 11:42:06] [INFO ] Found NUPN structural information;
[2025-06-03 11:42:06] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1281 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 47 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:42:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:42:06] [INFO ] Computed 27 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:42:07] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-06-03 11:42:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:42:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:42:07] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:42:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:42:07] [INFO ] Invariant cache hit.
[2025-06-03 11:42:07] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30691ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30712ms
Finished structural reductions in LTL mode , in 1 iterations and 32163 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1281 out of 1330 places after structural reductions.
[2025-06-03 11:42:39] [INFO ] Flatten gal took : 225 ms
[2025-06-03 11:42:39] [INFO ] Flatten gal took : 103 ms
[2025-06-03 11:42:39] [INFO ] Input system was already deterministic with 2030 transitions.
Support contains 1031 out of 1330 places (down from 1281) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 29
RANDOM walk for 40000 steps (8 resets) in 2178 ms. (18 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1455 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
[2025-06-03 11:42:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:42:41] [INFO ] Invariant cache hit.
[2025-06-03 11:42:41] [INFO ] State equation strengthened by 330 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1180/1318 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1318 variables, 1180/1333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:42] [INFO ] Deduced a trap composed of 27 places in 555 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:43] [INFO ] Deduced a trap composed of 12 places in 636 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1318 variables, 2/1335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1318 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/1323 variables, 5/1340 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1323 variables, 5/1345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1323 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 7/1330 variables, 7/1352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1330 variables, 7/1359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1330 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1820/3150 variables, 1330/2689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5083ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 571 transitions
Trivial Post-agglo rules discarded 571 transitions
Performed 571 trivial Post agglomeration. Transition count delta: 571
Iterating post reduction 0 with 571 rules applied. Total rules applied 571 place count 1330 transition count 1459
Reduce places removed 571 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 574 rules applied. Total rules applied 1145 place count 759 transition count 1456
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1148 place count 756 transition count 1456
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 1148 place count 756 transition count 1201
Deduced a syphon composed of 255 places in 1 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 3 with 510 rules applied. Total rules applied 1658 place count 501 transition count 1201
Applied a total of 1658 rules in 174 ms. Remains 501 /1330 variables (removed 829) and now considering 1201/2030 (removed 829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 501/1330 places, 1201/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 959 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 996 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 409944 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 7
Probabilistic random walk after 409944 steps, saw 56769 distinct states, run finished after 3005 ms. (steps per millisecond=136 ) properties seen :0
[2025-06-03 11:42:50] [INFO ] Flow matrix only has 991 transitions (discarded 210 similar events)
// Phase 1: matrix 991 rows 501 cols
[2025-06-03 11:42:50] [INFO ] Computed 27 invariants in 7 ms
[2025-06-03 11:42:50] [INFO ] State equation strengthened by 330 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/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 353/491 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 353/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:51] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:51] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:51] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/494 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:52] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:52] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 24 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:52] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 19 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 7/501 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 7/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 991/1492 variables, 501/1035 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1492 variables, 330/1365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1492 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1492 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 1365 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5063 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 501/501 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 353/491 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 353/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 6/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:56] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:56] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:56] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:57] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:57] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:57] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:57] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:58] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:58] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:58] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:58] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:58] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:59] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:59] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:59] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:42:59] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:00] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:00] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:00] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:00] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:01] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:01] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:02] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:02] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:02] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:02] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:03] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:03] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:03] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:03] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:04] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 11/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/494 variables, 3/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 3/551 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:07] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 19 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 7/501 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 7/566 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:09] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:09] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:10] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:10] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:10] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:10] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:10] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:11] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:11] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:11] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:11] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:11] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:12] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:12] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:12] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:12] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:13] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:13] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 22 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 18/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:14] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:14] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:14] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:14] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:15] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:15] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:15] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:15] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:16] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:16] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:16] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:17] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:17] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:17] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:17] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:17] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:18] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:18] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 19 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 18/602 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:19] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:19] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:20] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:20] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:20] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:20] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:21] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:21] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:21] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:21] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:22] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:22] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:22] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:23] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:23] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:23] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:23] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:24] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:24] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:24] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 24 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 20/622 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:26] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:26] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:26] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:27] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:27] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:28] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:28] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:28] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:29] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:29] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:29] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:29] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:30] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:30] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:30] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:31] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:31] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:31] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 27 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 18/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:33] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:33] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:34] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:34] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:35] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:35] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:35] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:39] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:39] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 24 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/501 variables, 20/660 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/1492 variables, and 660 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45008 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/501 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 132/132 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50112ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 1201/1201 transitions.
Applied a total of 0 rules in 61 ms. Remains 501 /501 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 501/501 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 1201/1201 transitions.
Applied a total of 0 rules in 51 ms. Remains 501 /501 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2025-06-03 11:43:40] [INFO ] Flow matrix only has 991 transitions (discarded 210 similar events)
[2025-06-03 11:43:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:43:41] [INFO ] Implicit Places using invariants in 503 ms returned [440, 441, 443, 472, 473, 474, 475]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 527 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/501 places, 1201/1201 transitions.
Applied a total of 0 rules in 28 ms. Remains 494 /494 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 607 ms. Remains : 494/501 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 1361 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1128 ms. (35 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 387760 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 7
Probabilistic random walk after 387760 steps, saw 55051 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2025-06-03 11:43:45] [INFO ] Flow matrix only has 991 transitions (discarded 210 similar events)
// Phase 1: matrix 991 rows 494 cols
[2025-06-03 11:43:45] [INFO ] Computed 20 invariants in 13 ms
[2025-06-03 11:43:45] [INFO ] State equation strengthened by 330 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/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 350/488 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 350/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:46] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:46] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:46] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6/494 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 991/1485 variables, 494/1011 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1485 variables, 330/1341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1485 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1485 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 1341 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2695 ms.
Refiners :[Domain max(s): 494/494 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 494/494 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 350/488 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 350/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:48] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:49] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:49] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:49] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:49] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:49] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:50] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:50] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:50] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:50] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:50] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:51] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:51] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:51] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:51] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:51] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:52] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:52] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:52] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:52] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:53] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:53] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:53] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:53] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:54] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:54] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:55] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:55] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:55] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:55] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:56] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:56] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:56] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:56] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:56] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:57] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:57] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:57] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:57] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:58] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:58] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:59] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:59] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:00] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:00] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:00] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:00] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:01] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:01] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:01] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:02] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:02] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:02] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:02] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:02] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:03] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:03] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:03] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:03] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:04] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:05] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:05] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:05] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:06] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:06] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:07] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:07] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:07] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:08] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:08] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:08] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:08] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:09] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:09] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:09] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:09] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:10] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:10] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:10] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:10] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 20/585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:12] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:12] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:12] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:13] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:13] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:13] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:13] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:13] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:14] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:14] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:14] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:14] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:15] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:15] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:15] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:15] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:16] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:16] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:16] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:16] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 20/605 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:19] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:19] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:20] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:20] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:20] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:21] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:21] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:21] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:22] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:22] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:22] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:23] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:23] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:23] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:23] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:24] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:24] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:24] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:24] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:25] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 24 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:27] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:27] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:28] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:28] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:28] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:28] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:29] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:29] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:29] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:30] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:30] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:30] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:31] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:31] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:31] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:32] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:33] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:33] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 18/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:34] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:34] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:35] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:35] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:35] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:35] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:36] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:36] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:38] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:40] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:43] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:43] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:44] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:44] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:44] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:45] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:45] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:45] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:46] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:46] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 17 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 20/663 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:49] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:49] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:50] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:51] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:51] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:51] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:52] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:52] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:52] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:53] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:53] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:53] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:53] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:54] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:55] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:55] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:55] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:56] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:56] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:57] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 29 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 20/683 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:44:59] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:00] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:00] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:00] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:01] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:01] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:01] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:01] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:02] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:02] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:02] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:03] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 23 ms to minimize.
SMT process timed out in 77736ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1201/1201 transitions.
Applied a total of 0 rules in 28 ms. Remains 494 /494 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 494/494 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1201/1201 transitions.
Applied a total of 0 rules in 34 ms. Remains 494 /494 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2025-06-03 11:45:03] [INFO ] Flow matrix only has 991 transitions (discarded 210 similar events)
[2025-06-03 11:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:03] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-03 11:45:03] [INFO ] Flow matrix only has 991 transitions (discarded 210 similar events)
[2025-06-03 11:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:04] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:45:05] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:45:05] [INFO ] Redundant transitions in 125 ms returned []
Running 1194 sub problems to find dead transitions.
[2025-06-03 11:45:05] [INFO ] Flow matrix only has 991 transitions (discarded 210 similar events)
[2025-06-03 11:45:05] [INFO ] Invariant cache hit.
[2025-06-03 11:45:05] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 494/494 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:15] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:15] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:15] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:15] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:16] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:16] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:16] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:16] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:16] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:17] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:17] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:17] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:17] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:17] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:18] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:18] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:18] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:18] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:18] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:19] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:20] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:20] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:20] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:20] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:20] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:21] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:21] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:21] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:21] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:22] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:22] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:22] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:22] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:22] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:22] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:23] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:23] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:23] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:23] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:23] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 20/554 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:36] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 25 ms to minimize.
SMT process timed out in 30276ms, After SMT, problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 30279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32698 ms. Remains : 494/494 places, 1201/1201 transitions.
FORMULA Peterson-PT-6-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p1)))||p0)))'
Support contains 91 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 27 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:45:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:45:36] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:38] [INFO ] Implicit Places using invariants in 1639 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1642 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1690 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00
Product exploration explored 100000 steps with 16881 reset in 541 ms.
Product exploration explored 100000 steps with 16643 reset in 531 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 879 steps (0 resets) in 10 ms. (79 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 91 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 20 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:45:40] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:45:40] [INFO ] Computed 20 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:41] [INFO ] Implicit Places using invariants in 1363 ms returned []
[2025-06-03 11:45:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:45:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:45:52] [INFO ] Implicit Places using invariants and state equation in 10254 ms returned []
Implicit Place search using SMT with State Equation took 11637 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:45:52] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:45:52] [INFO ] Invariant cache hit.
[2025-06-03 11:45:52] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30515ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30520ms
Finished structural reductions in LTL mode , in 1 iterations and 42185 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 878 steps (0 resets) in 11 ms. (73 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16772 reset in 434 ms.
Product exploration explored 100000 steps with 16894 reset in 458 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 91 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1323 transition count 2030
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 335 place count 1323 transition count 2210
Deduced a syphon composed of 588 places in 1 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 588 place count 1323 transition count 2210
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 738 place count 1173 transition count 2060
Deduced a syphon composed of 438 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 888 place count 1173 transition count 2060
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 760 places in 1 ms
Iterating global reduction 1 with 322 rules applied. Total rules applied 1210 place count 1173 transition count 2060
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1502 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 1794 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Applied a total of 1794 rules in 363 ms. Remains 881 /1323 variables (removed 442) and now considering 1768/2030 (removed 262) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:46:25] [INFO ] Redundant transitions in 26 ms returned []
Running 1761 sub problems to find dead transitions.
[2025-06-03 11:46:25] [INFO ] Flow matrix only has 1558 transitions (discarded 210 similar events)
// Phase 1: matrix 1558 rows 881 cols
[2025-06-03 11:46:25] [INFO ] Computed 20 invariants in 5 ms
[2025-06-03 11:46:25] [INFO ] State equation strengthened by 510 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:47] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:47] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:48] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:48] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:48] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:48] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:49] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:49] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:49] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:50] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:50] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:50] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:51] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:51] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:51] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:52] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:52] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:52] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:53] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:53] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/881 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:54] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:54] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:55] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:46:55] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 20 ms to minimize.
SMT process timed out in 30422ms, After SMT, problems are : Problem set: 0 solved, 1761 unsolved
Search for dead transitions found 0 dead transitions in 30428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 881/1323 places, 1768/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30829 ms. Remains : 881/1323 places, 1768/2030 transitions.
Built C files in :
/tmp/ltsmin1435250329503253396
[2025-06-03 11:46:55] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1435250329503253396
Running compilation step : cd /tmp/ltsmin1435250329503253396;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1435250329503253396;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1435250329503253396;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 91 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:46:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:46:58] [INFO ] Computed 20 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:47:00] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2025-06-03 11:47:00] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:47:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:47:10] [INFO ] Implicit Places using invariants and state equation in 10172 ms returned []
Implicit Place search using SMT with State Equation took 11567 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:47:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:47:10] [INFO ] Invariant cache hit.
[2025-06-03 11:47:10] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30484ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30488ms
Finished structural reductions in LTL mode , in 1 iterations and 42103 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin13040958277065679531
[2025-06-03 11:47:40] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13040958277065679531
Running compilation step : cd /tmp/ltsmin13040958277065679531;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13040958277065679531;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13040958277065679531;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 11:47:43] [INFO ] Flatten gal took : 58 ms
[2025-06-03 11:47:44] [INFO ] Flatten gal took : 56 ms
[2025-06-03 11:47:44] [INFO ] Time to serialize gal into /tmp/LTL2613818258239778509.gal : 17 ms
[2025-06-03 11:47:44] [INFO ] Time to serialize properties into /tmp/LTL10037457814204701214.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/LTL2613818258239778509.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1911442731866806904.hoa' '-atoms' '/tmp/LTL10037457814204701214.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/LTL10037457814204701214.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1911442731866806904.hoa
Detected timeout of ITS tools.
[2025-06-03 11:47:59] [INFO ] Flatten gal took : 51 ms
[2025-06-03 11:47:59] [INFO ] Flatten gal took : 50 ms
[2025-06-03 11:47:59] [INFO ] Time to serialize gal into /tmp/LTL16421446750983332093.gal : 9 ms
[2025-06-03 11:47:59] [INFO ] Time to serialize properties into /tmp/LTL8690345280219735958.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/LTL16421446750983332093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8690345280219735958.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((((((X(X(X("((((EndTurn_2_5==0)&&(EndTurn_4_5==0))&&((EndTurn_0_5==0)&&(EndTurn_3_5==0)))&&(((EndTurn_5_5==0)&&(EndTurn_6_5==0))...1796
Formula 0 simplified : F(!"((((((TestTurn_0_0==1)&&(Turn_0_0==1))||((TestTurn_1_4==1)&&(Turn_4_1==1)))||(((TestTurn_0_3==1)&&(Turn_3_0==1))||((TestTurn_4_1...1776
Detected timeout of ITS tools.
[2025-06-03 11:48:14] [INFO ] Flatten gal took : 45 ms
[2025-06-03 11:48:14] [INFO ] Applying decomposition
[2025-06-03 11:48:14] [INFO ] Flatten gal took : 45 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/graph16645500423313075219.txt' '-o' '/tmp/graph16645500423313075219.bin' '-w' '/tmp/graph16645500423313075219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16645500423313075219.bin' '-l' '-1' '-v' '-w' '/tmp/graph16645500423313075219.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:48:14] [INFO ] Decomposing Gal with order
[2025-06-03 11:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:48:14] [INFO ] Removed a total of 1792 redundant transitions.
[2025-06-03 11:48:14] [INFO ] Flatten gal took : 144 ms
[2025-06-03 11:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-06-03 11:48:15] [INFO ] Time to serialize gal into /tmp/LTL14068795902890705651.gal : 19 ms
[2025-06-03 11:48:15] [INFO ] Time to serialize properties into /tmp/LTL8113066149311637904.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/LTL14068795902890705651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8113066149311637904.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(((((((X(X(X("((((i14.u383.EndTurn_2_5==0)&&(i14.u126.EndTurn_4_5==0))&&((i14.u133.EndTurn_0_5==0)&&(i14.u382.EndTurn_3_5==0)))&&(...2727
Formula 0 simplified : F(!"((((((i13.i0.i1.i0.u121.TestTurn_0_0==1)&&(i13.i0.i1.i0.u121.Turn_0_0==1))||((i15.u128.TestTurn_1_4==1)&&(i15.u128.Turn_4_1==1))...2707
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 173507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||X(G(p2))))'
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:48:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:48:30] [INFO ] Computed 27 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:30] [INFO ] Implicit Places using invariants in 568 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 571 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1))||G(F(p2))) U (p2 U p0)))'
Support contains 420 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 600 place count 1030 transition count 1723
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 614 place count 1023 transition count 1723
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 686 place count 987 transition count 1687
Applied a total of 686 rules in 106 ms. Remains 987 /1330 variables (removed 343) and now considering 1687/2030 (removed 343) transitions.
[2025-06-03 11:48:31] [INFO ] Flow matrix only has 1477 transitions (discarded 210 similar events)
// Phase 1: matrix 1477 rows 987 cols
[2025-06-03 11:48:31] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:32] [INFO ] Implicit Places using invariants in 1042 ms returned [933, 934, 936, 965, 966, 967, 968]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1330 places, 1687/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 980 /980 variables (removed 0) and now considering 1687/1687 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1175 ms. Remains : 980/1330 places, 1687/2030 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03
Product exploration explored 100000 steps with 6992 reset in 1806 ms.
Stack based approach found an accepted trace after 2476 steps with 166 reset with depth 49 and stack size 49 in 49 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 3238 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)||!p1)&&!p0) U (p0 U p0)))'
Support contains 42 out of 1330 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 1152 place count 754 transition count 1189
Deduced a syphon composed of 265 places in 0 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 1682 place count 489 transition count 1189
Applied a total of 1682 rules in 44 ms. Remains 489 /1330 variables (removed 841) and now considering 1189/2030 (removed 841) transitions.
[2025-06-03 11:48:34] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 489 cols
[2025-06-03 11:48:34] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:34] [INFO ] Implicit Places using invariants in 399 ms returned [435, 436, 438, 467, 468, 469, 470]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 402 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 482/1330 places, 1189/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 482/1330 places, 1189/2030 transitions.
Stuttering acceptance computed with spot in 40 ms :[true, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 437 ms.
Product exploration explored 100000 steps with 0 reset in 432 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, p0]
RANDOM walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 796304 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 796304 steps, saw 107457 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2025-06-03 11:48:39] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 482 cols
[2025-06-03 11:48:39] [INFO ] Computed 20 invariants in 7 ms
[2025-06-03 11:48:39] [INFO ] State equation strengthened by 330 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/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 391/433 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 391/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/440 variables, 7/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 7/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 979/1419 variables, 440/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 330/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1419 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/1461 variables, 42/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1461 variables, 42/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1461 variables, 6/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1461 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1461 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1461/1461 variables, and 1314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 640 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 482/482 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/0 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/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 391/433 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 391/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:40] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:40] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:40] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:40] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:40] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:40] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:41] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 13/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:42] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:48:42] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/440 variables, 7/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 7/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 979/1419 variables, 440/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1419 variables, 330/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1419 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 42/1461 variables, 42/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1461 variables, 42/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1461 variables, 6/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1461 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1461 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1461/1461 variables, and 1329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3388 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 482/482 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4064ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1910 steps, including 556 resets, run visited all 1 properties in 24 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 27 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 8976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U X(!p2))))'
Support contains 126 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 31 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:48:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:48:43] [INFO ] Computed 27 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:45] [INFO ] Implicit Places using invariants in 1767 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1774 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1832 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 304 ms :[p2, p2, p2, (AND p1 (NOT p0) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-06
Product exploration explored 100000 steps with 4231 reset in 941 ms.
Stack based approach found an accepted trace after 2366 steps with 110 reset with depth 16 and stack size 16 in 24 ms.
FORMULA Peterson-PT-6-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 3142 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(((p1 U p2)||p0))))'
Support contains 343 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1330 transition count 1694
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 994 transition count 1694
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 672 place count 994 transition count 1400
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1260 place count 700 transition count 1400
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1344 place count 658 transition count 1358
Applied a total of 1344 rules in 67 ms. Remains 658 /1330 variables (removed 672) and now considering 1358/2030 (removed 672) transitions.
[2025-06-03 11:48:46] [INFO ] Flow matrix only has 1148 transitions (discarded 210 similar events)
// Phase 1: matrix 1148 rows 658 cols
[2025-06-03 11:48:46] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:46] [INFO ] Implicit Places using invariants in 446 ms returned [639, 640, 642, 650, 651, 652, 653]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 450 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 651/1330 places, 1358/2030 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 532 ms. Remains : 651/1330 places, 1358/2030 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 2400 ms.
Stack based approach found an accepted trace after 1503 steps with 0 reset with depth 1504 and stack size 1467 in 35 ms.
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-07 finished in 3130 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((F(!(p0 U p1))&&(G(p2)||!p0))) U p3))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Iterating post reduction 1 with 585 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1170 place count 745 transition count 1151
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1758 place count 451 transition count 1151
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 58 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
[2025-06-03 11:48:49] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2025-06-03 11:48:49] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:50] [INFO ] Implicit Places using invariants in 524 ms returned [390, 391, 401, 402, 403, 404]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 529 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1330 places, 1109/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 403 /403 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 606 ms. Remains : 403/1330 places, 1109/2030 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (OR p1 (AND p0 (NOT p2))), p1, (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-08
Product exploration explored 100000 steps with 1747 reset in 272 ms.
Stack based approach found an accepted trace after 89 steps with 8 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-08 finished in 1098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(((p1&&X(F(p2)))||G(F(p2)))))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 41 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:48:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:48:50] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:53] [INFO ] Implicit Places using invariants in 2612 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2618 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 33 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2693 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 208 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-09 finished in 3153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(G(p0))&&F(p1)))||G(p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 588 rules applied. Total rules applied 1175 place count 743 transition count 1442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1176 place count 742 transition count 1150
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 56 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
[2025-06-03 11:48:53] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2025-06-03 11:48:53] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:54] [INFO ] Implicit Places using invariants in 510 ms returned [389, 390, 392, 401, 402, 403, 404]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 512 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1330 places, 1109/2030 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 583 ms. Remains : 402/1330 places, 1109/2030 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 239 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-10 finished in 940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(X(X(G(p1)))||G(p2)))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:48:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:48:54] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:48:57] [INFO ] Implicit Places using invariants in 2539 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2542 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2613 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1345 steps with 2 reset in 6 ms.
FORMULA Peterson-PT-6-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-11 finished in 3031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&F(p1)))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:48:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:00] [INFO ] Implicit Places using invariants in 2578 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2582 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2652 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13
Product exploration explored 100000 steps with 6659 reset in 363 ms.
Product exploration explored 100000 steps with 6672 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 195 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4311 steps (0 resets) in 40 ms. (105 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:49:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:49:02] [INFO ] Computed 20 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:04] [INFO ] Implicit Places using invariants in 2236 ms returned []
[2025-06-03 11:49:04] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:05] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:49:17] [INFO ] Implicit Places using invariants and state equation in 12986 ms returned []
Implicit Place search using SMT with State Equation took 15234 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:49:17] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:49:17] [INFO ] Invariant cache hit.
[2025-06-03 11:49:17] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 timeout
1.0)
(s12 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30439ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30444ms
Finished structural reductions in LTL mode , in 1 iterations and 45721 ms. Remains : 1323/1323 places, 2030/2030 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) p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4297 steps (0 resets) in 27 ms. (153 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 3 factoid took 276 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6662 reset in 355 ms.
Product exploration explored 100000 steps with 6653 reset in 359 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1323 transition count 2030
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 258 Pre rules applied. Total rules applied 336 place count 1323 transition count 2210
Deduced a syphon composed of 594 places in 1 ms
Iterating global reduction 1 with 258 rules applied. Total rules applied 594 place count 1323 transition count 2210
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 744 place count 1173 transition count 2060
Deduced a syphon composed of 444 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 894 place count 1173 transition count 2060
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 772 places in 1 ms
Iterating global reduction 1 with 328 rules applied. Total rules applied 1222 place count 1173 transition count 2060
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 1515 place count 880 transition count 1767
Deduced a syphon composed of 479 places in 0 ms
Iterating global reduction 1 with 293 rules applied. Total rules applied 1808 place count 880 transition count 1767
Deduced a syphon composed of 479 places in 0 ms
Applied a total of 1808 rules in 204 ms. Remains 880 /1323 variables (removed 443) and now considering 1767/2030 (removed 263) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:49:50] [INFO ] Redundant transitions in 123 ms returned []
Running 1760 sub problems to find dead transitions.
[2025-06-03 11:49:50] [INFO ] Flow matrix only has 1557 transitions (discarded 210 similar events)
// Phase 1: matrix 1557 rows 880 cols
[2025-06-03 11:49:50] [INFO ] Computed 20 invariants in 7 ms
[2025-06-03 11:49:50] [INFO ] State equation strengthened by 510 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/880 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:13] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:13] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:14] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:14] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:14] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:15] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:15] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:15] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:16] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:16] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:16] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:17] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:17] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:17] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:18] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:18] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:18] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:19] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:19] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:19] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 43 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/880 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:50:21] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 16 ms to minimize.
SMT process timed out in 30566ms, After SMT, problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 30569ms
Starting structural reductions in SI_LTL mode, iteration 1 : 880/1323 places, 1767/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30908 ms. Remains : 880/1323 places, 1767/2030 transitions.
Built C files in :
/tmp/ltsmin8394598611264499886
[2025-06-03 11:50:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8394598611264499886
Running compilation step : cd /tmp/ltsmin8394598611264499886;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8394598611264499886;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8394598611264499886;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 31 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:50:24] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:50:24] [INFO ] Computed 20 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:50:26] [INFO ] Implicit Places using invariants in 2232 ms returned []
[2025-06-03 11:50:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:50:27] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:50:39] [INFO ] Implicit Places using invariants and state equation in 12745 ms returned []
Implicit Place search using SMT with State Equation took 14989 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:50:39] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:50:39] [INFO ] Invariant cache hit.
[2025-06-03 11:50:39] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30445ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30451ms
Finished structural reductions in LTL mode , in 1 iterations and 45483 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin12148959774404770134
[2025-06-03 11:51:09] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12148959774404770134
Running compilation step : cd /tmp/ltsmin12148959774404770134;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12148959774404770134;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12148959774404770134;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 11:51:12] [INFO ] Flatten gal took : 40 ms
[2025-06-03 11:51:12] [INFO ] Flatten gal took : 40 ms
[2025-06-03 11:51:12] [INFO ] Time to serialize gal into /tmp/LTL5067925100496777460.gal : 7 ms
[2025-06-03 11:51:12] [INFO ] Time to serialize properties into /tmp/LTL17839276150140233296.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/LTL5067925100496777460.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13353023569344877048.hoa' '-atoms' '/tmp/LTL17839276150140233296.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17839276150140233296.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13353023569344877048.hoa
Detected timeout of ITS tools.
[2025-06-03 11:51:27] [INFO ] Flatten gal took : 36 ms
[2025-06-03 11:51:28] [INFO ] Flatten gal took : 36 ms
[2025-06-03 11:51:28] [INFO ] Time to serialize gal into /tmp/LTL14637610094304047148.gal : 7 ms
[2025-06-03 11:51:28] [INFO ] Time to serialize properties into /tmp/LTL15662009761364591824.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/LTL14637610094304047148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15662009761364591824.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(EndTurn_5_5==0)"))||(("(EndTurn_5_5==0)")&&(F("((TestTurn_4_0==1)&&(Turn_0_4==1))"))))))
Formula 0 simplified : X(F!"(EndTurn_5_5==0)" & (!"(EndTurn_5_5==0)" | G!"((TestTurn_4_0==1)&&(Turn_0_4==1))"))
Detected timeout of ITS tools.
[2025-06-03 11:51:43] [INFO ] Flatten gal took : 36 ms
[2025-06-03 11:51:43] [INFO ] Applying decomposition
[2025-06-03 11:51:43] [INFO ] Flatten gal took : 38 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/graph457427084414262886.txt' '-o' '/tmp/graph457427084414262886.bin' '-w' '/tmp/graph457427084414262886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph457427084414262886.bin' '-l' '-1' '-v' '-w' '/tmp/graph457427084414262886.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:51:43] [INFO ] Decomposing Gal with order
[2025-06-03 11:51:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:51:43] [INFO ] Removed a total of 1792 redundant transitions.
[2025-06-03 11:51:43] [INFO ] Flatten gal took : 79 ms
[2025-06-03 11:51:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-03 11:51:43] [INFO ] Time to serialize gal into /tmp/LTL10409072791979126457.gal : 17 ms
[2025-06-03 11:51:43] [INFO ] Time to serialize properties into /tmp/LTL17332687093707567292.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/LTL10409072791979126457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17332687093707567292.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G("(i20.u373.EndTurn_5_5==0)"))||(("(i20.u373.EndTurn_5_5==0)")&&(F("((i18.u392.TestTurn_4_0==1)&&(i18.u392.Turn_0_4==1))"))))))
Formula 0 simplified : X(F!"(i20.u373.EndTurn_5_5==0)" & (!"(i20.u373.EndTurn_5_5==0)" | G!"((i18.u392.TestTurn_4_0==1)&&(i18.u392.Turn_0_4==1))"))
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 180871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((p0&&X(p1)))&&F(!p2))||X(G((p0&&X(p1)))))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:51:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:51:58] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:52:01] [INFO ] Implicit Places using invariants in 2610 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2622 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2695 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (NOT p1), p2, (AND p2 p0 (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 360 ms.
Product exploration explored 100000 steps with 25000 reset in 368 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 p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411384 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 411384 steps, saw 248390 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-06-03 11:52:05] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:52:05] [INFO ] Computed 20 invariants in 12 ms
[2025-06-03 11:52:05] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 181/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 260/443 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 258/701 variables, 42/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/701 variables, 42/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 6/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/1133 variables, 72/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1133 variables, 72/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 324/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1020/2153 variables, 6/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2153 variables, 1020/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2153 variables, 0/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/2159 variables, 6/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2159 variables, 6/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2159 variables, 0/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 984/3143 variables, 1026/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2476 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 181/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 260/443 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/701 variables, 42/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 42/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 6/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/701 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 432/1133 variables, 72/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 72/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 324/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1133 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1020/2153 variables, 6/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2153 variables, 1020/1959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:09] [INFO ] Deduced a trap composed of 15 places in 555 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:10] [INFO ] Deduced a trap composed of 19 places in 513 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:10] [INFO ] Deduced a trap composed of 23 places in 496 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:11] [INFO ] Deduced a trap composed of 27 places in 512 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:11] [INFO ] Deduced a trap composed of 31 places in 499 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:12] [INFO ] Deduced a trap composed of 35 places in 483 ms of which 55 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2153 variables, 6/1965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2153 variables, 0/1965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/2159 variables, 6/1971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2159 variables, 6/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2159/3143 variables, and 1977 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5010 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 297/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7510ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1323 transition count 1444
Reduce places removed 586 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 587 rules applied. Total rules applied 1173 place count 737 transition count 1443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 1174 place count 736 transition count 1150
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1760 place count 443 transition count 1150
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1844 place count 401 transition count 1108
Applied a total of 1844 rules in 69 ms. Remains 401 /1323 variables (removed 922) and now considering 1108/2030 (removed 922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 401/1323 places, 1108/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 962424 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 1
Probabilistic random walk after 962424 steps, saw 127025 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2025-06-03 11:52:16] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2025-06-03 11:52:16] [INFO ] Computed 20 invariants in 4 ms
[2025-06-03 11:52:16] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 258/441 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 324/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 432/873 variables, 72/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 72/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 324/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 228/1101 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:17] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:17] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:17] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:17] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:17] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:52:18] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 13 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1757 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:52:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:52:19] [INFO ] Computed 20 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:52:21] [INFO ] Implicit Places using invariants in 2242 ms returned []
[2025-06-03 11:52:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:52:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:52:21] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:52:34] [INFO ] Implicit Places using invariants and state equation in 13070 ms returned []
Implicit Place search using SMT with State Equation took 15315 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:52:34] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:52:34] [INFO ] Invariant cache hit.
[2025-06-03 11:52:34] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30446ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30449ms
Finished structural reductions in LTL mode , in 1 iterations and 45819 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406648 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406648 steps, saw 245737 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2025-06-03 11:53:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:53:08] [INFO ] Invariant cache hit.
[2025-06-03 11:53:08] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 181/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 260/443 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 258/701 variables, 42/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/701 variables, 42/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 6/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/1133 variables, 72/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1133 variables, 72/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 324/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1020/2153 variables, 6/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2153 variables, 1020/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2153 variables, 0/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/2159 variables, 6/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2159 variables, 6/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2159 variables, 0/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 984/3143 variables, 1026/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2692 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 181/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 260/443 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/701 variables, 42/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 42/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 6/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/701 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 432/1133 variables, 72/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 72/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 324/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1133 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1020/2153 variables, 6/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2153 variables, 1020/1959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:12] [INFO ] Deduced a trap composed of 15 places in 549 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:12] [INFO ] Deduced a trap composed of 19 places in 529 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:13] [INFO ] Deduced a trap composed of 23 places in 524 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:14] [INFO ] Deduced a trap composed of 27 places in 546 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:14] [INFO ] Deduced a trap composed of 33 places in 499 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:15] [INFO ] Deduced a trap composed of 35 places in 471 ms of which 55 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2153 variables, 6/1965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2153 variables, 0/1965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/2159 variables, 6/1971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2159/3143 variables, and 1977 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 297/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7722ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1323 transition count 1444
Reduce places removed 586 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 587 rules applied. Total rules applied 1173 place count 737 transition count 1443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 1174 place count 736 transition count 1150
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1760 place count 443 transition count 1150
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1844 place count 401 transition count 1108
Applied a total of 1844 rules in 54 ms. Remains 401 /1323 variables (removed 922) and now considering 1108/2030 (removed 922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 401/1323 places, 1108/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 953896 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 953896 steps, saw 123042 distinct states, run finished after 3002 ms. (steps per millisecond=317 ) properties seen :0
[2025-06-03 11:53:18] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2025-06-03 11:53:18] [INFO ] Computed 20 invariants in 1 ms
[2025-06-03 11:53:18] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 258/441 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 324/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 432/873 variables, 72/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 72/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 324/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 228/1101 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:19] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:20] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:20] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:20] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:20] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:20] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1794 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2183ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 382 ms.
Product exploration explored 100000 steps with 25000 reset in 399 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1323 transition count 2030
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 258 Pre rules applied. Total rules applied 336 place count 1323 transition count 2209
Deduced a syphon composed of 594 places in 1 ms
Iterating global reduction 1 with 258 rules applied. Total rules applied 594 place count 1323 transition count 2209
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 744 place count 1173 transition count 2059
Deduced a syphon composed of 444 places in 0 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 894 place count 1173 transition count 2059
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 772 places in 1 ms
Iterating global reduction 1 with 328 rules applied. Total rules applied 1222 place count 1173 transition count 2059
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1514 place count 881 transition count 1767
Deduced a syphon composed of 480 places in 0 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 1806 place count 881 transition count 1767
Deduced a syphon composed of 480 places in 1 ms
Applied a total of 1806 rules in 224 ms. Remains 881 /1323 variables (removed 442) and now considering 1767/2030 (removed 263) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:53:23] [INFO ] Redundant transitions in 34 ms returned []
Running 1760 sub problems to find dead transitions.
[2025-06-03 11:53:23] [INFO ] Flow matrix only has 1557 transitions (discarded 210 similar events)
// Phase 1: matrix 1557 rows 881 cols
[2025-06-03 11:53:23] [INFO ] Computed 20 invariants in 3 ms
[2025-06-03 11:53:23] [INFO ] State equation strengthened by 509 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:45] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:45] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:45] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:45] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:46] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:46] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:46] [INFO ] Deduced a trap composed of 20 places in 286 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:47] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:47] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:47] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:48] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:48] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:48] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:48] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:49] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:49] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:49] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:50] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:50] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:50] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 29 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/881 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:51] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:52] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:52] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:52] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:52] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:53] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:53:53] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 26 ms to minimize.
SMT process timed out in 30415ms, After SMT, problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 30418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 881/1323 places, 1767/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30701 ms. Remains : 881/1323 places, 1767/2030 transitions.
Built C files in :
/tmp/ltsmin3000184487870304612
[2025-06-03 11:53:53] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3000184487870304612
Running compilation step : cd /tmp/ltsmin3000184487870304612;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3000184487870304612;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3000184487870304612;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:53:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:53:56] [INFO ] Computed 20 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:53:58] [INFO ] Implicit Places using invariants in 2175 ms returned []
[2025-06-03 11:53:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:53:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:53:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:54:11] [INFO ] Implicit Places using invariants and state equation in 12926 ms returned []
Implicit Place search using SMT with State Equation took 15125 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 11:54:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 11:54:11] [INFO ] Invariant cache hit.
[2025-06-03 11:54:11] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30460ms
Finished structural reductions in LTL mode , in 1 iterations and 45628 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin6896933823638916717
[2025-06-03 11:54:42] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6896933823638916717
Running compilation step : cd /tmp/ltsmin6896933823638916717;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6896933823638916717;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6896933823638916717;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 11:54:45] [INFO ] Flatten gal took : 34 ms
[2025-06-03 11:54:45] [INFO ] Flatten gal took : 35 ms
[2025-06-03 11:54:45] [INFO ] Time to serialize gal into /tmp/LTL6303972025211432110.gal : 9 ms
[2025-06-03 11:54:45] [INFO ] Time to serialize properties into /tmp/LTL814527439639931868.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/LTL6303972025211432110.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4520954332042896430.hoa' '-atoms' '/tmp/LTL814527439639931868.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...316
Loading property file /tmp/LTL814527439639931868.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4520954332042896430.hoa
Detected timeout of ITS tools.
[2025-06-03 11:55:00] [INFO ] Flatten gal took : 34 ms
[2025-06-03 11:55:00] [INFO ] Flatten gal took : 41 ms
[2025-06-03 11:55:00] [INFO ] Time to serialize gal into /tmp/LTL16944150291318931477.gal : 7 ms
[2025-06-03 11:55:00] [INFO ] Time to serialize properties into /tmp/LTL13982941480312399235.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/LTL16944150291318931477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13982941480312399235.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("(IsEndLoop_5_3_1==0)")&&(X("(BeginLoop_0_3_6==0)")))))||((X(("(IsEndLoop_5_3_1==0)")&&(X("(BeginLoop_0_3_6==0)"))))&&(F("(...201
Formula 0 simplified : X(XF(!"(IsEndLoop_5_3_1==0)" | X!"(BeginLoop_0_3_6==0)") & (X(!"(IsEndLoop_5_3_1==0)" | X!"(BeginLoop_0_3_6==0)") | G!"((IsEndLoop_5...185
Detected timeout of ITS tools.
[2025-06-03 11:55:15] [INFO ] Flatten gal took : 34 ms
[2025-06-03 11:55:15] [INFO ] Applying decomposition
[2025-06-03 11:55:15] [INFO ] Flatten gal took : 34 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/graph16133756063893712233.txt' '-o' '/tmp/graph16133756063893712233.bin' '-w' '/tmp/graph16133756063893712233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16133756063893712233.bin' '-l' '-1' '-v' '-w' '/tmp/graph16133756063893712233.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:55:15] [INFO ] Decomposing Gal with order
[2025-06-03 11:55:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:55:15] [INFO ] Removed a total of 1792 redundant transitions.
[2025-06-03 11:55:15] [INFO ] Flatten gal took : 83 ms
[2025-06-03 11:55:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-03 11:55:15] [INFO ] Time to serialize gal into /tmp/LTL10925265827270063369.gal : 18 ms
[2025-06-03 11:55:15] [INFO ] Time to serialize properties into /tmp/LTL2551971161891758149.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/LTL10925265827270063369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2551971161891758149.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(G(("(i6.i1.i2.u213.IsEndLoop_5_3_1==0)")&&(X("(i31.i1.i1.u103.BeginLoop_0_3_6==0)")))))||((X(("(i6.i1.i2.u213.IsEndLoop_5_3_1=...282
Formula 0 simplified : X(XF(!"(i6.i1.i2.u213.IsEndLoop_5_3_1==0)" | X!"(i31.i1.i1.u103.BeginLoop_0_3_6==0)") & (X(!"(i6.i1.i2.u213.IsEndLoop_5_3_1==0)" | X...266
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-14 finished in 212483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0)) U p1)||X(G(p2))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 11:55:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 11:55:31] [INFO ] Computed 27 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:55:33] [INFO ] Implicit Places using invariants in 2575 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2590 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 29 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2651 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 198 ms.
Product exploration explored 100000 steps with 0 reset in 223 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 96 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411272 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 411272 steps, saw 248314 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-06-03 11:55:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 11:55:37] [INFO ] Computed 20 invariants in 9 ms
[2025-06-03 11:55:37] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 181/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 260/443 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/701 variables, 42/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 42/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 6/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/1133 variables, 72/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1133 variables, 72/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 318/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1020/2153 variables, 6/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2153 variables, 1020/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2153 variables, 0/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/2159 variables, 6/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2159 variables, 6/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2159 variables, 0/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 984/3143 variables, 1026/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 181/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 260/443 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/701 variables, 42/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 42/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 6/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/1133 variables, 72/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1133 variables, 72/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 318/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1020/2153 variables, 6/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2153 variables, 1020/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2153 variables, 1/1959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:39] [INFO ] Deduced a trap composed of 12 places in 521 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:40] [INFO ] Deduced a trap composed of 16 places in 531 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:40] [INFO ] Deduced a trap composed of 20 places in 533 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:41] [INFO ] Deduced a trap composed of 24 places in 512 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:41] [INFO ] Deduced a trap composed of 28 places in 533 ms of which 57 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2153 variables, 5/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2153 variables, 0/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/2159 variables, 6/1970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2159 variables, 6/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2159 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 984/3143 variables, 1026/3002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3143 variables, 0/3002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3143 variables, 0/3002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3143/3143 variables, and 3002 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4232 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1323 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 735 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 735 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 441 transition count 1148
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 42 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 400/1323 places, 1107/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 968448 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 968448 steps, saw 128668 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
[2025-06-03 11:55:45] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2025-06-03 11:55:45] [INFO ] Computed 20 invariants in 5 ms
[2025-06-03 11:55:45] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:46] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:47] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:47] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:47] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:47] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 15 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1099 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1297 variables, 234/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1646 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2150ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2025-06-03 11:55:48] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:55:48] [INFO ] Implicit Places using invariants in 424 ms returned []
[2025-06-03 11:55:48] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:55:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:55:50] [INFO ] Implicit Places using invariants and state equation in 2284 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:55:50] [INFO ] Redundant transitions in 10 ms returned []
Running 1100 sub problems to find dead transitions.
[2025-06-03 11:55:50] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:55:50] [INFO ] Invariant cache hit.
[2025-06-03 11:55:50] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:58] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:58] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:58] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:58] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:58] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:58] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:59] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:59] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:59] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:59] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:55:59] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:00] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:00] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:00] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:00] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:00] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:00] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:01] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:01] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:02] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:02] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:02] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:03] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:03] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:03] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:03] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:03] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:04] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:04] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:04] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:04] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:04] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:04] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:05] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:05] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:05] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:05] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:05] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:06] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:15] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:15] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:15] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:16] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:16] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:16] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:16] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:16] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:16] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:17] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:17] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:17] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:17] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:17] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:17] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:18] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:18] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:18] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:18] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:18] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:20] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:20] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:20] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 20 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 483 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30024 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 63/483 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:23] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:23] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:24] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:24] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:24] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:24] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:24] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:24] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:25] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:26] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:26] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:26] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:26] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:29] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:30] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:30] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:30] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:30] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:30] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:30] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:31] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:35] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:35] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:35] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:35] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:35] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:35] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:36] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:37] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:37] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:37] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:37] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:37] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:38] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:38] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:42] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:42] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:42] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:42] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:42] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:42] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:43] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:43] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:43] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:43] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:43] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:44] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:44] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:44] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:44] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:44] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:44] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:45] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:46] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:56:47] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1297 variables, and 563 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30021 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 143/143 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62990 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 839 edges and 400 vertex of which 294 / 400 are part of one of the 42 SCC in 2 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 148 transition count 311
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 107 transition count 311
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 104 place count 93 transition count 304
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 86 transition count 297
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 125 place count 44 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 0 with 44 rules applied. Total rules applied 169 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 205 place count 2 transition count 2
Applied a total of 205 rules in 17 ms. Remains 2 /400 variables (removed 398) and now considering 2/1107 (removed 1105) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 11:56:51] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 11:56:51] [INFO ] After 22ms 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-06-03 11:56:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 11:56:51] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 11:56:51] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 11:56:51] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 140 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p2)]
Support contains 1 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1323 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 735 transition count 1442
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 1176 place count 735 transition count 1149
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1844 place count 401 transition count 1108
Applied a total of 1844 rules in 53 ms. Remains 401 /1323 variables (removed 922) and now considering 1108/2030 (removed 922) transitions.
[2025-06-03 11:56:51] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2025-06-03 11:56:51] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:56:51] [INFO ] Implicit Places using invariants in 469 ms returned []
[2025-06-03 11:56:51] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2025-06-03 11:56:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:56:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:56:54] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:56:54] [INFO ] Redundant transitions in 13 ms returned []
Running 1101 sub problems to find dead transitions.
[2025-06-03 11:56:54] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2025-06-03 11:56:54] [INFO ] Invariant cache hit.
[2025-06-03 11:56:54] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:01] [INFO ] Deduced a trap composed of 10 places in 471 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:01] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:02] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:02] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:02] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:02] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:02] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:02] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:03] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:03] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:03] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:03] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:03] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:03] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:04] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:04] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:04] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:04] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:04] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:05] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:05] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:06] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:06] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:06] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:06] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:06] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:07] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:07] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:07] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:07] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:07] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:08] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:08] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:08] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:08] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:08] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:08] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:09] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:09] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:09] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:19] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:19] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:19] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:19] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:19] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:20] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:20] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:20] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:20] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:20] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:21] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:21] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:21] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:21] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:21] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:21] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:22] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:22] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:22] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:22] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:24] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:24] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 19 ms to minimize.
SMT process timed out in 30301ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 30303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 401/1323 places, 1108/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33109 ms. Remains : 401/1323 places, 1108/2030 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 959656 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 1
Probabilistic random walk after 959656 steps, saw 124367 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
[2025-06-03 11:57:27] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2025-06-03 11:57:27] [INFO ] Invariant cache hit.
[2025-06-03 11:57:27] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:28] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:28] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:28] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:29] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:29] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1478 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 401 transition count 1107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 1107
Applied a total of 2 rules in 17 ms. Remains 400 /401 variables (removed 1) and now considering 1107/1108 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 400/401 places, 1107/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 970120 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 970120 steps, saw 128884 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2025-06-03 11:57:32] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2025-06-03 11:57:32] [INFO ] Computed 20 invariants in 4 ms
[2025-06-03 11:57:32] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:33] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:33] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:33] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:34] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:34] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1099 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1297 variables, 234/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1572 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1980ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2025-06-03 11:57:34] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:57:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:57:35] [INFO ] Implicit Places using invariants in 645 ms returned []
[2025-06-03 11:57:35] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:57:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:57:37] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2806 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:57:37] [INFO ] Redundant transitions in 11 ms returned []
Running 1100 sub problems to find dead transitions.
[2025-06-03 11:57:37] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:57:37] [INFO ] Invariant cache hit.
[2025-06-03 11:57:37] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:44] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:44] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:44] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:45] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:45] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:45] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:45] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:45] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:46] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:46] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:46] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:46] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:47] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:47] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:47] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:47] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:47] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:48] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:48] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:49] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:49] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:49] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:49] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:50] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:50] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:50] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:50] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:50] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:50] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:51] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:51] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:51] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:51] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:52] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:52] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:52] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:52] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:52] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:57:52] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:01] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:01] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:01] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:01] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:02] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:03] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:03] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:03] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:03] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:03] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:04] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:04] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:04] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:04] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:06] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:07] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:07] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:07] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:07] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:07] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 9 ms to minimize.
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33184 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 839 edges and 400 vertex of which 294 / 400 are part of one of the 42 SCC in 0 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 148 transition count 311
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 107 transition count 311
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 104 place count 93 transition count 304
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 86 transition count 297
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 125 place count 44 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 0 with 44 rules applied. Total rules applied 169 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 205 place count 2 transition count 2
Applied a total of 205 rules in 9 ms. Remains 2 /400 variables (removed 398) and now considering 2/1107 (removed 1105) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 11:58:07] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 11:58:07] [INFO ] After 90ms 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-06-03 11:58:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 11:58:07] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 11:58:07] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 11:58:07] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 129 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Built C files in :
/tmp/ltsmin16232068009041423952
[2025-06-03 11:58:08] [INFO ] Computing symmetric may disable matrix : 1108 transitions.
[2025-06-03 11:58:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:58:08] [INFO ] Computing symmetric may enable matrix : 1108 transitions.
[2025-06-03 11:58:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:58:08] [INFO ] Computing Do-Not-Accords matrix : 1108 transitions.
[2025-06-03 11:58:08] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:58:08] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16232068009041423952
Running compilation step : cd /tmp/ltsmin16232068009041423952;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16232068009041423952;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16232068009041423952;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 401 transition count 1107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 1107
Applied a total of 2 rules in 15 ms. Remains 400 /401 variables (removed 1) and now considering 1107/1108 (removed 1) transitions.
[2025-06-03 11:58:11] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2025-06-03 11:58:11] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:58:12] [INFO ] Implicit Places using invariants in 694 ms returned []
[2025-06-03 11:58:12] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:58:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:58:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:58:14] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:58:14] [INFO ] Redundant transitions in 11 ms returned []
Running 1100 sub problems to find dead transitions.
[2025-06-03 11:58:14] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:58:14] [INFO ] Invariant cache hit.
[2025-06-03 11:58:14] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:21] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:22] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:22] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:22] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:22] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:22] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:22] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:23] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:23] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:23] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:23] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:24] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:24] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:24] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:24] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:24] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:25] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:25] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:25] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:25] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:26] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:26] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:26] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:27] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:27] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:27] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:27] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:27] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:27] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:28] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:28] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:28] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:28] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:29] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:29] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:29] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:29] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:29] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:29] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:30] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:38] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:38] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:38] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:39] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:40] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:40] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:40] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:40] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:40] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:40] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:41] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:41] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:41] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:41] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:43] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:43] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:43] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:43] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:43] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:43] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:44] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:44] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:44] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:44] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:44] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:44] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:58:45] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 14 ms to minimize.
SMT process timed out in 30209ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/401 places, 1107/1108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33124 ms. Remains : 400/401 places, 1107/1108 transitions.
Built C files in :
/tmp/ltsmin15855824544937504947
[2025-06-03 11:58:45] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2025-06-03 11:58:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:58:45] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2025-06-03 11:58:45] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:58:45] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2025-06-03 11:58:45] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:58:45] [INFO ] Built C files in 281ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15855824544937504947
Running compilation step : cd /tmp/ltsmin15855824544937504947;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15855824544937504947;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15855824544937504947;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 11:58:48] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:58:48] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:58:48] [INFO ] Time to serialize gal into /tmp/LTL8152897866281329075.gal : 4 ms
[2025-06-03 11:58:48] [INFO ] Time to serialize properties into /tmp/LTL4885647369033389126.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/LTL8152897866281329075.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17701937324533663574.hoa' '-atoms' '/tmp/LTL4885647369033389126.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/LTL4885647369033389126.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17701937324533663574.hoa
Detected timeout of ITS tools.
[2025-06-03 11:59:03] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:59:03] [INFO ] Flatten gal took : 20 ms
[2025-06-03 11:59:03] [INFO ] Time to serialize gal into /tmp/LTL9858447132261693236.gal : 3 ms
[2025-06-03 11:59:03] [INFO ] Time to serialize properties into /tmp/LTL2276259912103427621.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/LTL9858447132261693236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2276259912103427621.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(X("((TestTurn_1_5==1)&&(Turn_5_1==1))")))U("((Turn_1_2==1)&&(AskForSection_5_1==1))"))||(X(G("(IsEndLoop_5_2_6==0)")))))
Formula 0 simplified : !"((Turn_1_2==1)&&(AskForSection_5_1==1))" & X(F!"(IsEndLoop_5_2_6==0)" & (!"((Turn_1_2==1)&&(AskForSection_5_1==1))" W F!"((TestTur...183
Detected timeout of ITS tools.
[2025-06-03 11:59:18] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:59:18] [INFO ] Applying decomposition
[2025-06-03 11:59:18] [INFO ] Flatten gal took : 20 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/graph3432671355252666651.txt' '-o' '/tmp/graph3432671355252666651.bin' '-w' '/tmp/graph3432671355252666651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3432671355252666651.bin' '-l' '-1' '-v' '-w' '/tmp/graph3432671355252666651.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:59:18] [INFO ] Decomposing Gal with order
[2025-06-03 11:59:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:59:18] [INFO ] Removed a total of 1568 redundant transitions.
[2025-06-03 11:59:18] [INFO ] Flatten gal took : 48 ms
[2025-06-03 11:59:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 420 labels/synchronizations in 31 ms.
[2025-06-03 11:59:18] [INFO ] Time to serialize gal into /tmp/LTL10566938083413491835.gal : 12 ms
[2025-06-03 11:59:18] [INFO ] Time to serialize properties into /tmp/LTL11923355384809017321.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/LTL10566938083413491835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11923355384809017321.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((G(X("((i7.u19.TestTurn_1_5==1)&&(i7.u31.Turn_5_1==1))")))U("((i13.u46.Turn_1_2==1)&&(i11.u39.AskForSection_5_1==1))"))||(X(G("(i1...185
Formula 0 simplified : !"((i13.u46.Turn_1_2==1)&&(i11.u39.AskForSection_5_1==1))" & X(F!"(i11.u5.IsEndLoop_5_2_6==0)" & (!"((i13.u46.Turn_1_2==1)&&(i11.u39...236
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-15 finished in 242914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p1)))||p0)))'
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)||(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((p0&&X(p1)))&&F(!p2))||X(G((p0&&X(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0)) U p1)||X(G(p2))))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLFireability-15
Stuttering acceptance computed with spot in 264 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 1176 place count 742 transition count 1149
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1762 place count 449 transition count 1149
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1844 place count 408 transition count 1108
Applied a total of 1844 rules in 52 ms. Remains 408 /1330 variables (removed 922) and now considering 1108/2030 (removed 922) transitions.
[2025-06-03 11:59:34] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2025-06-03 11:59:34] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:59:35] [INFO ] Implicit Places using invariants in 474 ms returned [388, 389, 391, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 486 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 401/1330 places, 1108/2030 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 548 ms. Remains : 401/1330 places, 1108/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 209 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 129 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 962688 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 1
Probabilistic random walk after 962688 steps, saw 124368 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2025-06-03 11:59:38] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2025-06-03 11:59:38] [INFO ] Computed 20 invariants in 4 ms
[2025-06-03 11:59:38] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:39] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:39] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:40] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:40] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:40] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1466 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1840ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 401 transition count 1107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 1107
Applied a total of 2 rules in 15 ms. Remains 400 /401 variables (removed 1) and now considering 1107/1108 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 400/401 places, 1107/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 964608 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 964608 steps, saw 127841 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2025-06-03 11:59:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2025-06-03 11:59:43] [INFO ] Computed 20 invariants in 4 ms
[2025-06-03 11:59:43] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:44] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:44] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:44] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:45] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:45] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1099 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1297 variables, 234/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1453 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1820ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2025-06-03 11:59:45] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:59:46] [INFO ] Implicit Places using invariants in 483 ms returned []
[2025-06-03 11:59:46] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:59:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 11:59:48] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:59:48] [INFO ] Redundant transitions in 10 ms returned []
Running 1100 sub problems to find dead transitions.
[2025-06-03 11:59:48] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 11:59:48] [INFO ] Invariant cache hit.
[2025-06-03 11:59:48] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:55] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:55] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:55] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:56] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:56] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:56] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:56] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:56] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:56] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:57] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:57] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:57] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:58] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:58] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:58] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:58] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:58] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:58] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:59] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:59:59] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:00] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:00] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:00] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:00] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:01] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:01] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:01] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:01] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:01] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:01] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:02] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:02] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:02] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:02] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:03] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:03] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:03] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:03] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:03] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:03] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:12] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:12] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:12] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:12] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:12] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:13] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:13] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:13] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:13] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:13] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:13] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:14] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:14] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:14] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:14] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:14] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:15] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:15] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:15] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:15] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:17] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:18] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:18] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:18] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:18] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:18] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 9 ms to minimize.
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33025 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 839 edges and 400 vertex of which 294 / 400 are part of one of the 42 SCC in 0 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 148 transition count 311
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 107 transition count 311
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 104 place count 93 transition count 304
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 86 transition count 297
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 125 place count 44 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 0 with 44 rules applied. Total rules applied 169 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 205 place count 2 transition count 2
Applied a total of 205 rules in 7 ms. Remains 2 /400 variables (removed 398) and now considering 2/1107 (removed 1105) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 12:00:18] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 12:00:18] [INFO ] After 41ms 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-06-03 12:00:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 12:00:18] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 12:00:18] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 12:00:18] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 77 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p2)]
Support contains 1 out of 401 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2025-06-03 12:00:18] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2025-06-03 12:00:18] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:00:19] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-06-03 12:00:19] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2025-06-03 12:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:00:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 12:00:21] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:00:21] [INFO ] Redundant transitions in 10 ms returned []
Running 1101 sub problems to find dead transitions.
[2025-06-03 12:00:21] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2025-06-03 12:00:21] [INFO ] Invariant cache hit.
[2025-06-03 12:00:21] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:28] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:29] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:29] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:29] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:29] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:29] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:30] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:30] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:30] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:30] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:30] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:30] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:31] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:31] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:31] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:31] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:31] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:32] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:32] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:32] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:33] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:33] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:33] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:33] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:34] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:34] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:34] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:34] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:34] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:34] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:35] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:35] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:35] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:35] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:35] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:35] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:36] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:36] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:36] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:36] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:46] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:46] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:46] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:46] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:46] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:47] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:47] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:47] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:47] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:47] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:48] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:48] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:48] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:48] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:48] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:48] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:49] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:49] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:49] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:49] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:51] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:51] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:51] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:51] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:52] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 17 ms to minimize.
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 30192ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33189 ms. Remains : 401/401 places, 1108/1108 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 957928 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 1
Probabilistic random walk after 957928 steps, saw 124367 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
[2025-06-03 12:00:55] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2025-06-03 12:00:55] [INFO ] Invariant cache hit.
[2025-06-03 12:00:55] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:56] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:56] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:56] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:56] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:00:56] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1516 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1942ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 401 transition count 1107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 1107
Applied a total of 2 rules in 14 ms. Remains 400 /401 variables (removed 1) and now considering 1107/1108 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 400/401 places, 1107/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 963848 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 963848 steps, saw 127572 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2025-06-03 12:01:00] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2025-06-03 12:01:00] [INFO ] Computed 20 invariants in 2 ms
[2025-06-03 12:01:00] [INFO ] State equation strengthened by 330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1105 variables, 6/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1297 variables, 234/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/181 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/439 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/871 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 72/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 318/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1099 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1099 variables, 228/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1099 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:01] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:01] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:01] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:01] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:02] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1099 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1099 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1105 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1297 variables, 234/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1297 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1529 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2031ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2025-06-03 12:01:02] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 12:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:01:02] [INFO ] Implicit Places using invariants in 423 ms returned []
[2025-06-03 12:01:02] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 12:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:01:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 12:01:05] [INFO ] Implicit Places using invariants and state equation in 2323 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:01:05] [INFO ] Redundant transitions in 10 ms returned []
Running 1100 sub problems to find dead transitions.
[2025-06-03 12:01:05] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 12:01:05] [INFO ] Invariant cache hit.
[2025-06-03 12:01:05] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:12] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:12] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:12] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:12] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:13] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:13] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:13] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:13] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:13] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:13] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:14] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:14] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:14] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:15] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:15] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:15] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:15] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:15] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:15] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:16] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:17] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:17] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:17] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:17] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:17] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:17] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:18] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:18] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:18] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:18] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:18] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:19] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:19] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:19] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:19] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:20] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:20] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:20] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:20] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:20] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:29] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:29] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:29] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:29] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:29] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:29] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:30] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:30] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:30] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:30] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:30] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:31] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:31] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:31] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:31] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:31] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:31] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:32] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:32] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:32] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:34] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:35] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:35] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:35] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 21 ms to minimize.
SMT process timed out in 30264ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33068 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 839 edges and 400 vertex of which 294 / 400 are part of one of the 42 SCC in 0 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 148 transition count 311
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 107 transition count 311
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 104 place count 93 transition count 304
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 86 transition count 297
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 125 place count 44 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions (Output transitions of discarded places.) removed 216 transitions
Iterating post reduction 0 with 44 rules applied. Total rules applied 169 place count 2 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 205 place count 2 transition count 2
Applied a total of 205 rules in 6 ms. Remains 2 /400 variables (removed 398) and now considering 2/1107 (removed 1105) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 12:01:35] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 12:01:35] [INFO ] After 26ms 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-06-03 12:01:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 12:01:35] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 12:01:35] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 12:01:35] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 88 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 209 ms.
Built C files in :
/tmp/ltsmin7181105876775391733
[2025-06-03 12:01:36] [INFO ] Computing symmetric may disable matrix : 1108 transitions.
[2025-06-03 12:01:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:01:36] [INFO ] Computing symmetric may enable matrix : 1108 transitions.
[2025-06-03 12:01:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:01:36] [INFO ] Computing Do-Not-Accords matrix : 1108 transitions.
[2025-06-03 12:01:36] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:01:36] [INFO ] Built C files in 217ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7181105876775391733
Running compilation step : cd /tmp/ltsmin7181105876775391733;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7181105876775391733;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7181105876775391733;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 401 transition count 1107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 1107
Applied a total of 2 rules in 14 ms. Remains 400 /401 variables (removed 1) and now considering 1107/1108 (removed 1) transitions.
[2025-06-03 12:01:39] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2025-06-03 12:01:39] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:01:39] [INFO ] Implicit Places using invariants in 438 ms returned []
[2025-06-03 12:01:39] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 12:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:01:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 12:01:42] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:01:42] [INFO ] Redundant transitions in 10 ms returned []
Running 1100 sub problems to find dead transitions.
[2025-06-03 12:01:42] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2025-06-03 12:01:42] [INFO ] Invariant cache hit.
[2025-06-03 12:01:42] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:49] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:49] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:49] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:49] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:49] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:50] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:50] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:50] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:50] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:50] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:50] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:51] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:51] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:51] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:51] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:52] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:52] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:52] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:52] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:52] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:53] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:53] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:54] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:54] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:54] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:54] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:54] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:55] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:55] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:55] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:55] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:55] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:56] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:56] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:56] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:56] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:56] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:57] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:57] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:01:57] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:05] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:06] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:07] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:07] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:07] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:07] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:07] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:07] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:08] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:08] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:08] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:08] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:08] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:08] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:10] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:10] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:10] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:10] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:10] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:11] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:11] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:11] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:11] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:11] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:11] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:12] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:12] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:02:12] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 15 ms to minimize.
SMT process timed out in 30289ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30291ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/401 places, 1107/1108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33067 ms. Remains : 400/401 places, 1107/1108 transitions.
Built C files in :
/tmp/ltsmin16300162733089562035
[2025-06-03 12:02:12] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2025-06-03 12:02:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:02:12] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2025-06-03 12:02:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:02:12] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2025-06-03 12:02:12] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:02:12] [INFO ] Built C files in 234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16300162733089562035
Running compilation step : cd /tmp/ltsmin16300162733089562035;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16300162733089562035;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16300162733089562035;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 12:02:15] [INFO ] Flatten gal took : 20 ms
[2025-06-03 12:02:15] [INFO ] Flatten gal took : 21 ms
[2025-06-03 12:02:15] [INFO ] Time to serialize gal into /tmp/LTL5634869303002412436.gal : 5 ms
[2025-06-03 12:02:15] [INFO ] Time to serialize properties into /tmp/LTL3969295523617216392.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/LTL5634869303002412436.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10871955689385042983.hoa' '-atoms' '/tmp/LTL3969295523617216392.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/LTL3969295523617216392.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10871955689385042983.hoa
Detected timeout of ITS tools.
[2025-06-03 12:02:30] [INFO ] Flatten gal took : 21 ms
[2025-06-03 12:02:30] [INFO ] Flatten gal took : 21 ms
[2025-06-03 12:02:30] [INFO ] Time to serialize gal into /tmp/LTL15220937687546055260.gal : 4 ms
[2025-06-03 12:02:30] [INFO ] Time to serialize properties into /tmp/LTL15021149434826252082.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/LTL15220937687546055260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15021149434826252082.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((G(X("((TestTurn_1_5==1)&&(Turn_5_1==1))")))U("((Turn_1_2==1)&&(AskForSection_5_1==1))"))||(X(G("(IsEndLoop_5_2_6==0)")))))
Formula 0 simplified : !"((Turn_1_2==1)&&(AskForSection_5_1==1))" & X(F!"(IsEndLoop_5_2_6==0)" & (!"((Turn_1_2==1)&&(AskForSection_5_1==1))" W F!"((TestTur...183
Detected timeout of ITS tools.
[2025-06-03 12:02:45] [INFO ] Flatten gal took : 20 ms
[2025-06-03 12:02:45] [INFO ] Applying decomposition
[2025-06-03 12:02:46] [INFO ] Flatten gal took : 21 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/graph16312060490143780504.txt' '-o' '/tmp/graph16312060490143780504.bin' '-w' '/tmp/graph16312060490143780504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16312060490143780504.bin' '-l' '-1' '-v' '-w' '/tmp/graph16312060490143780504.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:02:46] [INFO ] Decomposing Gal with order
[2025-06-03 12:02:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:02:46] [INFO ] Removed a total of 1568 redundant transitions.
[2025-06-03 12:02:46] [INFO ] Flatten gal took : 44 ms
[2025-06-03 12:02:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 408 labels/synchronizations in 40 ms.
[2025-06-03 12:02:46] [INFO ] Time to serialize gal into /tmp/LTL14763755517061932972.gal : 7 ms
[2025-06-03 12:02:46] [INFO ] Time to serialize properties into /tmp/LTL15512178549184660020.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/LTL14763755517061932972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15512178549184660020.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((G(X("((i8.u28.TestTurn_1_5==1)&&(i8.u30.Turn_5_1==1))")))U("((i2.u48.Turn_1_2==1)&&(i5.u42.AskForSection_5_1==1))"))||(X(G("(i5.u...183
Formula 0 simplified : !"((i2.u48.Turn_1_2==1)&&(i5.u42.AskForSection_5_1==1))" & X(F!"(i5.u37.IsEndLoop_5_2_6==0)" & (!"((i2.u48.Turn_1_2==1)&&(i5.u42.Ask...232
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-15 finished in 206977 ms.
[2025-06-03 12:03:01] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17920259044919236596
[2025-06-03 12:03:01] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2025-06-03 12:03:01] [INFO ] Applying decomposition
[2025-06-03 12:03:01] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17920259044919236596
Running compilation step : cd /tmp/ltsmin17920259044919236596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 12:03:01] [INFO ] Flatten gal took : 34 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/graph9319527735059269365.txt' '-o' '/tmp/graph9319527735059269365.bin' '-w' '/tmp/graph9319527735059269365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9319527735059269365.bin' '-l' '-1' '-v' '-w' '/tmp/graph9319527735059269365.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:03:01] [INFO ] Decomposing Gal with order
[2025-06-03 12:03:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:03:01] [INFO ] Removed a total of 1786 redundant transitions.
[2025-06-03 12:03:01] [INFO ] Flatten gal took : 109 ms
[2025-06-03 12:03:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 12:03:01] [INFO ] Time to serialize gal into /tmp/LTLFireability7600073240392782193.gal : 27 ms
[2025-06-03 12:03:01] [INFO ] Time to serialize properties into /tmp/LTLFireability16306362824660965754.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/LTLFireability7600073240392782193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16306362824660965754.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(("(((((((i26.u23.TestTurn_3_1==1)&&(i26.u23.Turn_1_3==1))||((i7.u41.TestTurn_5_5==1)&&(i7.u41.Turn_5_5==1)))||(((i7.u191.TestTurn...2589
Formula 0 simplified : F(!"(((((((i26.u23.TestTurn_3_1==1)&&(i26.u23.Turn_1_3==1))||((i7.u41.TestTurn_5_5==1)&&(i7.u41.Turn_5_5==1)))||(((i7.u191.TestTurn_...2575
Compilation finished in 4394 ms.
Running link step : cd /tmp/ltsmin17920259044919236596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin17920259044919236596;'/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((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17920259044919236596;'/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((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17920259044919236596;'/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(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17920259044919236596;'/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(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17920259044919236596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((X(((LTLAPp4==true)&&X((LTLAPp5==true))))&&<>(!(LTLAPp6==true)))||X([](((LTLAPp4==true)&&X((LTLAPp5==true)))))))' '--buchi-type=spotba'
LTSmin run took 1844 ms.
FORMULA Peterson-PT-6-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17920259044919236596;'/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((LTLAPp7==true))) U (LTLAPp8==true))||X([]((LTLAPp9==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17920259044919236596;'/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((LTLAPp7==true))) U (LTLAPp8==true))||X([]((LTLAPp9==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin17920259044919236596;'/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((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 12:30:03] [INFO ] Applying decomposition
[2025-06-03 12:30:03] [INFO ] Flatten gal took : 405 ms
[2025-06-03 12:30:03] [INFO ] Decomposing Gal with order
[2025-06-03 12:30:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:30:06] [INFO ] Removed a total of 1330 redundant transitions.
[2025-06-03 12:30:06] [INFO ] Flatten gal took : 2074 ms
[2025-06-03 12:30:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 93 ms.
[2025-06-03 12:30:06] [INFO ] Time to serialize gal into /tmp/LTLFireability3061916485429793305.gal : 64 ms
[2025-06-03 12:30:06] [INFO ] Time to serialize properties into /tmp/LTLFireability1246610084869587799.ltl : 9 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/LTLFireability3061916485429793305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1246610084869587799.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((G(("(((((((u7.TestTurn_3_1==1)&&(u10.Turn_1_3==1))||((u3.TestTurn_5_5==1)&&(u11.Turn_5_5==1)))||(((u6.TestTurn_2_5==1)&&(u11.Turn_5...2099
Formula 0 simplified : F(!"(((((((u7.TestTurn_3_1==1)&&(u10.Turn_1_3==1))||((u3.TestTurn_5_5==1)&&(u11.Turn_5_5==1)))||(((u6.TestTurn_2_5==1)&&(u11.Turn_5_...2085

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Peterson-PT-6"
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 Peterson-PT-6, 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 r142-tall-174876813000628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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