MCC'2026- Execution of r191-oct2-177969025600054

About the Execution of 2025-gold for MultiCrashLeafsetExtension-PT-S16C07

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16209.884	3600000.00	4198140.00	62305.00	1 1 1 1 ? 1 1 0 1 ? 1 1 1 1 1 1	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600054.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is MultiCrashLeafsetExtension-PT-S16C07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 7.4K Mar 7 19:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Mar 7 19:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 15 11:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 11:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 19:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 11:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942966090

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:36:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 04:36:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:36:08] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2026-05-28 04:36:08] [INFO ] Transformed 6222 places.
[2026-05-28 04:36:08] [INFO ] Transformed 8685 transitions.
[2026-05-28 04:36:08] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-28 04:36:08] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2026-05-28 04:36:08] [INFO ] Computed 611 invariants in 462 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 17, 51, 17, 17, 17, 17, 1, 51, 1, 17, 17, 51, +inf, 17, 51]
RANDOM walk for 10000 steps (137 resets) in 170 ms. (58 steps per ms)
BEST_FIRST walk for 160013 steps (608 resets) in 692 ms. (230 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1] Max Struct:[17, 17, 51, 17, 17, 17, 17, 1, 51, 1, 17, 17, 51, +inf, 17, 51]
[2026-05-28 04:36:09] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
[2026-05-28 04:36:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:10] [INFO ] [Real]Absence check using 52 positive place invariants in 115 ms returned sat
[2026-05-28 04:36:10] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 200 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:11] [INFO ] [Real]Absence check using 52 positive place invariants in 80 ms returned sat
[2026-05-28 04:36:12] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 129 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:12] [INFO ] [Real]Absence check using 52 positive place invariants in 132 ms returned sat
[2026-05-28 04:36:12] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 190 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:13] [INFO ] [Real]Absence check using 52 positive place invariants in 82 ms returned sat
[2026-05-28 04:36:13] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 136 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:14] [INFO ] [Real]Absence check using 52 positive place invariants in 82 ms returned sat
[2026-05-28 04:36:14] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 238 ms returned sat
[2026-05-28 04:36:18] [INFO ] [Real]Absence check using state equation in 4117 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:19] [INFO ] [Real]Absence check using 52 positive place invariants in 80 ms returned sat
[2026-05-28 04:36:19] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 131 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:20] [INFO ] [Real]Absence check using 52 positive place invariants in 68 ms returned sat
[2026-05-28 04:36:20] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 206 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 52 positive place invariants in 73 ms returned sat
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 274 ms returned sat
[2026-05-28 04:36:25] [INFO ] [Real]Absence check using state equation in 4040 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:26] [INFO ] [Real]Absence check using 52 positive place invariants in 72 ms returned sat
[2026-05-28 04:36:26] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 124 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:27] [INFO ] [Real]Absence check using 52 positive place invariants in 84 ms returned sat
[2026-05-28 04:36:27] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 206 ms returned sat
[2026-05-28 04:36:31] [INFO ] [Real]Absence check using state equation in 4015 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:32] [INFO ] [Real]Absence check using 52 positive place invariants in 72 ms returned sat
[2026-05-28 04:36:32] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 119 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:33] [INFO ] [Real]Absence check using 52 positive place invariants in 73 ms returned sat
[2026-05-28 04:36:33] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 114 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:34] [INFO ] [Real]Absence check using 52 positive place invariants in 93 ms returned sat
[2026-05-28 04:36:34] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 164 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:35] [INFO ] [Real]Absence check using 52 positive place invariants in 72 ms returned sat
[2026-05-28 04:36:35] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 125 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:36] [INFO ] [Real]Absence check using 52 positive place invariants in 74 ms returned sat
[2026-05-28 04:36:36] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 137 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:37] [INFO ] [Real]Absence check using 52 positive place invariants in 71 ms returned sat
[2026-05-28 04:36:37] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 161 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[17, 1, 1]
Support contains 3 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.33 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1903 transitions
Trivial Post-agglo rules discarded 1903 transitions
Performed 1903 trivial Post agglomeration. Transition count delta: 1903
Iterating post reduction 0 with 1903 rules applied. Total rules applied 1904 place count 6188 transition count 6782
Reduce places removed 1903 places and 0 transitions.
Iterating post reduction 1 with 1903 rules applied. Total rules applied 3807 place count 4285 transition count 6782
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 3807 place count 4285 transition count 6544
Deduced a syphon composed of 238 places in 6 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 4283 place count 4047 transition count 6544
Discarding 1665 places :
Symmetric choice reduction at 2 with 1665 rule applications. Total rules 5948 place count 2382 transition count 4879
Iterating global reduction 2 with 1665 rules applied. Total rules applied 7613 place count 2382 transition count 4879
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 7613 place count 2382 transition count 4866
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 7639 place count 2369 transition count 4866
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 7876 place count 2132 transition count 3207
Iterating global reduction 2 with 237 rules applied. Total rules applied 8113 place count 2132 transition count 3207
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 8147 place count 2115 transition count 3190
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 8307 place count 2115 transition count 4452
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 8467 place count 1955 transition count 4452
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 8484 place count 1955 transition count 4452
Applied a total of 8484 rules in 1764 ms. Remains 1955 /6222 variables (removed 4267) and now considering 4452/8685 (removed 4233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1791 ms. Remains : 1955/6222 places, 4452/8685 transitions.
[2026-05-28 04:36:39] [INFO ] Flow matrix only has 4055 transitions (discarded 397 similar events)
// Phase 1: matrix 4055 rows 1955 cols
[2026-05-28 04:36:39] [INFO ] Computed 577 invariants in 96 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (22912 resets) in 18105 ms. (55 steps per ms)
BEST_FIRST walk for 3000003 steps (12894 resets) in 12251 ms. (244 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-28 04:37:09] [INFO ] Flow matrix only has 4055 transitions (discarded 397 similar events)
[2026-05-28 04:37:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:09] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2026-05-28 04:37:10] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 121 ms returned sat
[2026-05-28 04:37:11] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2026-05-28 04:37:11] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:37:12] [INFO ] [Real]Added 2450 Read/Feed constraints in 530 ms returned sat
[2026-05-28 04:37:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2026-05-28 04:37:12] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 148 ms returned sat
[2026-05-28 04:37:15] [INFO ] [Nat]Absence check using state equation in 2104 ms returned sat
[2026-05-28 04:37:16] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1173 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:17] [INFO ] Deduced a trap composed of 80 places in 1615 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:20] [INFO ] Deduced a trap composed of 80 places in 1916 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:22] [INFO ] Deduced a trap composed of 80 places in 1906 ms of which 197 ms to minimize.
[2026-05-28 04:37:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7080 ms
[2026-05-28 04:37:23] [INFO ] Computed and/alt/rep : 1646/4162/1646 causal constraints (skipped 2392 transitions) in 408 ms.
[2026-05-28 04:37:25] [INFO ] Added : 16 causal constraints over 4 iterations in 2098 ms. Result :sat
Minimization took 5229 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:30] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2026-05-28 04:37:31] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 98 ms returned sat
[2026-05-28 04:37:32] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2026-05-28 04:37:32] [INFO ] [Real]Added 2450 Read/Feed constraints in 495 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:32] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2026-05-28 04:37:33] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 93 ms returned sat
[2026-05-28 04:37:34] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2026-05-28 04:37:34] [INFO ] [Real]Added 2450 Read/Feed constraints in 431 ms returned sat
[2026-05-28 04:37:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 88 ms returned sat
[2026-05-28 04:37:35] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 115 ms returned sat
[2026-05-28 04:37:36] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2026-05-28 04:37:41] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:37:41] [INFO ] [Nat]Added 2450 Read/Feed constraints in 4734 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:43] [INFO ] Deduced a trap composed of 140 places in 2053 ms of which 276 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:46] [INFO ] Deduced a trap composed of 81 places in 2406 ms of which 202 ms to minimize.
[2026-05-28 04:37:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5004 ms
[2026-05-28 04:37:46] [INFO ] Computed and/alt/rep : 1646/4162/1646 causal constraints (skipped 2392 transitions) in 498 ms.
[2026-05-28 04:37:49] [INFO ] Added : 25 causal constraints over 6 iterations in 2846 ms. Result :sat
Minimization took 5257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1955/1955 places, 4452/4452 transitions.
Applied a total of 0 rules in 172 ms. Remains 1955 /1955 variables (removed 0) and now considering 4452/4452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 1955/1955 places, 4452/4452 transitions.
[2026-05-28 04:37:54] [INFO ] Flow matrix only has 4055 transitions (discarded 397 similar events)
[2026-05-28 04:37:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (22910 resets) in 17566 ms. (56 steps per ms)
BEST_FIRST walk for 2000001 steps (8596 resets) in 8184 ms. (244 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-28 04:38:20] [INFO ] Flow matrix only has 4055 transitions (discarded 397 similar events)
[2026-05-28 04:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:20] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2026-05-28 04:38:20] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 152 ms returned sat
[2026-05-28 04:38:22] [INFO ] [Real]Absence check using state equation in 1343 ms returned sat
[2026-05-28 04:38:22] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:38:22] [INFO ] [Real]Added 2450 Read/Feed constraints in 521 ms returned sat
[2026-05-28 04:38:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2026-05-28 04:38:23] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 108 ms returned sat
[2026-05-28 04:38:24] [INFO ] [Nat]Absence check using state equation in 1507 ms returned sat
[2026-05-28 04:38:26] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1158 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:28] [INFO ] Deduced a trap composed of 80 places in 2044 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:30] [INFO ] Deduced a trap composed of 80 places in 2130 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:33] [INFO ] Deduced a trap composed of 80 places in 1862 ms of which 194 ms to minimize.
[2026-05-28 04:38:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7613 ms
[2026-05-28 04:38:33] [INFO ] Computed and/alt/rep : 1646/4162/1646 causal constraints (skipped 2392 transitions) in 240 ms.
[2026-05-28 04:38:35] [INFO ] Added : 16 causal constraints over 4 iterations in 1768 ms. Result :sat
Minimization took 5321 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:41] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2026-05-28 04:38:41] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 93 ms returned sat
[2026-05-28 04:38:42] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2026-05-28 04:38:42] [INFO ] [Real]Added 2450 Read/Feed constraints in 365 ms returned sat
[2026-05-28 04:38:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2026-05-28 04:38:43] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 89 ms returned sat
[2026-05-28 04:38:45] [INFO ] [Nat]Absence check using state equation in 1622 ms returned sat
[2026-05-28 04:38:49] [INFO ] [Nat]Added 2450 Read/Feed constraints in 4621 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:51] [INFO ] Deduced a trap composed of 140 places in 1806 ms of which 286 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:53] [INFO ] Deduced a trap composed of 81 places in 1781 ms of which 206 ms to minimize.
[2026-05-28 04:38:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4091 ms
[2026-05-28 04:38:53] [INFO ] Computed and/alt/rep : 1646/4162/1646 causal constraints (skipped 2392 transitions) in 275 ms.
[2026-05-28 04:38:56] [INFO ] Added : 25 causal constraints over 6 iterations in 2789 ms. Result :sat
Minimization took 5305 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1955/1955 places, 4452/4452 transitions.
Applied a total of 0 rules in 207 ms. Remains 1955 /1955 variables (removed 0) and now considering 4452/4452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 1955/1955 places, 4452/4452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1955/1955 places, 4452/4452 transitions.
Applied a total of 0 rules in 178 ms. Remains 1955 /1955 variables (removed 0) and now considering 4452/4452 (removed 0) transitions.
[2026-05-28 04:39:02] [INFO ] Flow matrix only has 4055 transitions (discarded 397 similar events)
[2026-05-28 04:39:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:39:08] [INFO ] Implicit Places using invariants in 5858 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 149, 166, 172, 174, 175, 176, 177, 178, 179, 180, 181, 183, 187, 193, 201, 211, 223, 236, 248, 249, 250, 251, 252, 253, 254, 255, 265, 273, 279, 283, 285, 287, 304, 310, 312, 313, 314, 315, 316, 317, 318, 319, 321, 323, 327, 333, 341, 351, 362, 372, 373, 374, 375, 376, 377, 378, 379, 387, 393, 397, 399, 401, 403, 420, 426, 428, 429, 430, 431, 432, 433, 434, 435, 437, 439, 441, 445, 451, 459, 468, 476, 477, 478, 479, 480, 481, 482, 483, 489, 493, 495, 497, 499, 501, 518, 524, 526, 527, 528, 529, 530, 531, 533, 535, 537, 541, 543, 547, 553, 560, 566, 567, 568, 569, 570, 571, 572, 573, 577, 579, 581, 583, 585, 587, 604, 610, 612, 613, 614, 615, 616, 617, 618, 619, 621, 623, 625, 627, 629, 633, 638, 642, 643, 644, 645, 646, 647, 648, 649, 651, 653, 655, 657, 659, 661, 678, 684, 686, 687, 688, 689, 690, 691, 692, 693, 695, 697, 699, 701, 703, 705, 708, 710, 711, 712, 713, 714, 715, 716, 717, 719, 721, 723, 725, 727, 729, 746, 752, 754, 755, 756, 757, 758, 759, 760, 761, 763, 765, 767, 769, 771, 773, 775, 777, 778, 779, 780, 781, 782, 783, 784, 786, 788, 790, 792, 794, 796, 813, 815, 818, 820, 821, 822, 823, 824, 825, 826, 827, 829, 831, 833, 835, 837, 839, 841, 843, 844, 845, 846, 847, 848, 849, 850, 852, 854, 856, 858, 860, 862, 879, 885, 887, 888, 889, 890, 891, 892, 893, 894, 896, 898, 900, 902, 904, 906, 908, 910, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 929, 946, 952, 954, 955, 956, 957, 958, 959, 960, 961, 963, 965, 967, 969, 971, 973, 975, 978, 979, 980, 981, 982, 983, 984, 985, 987, 989, 991, 993, 995, 997, 1014, 1020, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1045, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1061, 1063, 1065, 1067, 1069, 1071, 1088, 1094, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1105, 1107, 1109, 1111, 1113, 1117, 1123, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1143, 1147, 1149, 1151, 1153, 1155, 1172, 1178, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1189, 1191, 1193, 1195, 1199, 1205, 1213, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1237, 1243, 1247, 1249, 1251, 1253, 1270, 1276, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1287, 1289, 1291, 1295, 1301, 1309, 1319, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1347, 1355, 1361, 1365, 1367, 1369, 1386, 1392, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1403, 1405, 1409, 1415, 1423, 1433, 1445, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1477, 1487, 1495, 1501, 1505, 1507, 1524, 1526, 1529, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1540, 1544, 1550, 1558, 1568, 1580, 1594, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1616, 1630, 1642, 1652, 1660, 1666, 1670, 1687]
[2026-05-28 04:39:08] [INFO ] Actually due to overlaps returned [166, 304, 420, 518, 604, 678, 746, 813, 879, 946, 1014, 1088, 1172, 1270, 1386, 1524, 1687, 4, 9, 10, 11, 12, 13, 14, 15, 99, 100, 101, 102, 103, 104, 105, 174, 175, 176, 177, 178, 179, 180, 248, 249, 250, 251, 252, 253, 254, 312, 313, 314, 315, 316, 317, 318, 372, 373, 374, 375, 376, 377, 378, 428, 429, 430, 431, 432, 433, 434, 476, 477, 478, 479, 480, 481, 482, 526, 527, 528, 529, 530, 531, 566, 567, 568, 569, 570, 571, 572, 612, 613, 614, 615, 616, 617, 618, 642, 643, 644, 645, 646, 647, 648, 686, 687, 688, 689, 690, 691, 692, 710, 711, 712, 713, 714, 715, 716, 754, 755, 756, 757, 758, 759, 760, 777, 778, 779, 780, 781, 782, 783, 815, 820, 821, 822, 823, 824, 825, 826, 843, 844, 845, 846, 847, 848, 849, 887, 888, 889, 890, 891, 892, 893, 910, 911, 912, 913, 914, 915, 916, 954, 955, 956, 957, 958, 959, 960, 978, 979, 980, 981, 982, 983, 984, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1526, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1609, 1610, 1611, 1612, 1613, 1614, 1615]
Discarding 257 places :
Implicit Place search using SMT only with invariants took 5886 ms to find 257 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1698/1955 places, 4452/4452 transitions.
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 223 place count 1475 transition count 4229
Iterating global reduction 0 with 223 rules applied. Total rules applied 446 place count 1475 transition count 4229
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 669 place count 1252 transition count 4006
Iterating global reduction 0 with 223 rules applied. Total rules applied 892 place count 1252 transition count 4006
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 895 place count 1252 transition count 4003
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 898 place count 1249 transition count 4003
Applied a total of 898 rules in 367 ms. Remains 1249 /1698 variables (removed 449) and now considering 4003/4452 (removed 449) transitions.
[2026-05-28 04:39:08] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
// Phase 1: matrix 3606 rows 1249 cols
[2026-05-28 04:39:08] [INFO ] Computed 320 invariants in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:39:12] [INFO ] Implicit Places using invariants in 3666 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 134, 155, 157, 159, 163, 169, 177, 187, 199, 212, 224, 234, 242, 248, 252, 254, 256, 264, 266, 268, 270, 274, 280, 288, 298, 309, 319, 327, 333, 337, 339, 341, 343, 351, 353, 355, 357, 359, 363, 369, 377, 386, 394, 400, 404, 406, 408, 410, 412, 420, 423, 425, 427, 431, 433, 437, 443, 450, 456, 460, 462, 464, 466, 468, 470, 479, 481, 483, 485, 487, 489, 491, 495, 500, 504, 506, 508, 510, 512, 514, 516, 524, 526, 528, 530, 532, 534, 536, 538, 541, 543, 545, 547, 549, 551, 553, 555, 563, 565, 567, 569, 571, 573, 575, 577, 579, 581, 583, 585, 587, 589, 591, 593, 599, 601, 603, 605, 607, 609, 611, 613, 615, 617, 619, 621, 623, 625, 627, 629, 636, 638, 640, 642, 644, 646, 648, 650, 652, 654, 656, 658, 660, 662, 664, 666, 674, 676, 678, 680, 682, 684, 686, 688, 690, 693, 695, 697, 699, 701, 703, 705, 713, 715, 717, 719, 721, 723, 725, 727, 731, 736, 740, 742, 744, 746, 748, 750, 758, 760, 762, 764, 766, 768, 770, 774, 780, 787, 793, 797, 799, 801, 803, 805, 813, 815, 817, 819, 821, 823, 827, 833, 841, 850, 858, 864, 868, 870, 872, 874, 882, 884, 886, 888, 890, 894, 900, 908, 918, 929, 939, 947, 953, 957, 959, 961, 969, 971, 973, 975, 979, 985, 993, 1003, 1015, 1028, 1040, 1050, 1058, 1064, 1068, 1070, 1076, 1078, 1080, 1084, 1090, 1098, 1108, 1120, 1134, 1149, 1163, 1175, 1185, 1193, 1199, 1203]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 3699 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/1955 places, 4003/4452 transitions.
Applied a total of 0 rules in 166 ms. Remains 977 /977 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 10300 ms. Remains : 977/1955 places, 4003/4452 transitions.
[2026-05-28 04:39:12] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
// Phase 1: matrix 3606 rows 977 cols
[2026-05-28 04:39:12] [INFO ] Computed 48 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (24140 resets) in 17087 ms. (58 steps per ms)
BEST_FIRST walk for 2000001 steps (6542 resets) in 6246 ms. (320 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-28 04:39:35] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:35] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2026-05-28 04:39:35] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2026-05-28 04:39:37] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2026-05-28 04:39:37] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:39:37] [INFO ] [Real]Added 2450 Read/Feed constraints in 315 ms returned sat
[2026-05-28 04:39:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-05-28 04:39:37] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 17 ms returned sat
[2026-05-28 04:39:38] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2026-05-28 04:39:39] [INFO ] [Nat]Added 2450 Read/Feed constraints in 739 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:40] [INFO ] Deduced a trap composed of 126 places in 704 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:41] [INFO ] Deduced a trap composed of 136 places in 627 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:42] [INFO ] Deduced a trap composed of 127 places in 618 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:43] [INFO ] Deduced a trap composed of 127 places in 837 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:44] [INFO ] Deduced a trap composed of 119 places in 780 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:45] [INFO ] Deduced a trap composed of 118 places in 692 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:39:46] [INFO ] Deduced a trap composed of 119 places in 585 ms of which 97 ms to minimize.
[2026-05-28 04:39:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7953 ms
[2026-05-28 04:39:47] [INFO ] Computed and/alt/rep : 1343/1949/1343 causal constraints (skipped 2201 transitions) in 304 ms.
[2026-05-28 04:39:48] [INFO ] Added : 14 causal constraints over 3 iterations in 1326 ms. Result :sat
Minimization took 6454 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:55] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2026-05-28 04:39:55] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 10 ms returned sat
[2026-05-28 04:39:56] [INFO ] [Real]Absence check using state equation in 1158 ms returned sat
[2026-05-28 04:39:56] [INFO ] [Real]Added 2450 Read/Feed constraints in 300 ms returned sat
[2026-05-28 04:39:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2026-05-28 04:39:57] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 6 ms returned sat
[2026-05-28 04:39:57] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2026-05-28 04:40:00] [INFO ] [Nat]Added 2450 Read/Feed constraints in 2223 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:00] [INFO ] Deduced a trap composed of 139 places in 637 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:01] [INFO ] Deduced a trap composed of 59 places in 698 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:02] [INFO ] Deduced a trap composed of 59 places in 607 ms of which 72 ms to minimize.
[2026-05-28 04:40:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2504 ms
[2026-05-28 04:40:02] [INFO ] Computed and/alt/rep : 1343/1949/1343 causal constraints (skipped 2201 transitions) in 243 ms.
[2026-05-28 04:40:04] [INFO ] Added : 20 causal constraints over 4 iterations in 1427 ms. Result :sat
Minimization took 6316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4003/4003 transitions.
Applied a total of 0 rules in 122 ms. Remains 977 /977 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 977/977 places, 4003/4003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4003/4003 transitions.
Applied a total of 0 rules in 114 ms. Remains 977 /977 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
[2026-05-28 04:40:10] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:40:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:40:12] [INFO ] Implicit Places using invariants in 1717 ms returned []
[2026-05-28 04:40:12] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:40:13] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:40:43] [INFO ] Performed 394/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:41:13] [INFO ] Performed 843/977 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:41:23] [INFO ] Implicit Places using invariants and state equation in 71482 ms returned []
Implicit Place search using SMT with State Equation took 73230 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:41:24] [INFO ] Redundant transitions in 284 ms returned []
Running 3941 sub problems to find dead transitions.
[2026-05-28 04:41:24] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:41:24] [INFO ] Invariant cache hit.
[2026-05-28 04:41:24] [INFO ] State equation strengthened by 2450 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/975 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3941 unsolved
SMT process timed out in 36376ms, After SMT, problems are : Problem set: 0 solved, 3941 unsolved
Search for dead transitions found 0 dead transitions in 36438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110107 ms. Remains : 977/977 places, 4003/4003 transitions.
RANDOM walk for 40000 steps (964 resets) in 1784 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (128 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (130 resets) in 509 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (131 resets) in 418 ms. (95 steps per ms) remains 4/4 properties
[2026-05-28 04:42:01] [INFO ] Flatten gal took : 446 ms
[2026-05-28 04:42:01] [INFO ] Flatten gal took : 219 ms
[2026-05-28 04:42:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality142772242377475256.gal : 97 ms
[2026-05-28 04:42:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15094570100708074050.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality142772242377475256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15094570100708074050.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality15094570100708074050.prop.
Interrupted probabilistic random walk after 60613 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 60613 steps, saw 25463 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
[2026-05-28 04:42:04] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:42:04] [INFO ] Invariant cache hit.
[2026-05-28 04:42:04] [INFO ] State equation strengthened by 2450 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :40 after 41
At refinement iteration 1 (OVERLAPS) 899/901 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :49 after 50
[2026-05-28 04:42:05] [INFO ] Deduced a trap composed of 81 places in 636 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :50 after 64
[2026-05-28 04:42:06] [INFO ] Deduced a trap composed of 151 places in 802 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:07] [INFO ] Deduced a trap composed of 97 places in 924 ms of which 111 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :64 after 92
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/935 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/935 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/963 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/963 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 14/977 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3606/4583 variables, 977/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4583 variables, 2450/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :92 after 172
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4583/4583 variables, and 3478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 977/977 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/901 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:10] [INFO ] Deduced a trap composed of 80 places in 705 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:11] [INFO ] Deduced a trap composed of 97 places in 828 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:12] [INFO ] Deduced a trap composed of 129 places in 1088 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:13] [INFO ] Deduced a trap composed of 151 places in 1215 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:14] [INFO ] Deduced a trap composed of 111 places in 769 ms of which 104 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/4583 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/31 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/977 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10071ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4003/4003 transitions.
Applied a total of 0 rules in 133 ms. Remains 977 /977 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 977/977 places, 4003/4003 transitions.
RANDOM walk for 40000 steps (964 resets) in 1185 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (130 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (128 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (129 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :172 after 489
Interrupted probabilistic random walk after 63516 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 4
Probabilistic random walk after 63516 steps, saw 26670 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2026-05-28 04:42:18] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:42:18] [INFO ] Invariant cache hit.
[2026-05-28 04:42:18] [INFO ] State equation strengthened by 2450 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/901 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:19] [INFO ] Deduced a trap composed of 81 places in 722 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:19] [INFO ] Deduced a trap composed of 151 places in 609 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:20] [INFO ] Deduced a trap composed of 97 places in 731 ms of which 91 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/935 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/935 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/963 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/963 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 14/977 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3606/4583 variables, 977/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4583 variables, 2450/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4583 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4583 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4583/4583 variables, and 3478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6093 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 977/977 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/901 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:25] [INFO ] Deduced a trap composed of 80 places in 606 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:26] [INFO ] Deduced a trap composed of 97 places in 590 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:26] [INFO ] Deduced a trap composed of 129 places in 646 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:27] [INFO ] Deduced a trap composed of 151 places in 625 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:28] [INFO ] Deduced a trap composed of 111 places in 642 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:28] [INFO ] Deduced a trap composed of 87 places in 578 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:29] [INFO ] Deduced a trap composed of 80 places in 605 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:29] [INFO ] Deduced a trap composed of 129 places in 604 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:30] [INFO ] Deduced a trap composed of 177 places in 655 ms of which 100 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 34/935 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:31] [INFO ] Deduced a trap composed of 27 places in 606 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:32] [INFO ] Deduced a trap composed of 50 places in 646 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:32] [INFO ] Deduced a trap composed of 51 places in 610 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:33] [INFO ] Deduced a trap composed of 51 places in 595 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:33] [INFO ] Deduced a trap composed of 51 places in 621 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:34] [INFO ] Deduced a trap composed of 50 places in 645 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:35] [INFO ] Deduced a trap composed of 50 places in 607 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:35] [INFO ] Deduced a trap composed of 50 places in 658 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:36] [INFO ] Deduced a trap composed of 50 places in 590 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:37] [INFO ] Deduced a trap composed of 50 places in 624 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:37] [INFO ] Deduced a trap composed of 50 places in 648 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:38] [INFO ] Deduced a trap composed of 50 places in 571 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:39] [INFO ] Deduced a trap composed of 50 places in 651 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:39] [INFO ] Deduced a trap composed of 50 places in 611 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:40] [INFO ] Deduced a trap composed of 51 places in 609 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:41] [INFO ] Deduced a trap composed of 51 places in 602 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:41] [INFO ] Deduced a trap composed of 51 places in 681 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:42] [INFO ] Deduced a trap composed of 51 places in 647 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:43] [INFO ] Deduced a trap composed of 51 places in 672 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :489 after 1335
[2026-05-28 04:42:43] [INFO ] Deduced a trap composed of 51 places in 629 ms of which 67 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:44] [INFO ] Deduced a trap composed of 51 places in 662 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:45] [INFO ] Deduced a trap composed of 51 places in 659 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:45] [INFO ] Deduced a trap composed of 51 places in 646 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:46] [INFO ] Deduced a trap composed of 98 places in 511 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:47] [INFO ] Deduced a trap composed of 51 places in 693 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:47] [INFO ] Deduced a trap composed of 51 places in 625 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:48] [INFO ] Deduced a trap composed of 110 places in 582 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:48] [INFO ] Deduced a trap composed of 110 places in 560 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:49] [INFO ] Deduced a trap composed of 111 places in 613 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:50] [INFO ] Deduced a trap composed of 123 places in 526 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:50] [INFO ] Deduced a trap composed of 124 places in 545 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:51] [INFO ] Deduced a trap composed of 51 places in 633 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-28 04:42:52] [INFO ] Deduced a trap composed of 51 places in 790 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:52] [INFO ] Flatten gal took : 161 ms
[2026-05-28 04:42:52] [INFO ] Applying decomposition
[2026-05-28 04:42:52] [INFO ] Flatten gal took : 157 ms
[2026-05-28 04:42:52] [INFO ] Deduced a trap composed of 51 places in 655 ms of which 71 ms to minimize.
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/graph18239189445222870428.txt' '-o' '/tmp/graph18239189445222870428.bin' '-w' '/tmp/graph18239189445222870428.weights'
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18239189445222870428.bin' '-l' '-1' '-v' '-w' '/tmp/graph18239189445222870428.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:42:52] [INFO ] Decomposing Gal with order
[2026-05-28 04:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:42:53] [INFO ] Deduced a trap composed of 51 places in 637 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:53] [INFO ] Removed a total of 7444 redundant transitions.
[2026-05-28 04:42:53] [INFO ] Flatten gal took : 777 ms
[2026-05-28 04:42:54] [INFO ] Deduced a trap composed of 51 places in 632 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2703 labels/synchronizations in 259 ms.
[2026-05-28 04:42:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13799458572364348114.gal : 44 ms
[2026-05-28 04:42:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5881965532195448151.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13799458572364348114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5881965532195448151.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2026-05-28 04:42:54] [INFO ] Deduced a trap composed of 51 places in 651 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality5881965532195448151.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 91
[2026-05-28 04:42:55] [INFO ] Deduced a trap composed of 51 places in 729 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :91 after 393
[2026-05-28 04:42:56] [INFO ] Deduced a trap composed of 50 places in 692 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:56] [INFO ] Deduced a trap composed of 51 places in 626 ms of which 68 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :393 after 865
[2026-05-28 04:42:57] [INFO ] Deduced a trap composed of 50 places in 688 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:58] [INFO ] Deduced a trap composed of 50 places in 627 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:58] [INFO ] Deduced a trap composed of 50 places in 675 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:42:59] [INFO ] Deduced a trap composed of 79 places in 481 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :865 after 1743
[2026-05-28 04:43:00] [INFO ] Deduced a trap composed of 51 places in 622 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:00] [INFO ] Deduced a trap composed of 51 places in 659 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:01] [INFO ] Deduced a trap composed of 51 places in 591 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:02] [INFO ] Deduced a trap composed of 52 places in 674 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:02] [INFO ] Deduced a trap composed of 95 places in 511 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:03] [INFO ] Deduced a trap composed of 52 places in 659 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:04] [INFO ] Deduced a trap composed of 52 places in 628 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:04] [INFO ] Deduced a trap composed of 52 places in 640 ms of which 69 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1743 after 2436
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:05] [INFO ] Deduced a trap composed of 52 places in 599 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:06] [INFO ] Deduced a trap composed of 52 places in 625 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:06] [INFO ] Deduced a trap composed of 52 places in 633 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:07] [INFO ] Deduced a trap composed of 52 places in 609 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:07] [INFO ] Deduced a trap composed of 52 places in 635 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:08] [INFO ] Deduced a trap composed of 52 places in 632 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:09] [INFO ] Deduced a trap composed of 52 places in 624 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:09] [INFO ] Deduced a trap composed of 109 places in 561 ms of which 90 ms to minimize.
SMT process timed out in 51438ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4003/4003 transitions.
Applied a total of 0 rules in 133 ms. Remains 977 /977 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 977/977 places, 4003/4003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4003/4003 transitions.
Applied a total of 0 rules in 103 ms. Remains 977 /977 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
[2026-05-28 04:43:10] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:43:11] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2026-05-28 04:43:11] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2436 after 3893
[2026-05-28 04:43:12] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:43:42] [INFO ] Performed 398/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2026-05-28 04:44:13] [INFO ] Performed 938/977 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:44:19] [INFO ] Implicit Places using invariants and state equation in 67502 ms returned []
Implicit Place search using SMT with State Equation took 69054 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:44:19] [INFO ] Redundant transitions in 286 ms returned []
Running 3941 sub problems to find dead transitions.
[2026-05-28 04:44:19] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:44:19] [INFO ] Invariant cache hit.
[2026-05-28 04:44:19] [INFO ] State equation strengthened by 2450 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/975 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3941 unsolved
SMT process timed out in 36720ms, After SMT, problems are : Problem set: 0 solved, 3941 unsolved
Search for dead transitions found 0 dead transitions in 36739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106232 ms. Remains : 977/977 places, 4003/4003 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:44:56] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:44:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (241 resets) in 190 ms. (52 steps per ms)
BEST_FIRST walk for 10001 steps (31 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:44:56] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:44:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:44:56] [INFO ] [Real]Absence check using 31 positive place invariants in 44 ms returned sat
[2026-05-28 04:44:56] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 8 ms returned sat
[2026-05-28 04:44:57] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2026-05-28 04:44:57] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:44:58] [INFO ] [Real]Added 2450 Read/Feed constraints in 368 ms returned sat
[2026-05-28 04:44:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:44:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2026-05-28 04:44:58] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-28 04:44:59] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2026-05-28 04:45:00] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:45:00] [INFO ] [Nat]Added 2450 Read/Feed constraints in 995 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:02] [INFO ] Deduced a trap composed of 126 places in 895 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:03] [INFO ] Deduced a trap composed of 127 places in 666 ms of which 76 ms to minimize.
[2026-05-28 04:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2273 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 977 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node4HasTheLeafSetOfLx6ToReplaceNode3) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4002/4002 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 976 transition count 4001
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 976 transition count 4000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 975 transition count 4000
Applied a total of 3 rules in 255 ms. Remains 975 /977 variables (removed 2) and now considering 4000/4002 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 975/977 places, 4000/4002 transitions.
[2026-05-28 04:45:03] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
// Phase 1: matrix 3602 rows 975 cols
[2026-05-28 04:45:03] [INFO ] Computed 48 invariants in 69 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24138 resets) in 17028 ms. (58 steps per ms)
BEST_FIRST walk for 1000001 steps (3261 resets) in 3150 ms. (317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:45:23] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:45:24] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2026-05-28 04:45:24] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-28 04:45:25] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2026-05-28 04:45:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:45:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2026-05-28 04:45:25] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-28 04:45:26] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2026-05-28 04:45:26] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:45:27] [INFO ] [Nat]Added 2450 Read/Feed constraints in 789 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:27] [INFO ] Deduced a trap composed of 126 places in 725 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:29] [INFO ] Deduced a trap composed of 136 places in 836 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:30] [INFO ] Deduced a trap composed of 127 places in 701 ms of which 78 ms to minimize.
[2026-05-28 04:45:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4230 ms
[2026-05-28 04:45:31] [INFO ] Computed and/alt/rep : 1339/1943/1339 causal constraints (skipped 2201 transitions) in 232 ms.
[2026-05-28 04:45:32] [INFO ] Added : 14 causal constraints over 3 iterations in 1216 ms. Result :sat
Minimization took 6355 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 160 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 975/975 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 110 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2026-05-28 04:45:39] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:45:41] [INFO ] Implicit Places using invariants in 1927 ms returned []
[2026-05-28 04:45:41] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:45:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:45:42] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:46:12] [INFO ] Performed 426/975 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:46:42] [INFO ] Performed 859/975 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:46:51] [INFO ] Implicit Places using invariants and state equation in 70516 ms returned []
Implicit Place search using SMT with State Equation took 72450 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:46:51] [INFO ] Redundant transitions in 193 ms returned []
Running 3938 sub problems to find dead transitions.
[2026-05-28 04:46:51] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:46:51] [INFO ] Invariant cache hit.
[2026-05-28 04:46:51] [INFO ] State equation strengthened by 2450 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3938 unsolved
SMT process timed out in 35596ms, After SMT, problems are : Problem set: 0 solved, 3938 unsolved
Search for dead transitions found 0 dead transitions in 35605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108383 ms. Remains : 975/975 places, 4000/4000 transitions.
[2026-05-28 04:47:27] [INFO ] Flatten gal took : 251 ms
RANDOM walk for 40000 steps (964 resets) in 1133 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (128 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
[2026-05-28 04:47:27] [INFO ] Flatten gal took : 177 ms
[2026-05-28 04:47:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8527500092817905435.gal : 20 ms
[2026-05-28 04:47:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14924861680224467645.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8527500092817905435.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14924861680224467645.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (128 resets) in 263 ms. (151 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14924861680224467645.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
Interrupted probabilistic random walk after 66207 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66207 steps, saw 27781 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-28 04:47:30] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:47:30] [INFO ] Invariant cache hit.
[2026-05-28 04:47:30] [INFO ] State equation strengthened by 2450 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/961 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/975 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
At refinement iteration 11 (OVERLAPS) 3602/4577 variables, 975/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4577 variables, 2450/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4577/4577 variables, and 3473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2148 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 975/975 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:33] [INFO ] Deduced a trap composed of 5 places in 507 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
[2026-05-28 04:47:34] [INFO ] Deduced a trap composed of 91 places in 606 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:35] [INFO ] Deduced a trap composed of 92 places in 522 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:35] [INFO ] Deduced a trap composed of 92 places in 570 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:36] [INFO ] Deduced a trap composed of 92 places in 601 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:36] [INFO ] Deduced a trap composed of 92 places in 560 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
[2026-05-28 04:47:37] [INFO ] Deduced a trap composed of 92 places in 645 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:38] [INFO ] Deduced a trap composed of 92 places in 593 ms of which 82 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/4577 variables, and 14 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/31 constraints, Generalized P Invariants (flows): 3/17 constraints, State Equation: 0/975 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7196ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 121 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 975/975 places, 4000/4000 transitions.
RANDOM walk for 40000 steps (964 resets) in 1024 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (130 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (127 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66614 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66614 steps, saw 27944 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-28 04:47:41] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:47:41] [INFO ] Invariant cache hit.
[2026-05-28 04:47:41] [INFO ] State equation strengthened by 2450 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/961 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/975 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3602/4577 variables, 975/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4577 variables, 2450/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4577/4577 variables, and 3473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2353 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 975/975 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:44] [INFO ] Deduced a trap composed of 5 places in 498 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2026-05-28 04:47:45] [INFO ] Deduced a trap composed of 91 places in 594 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:46] [INFO ] Deduced a trap composed of 92 places in 558 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:46] [INFO ] Deduced a trap composed of 92 places in 599 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:47] [INFO ] Deduced a trap composed of 92 places in 580 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:47] [INFO ] Deduced a trap composed of 92 places in 555 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:48] [INFO ] Deduced a trap composed of 92 places in 553 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:49] [INFO ] Deduced a trap composed of 92 places in 557 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:49] [INFO ] Deduced a trap composed of 92 places in 545 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:50] [INFO ] Deduced a trap composed of 92 places in 571 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:50] [INFO ] Deduced a trap composed of 92 places in 606 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:51] [INFO ] Deduced a trap composed of 92 places in 597 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:52] [INFO ] Deduced a trap composed of 92 places in 581 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:52] [INFO ] Deduced a trap composed of 104 places in 720 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:53] [INFO ] Deduced a trap composed of 104 places in 585 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:54] [INFO ] Deduced a trap composed of 104 places in 645 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:54] [INFO ] Deduced a trap composed of 104 places in 681 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:55] [INFO ] Deduced a trap composed of 104 places in 577 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:56] [INFO ] Deduced a trap composed of 104 places in 634 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:56] [INFO ] Deduced a trap composed of 112 places in 527 ms of which 87 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:57] [INFO ] Deduced a trap composed of 104 places in 515 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:57] [INFO ] Deduced a trap composed of 104 places in 594 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:58] [INFO ] Deduced a trap composed of 104 places in 569 ms of which 89 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/961 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:47:59] [INFO ] Deduced a trap composed of 97 places in 695 ms of which 90 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/961 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/961 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/975 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/975 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3602/4577 variables, 975/1047 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4577 variables, 2450/3497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4577 variables, 2/3499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:48:02] [INFO ] Deduced a trap composed of 136 places in 579 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:48:04] [INFO ] Deduced a trap composed of 127 places in 544 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:48:05] [INFO ] Deduced a trap composed of 126 places in 737 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:48:07] [INFO ] Deduced a trap composed of 127 places in 635 ms of which 76 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
At refinement iteration 17 (INCLUDED_ONLY) 0/4577 variables, 4/3503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4577 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/4577 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4577/4577 variables, and 3503 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26833 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 975/975 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29215ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 105 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 975/975 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 103 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2026-05-28 04:48:11] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:48:12] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2026-05-28 04:48:12] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:48:13] [INFO ] State equation strengthened by 2450 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-28 04:48:18] [INFO ] Flatten gal took : 127 ms
[2026-05-28 04:48:18] [INFO ] Applying decomposition
[2026-05-28 04:48:18] [INFO ] Flatten gal took : 131 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/graph5749108356699358761.txt' '-o' '/tmp/graph5749108356699358761.bin' '-w' '/tmp/graph5749108356699358761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5749108356699358761.bin' '-l' '-1' '-v' '-w' '/tmp/graph5749108356699358761.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:48:18] [INFO ] Decomposing Gal with order
[2026-05-28 04:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:48:19] [INFO ] Removed a total of 7286 redundant transitions.
[2026-05-28 04:48:19] [INFO ] Flatten gal took : 703 ms
[2026-05-28 04:48:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2339 labels/synchronizations in 137 ms.
[2026-05-28 04:48:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9531256392640197470.gal : 32 ms
[2026-05-28 04:48:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4905554781932615379.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9531256392640197470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4905554781932615379.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4905554781932615379.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 472
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :472 after 1156
[2026-05-28 04:48:44] [INFO ] Performed 396/975 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2026-05-28 04:49:14] [INFO ] Performed 747/975 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:49:29] [INFO ] Implicit Places using invariants and state equation in 76359 ms returned []
Implicit Place search using SMT with State Equation took 77907 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:49:29] [INFO ] Redundant transitions in 218 ms returned []
Running 3938 sub problems to find dead transitions.
[2026-05-28 04:49:29] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2026-05-28 04:49:29] [INFO ] Invariant cache hit.
[2026-05-28 04:49:29] [INFO ] State equation strengthened by 2450 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3938 unsolved
SMT process timed out in 35922ms, After SMT, problems are : Problem set: 0 solved, 3938 unsolved
Search for dead transitions found 0 dead transitions in 35933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114192 ms. Remains : 975/975 places, 4000/4000 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04 in 309053 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:50:05] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
// Phase 1: matrix 3606 rows 977 cols
[2026-05-28 04:50:05] [INFO ] Computed 48 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (241 resets) in 162 ms. (61 steps per ms)
BEST_FIRST walk for 10001 steps (33 resets) in 47 ms. (208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:50:05] [INFO ] Flow matrix only has 3606 transitions (discarded 397 similar events)
[2026-05-28 04:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:50:05] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2026-05-28 04:50:05] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2026-05-28 04:50:06] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2026-05-28 04:50:06] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2026-05-28 04:50:06] [INFO ] [Real]Added 2450 Read/Feed constraints in 257 ms returned sat
[2026-05-28 04:50:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:50:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2026-05-28 04:50:07] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 10 ms returned sat
[2026-05-28 04:50:07] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2026-05-28 04:50:08] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:50:09] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1159 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 977 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node0ThinksNode1ShouldBeNodeMasterToReplaceNode15) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4001/4001 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 977 transition count 4000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 976 transition count 4000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 976 transition count 3999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 975 transition count 3999
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 974 transition count 3998
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 974 transition count 3998
Applied a total of 6 rules in 322 ms. Remains 974 /977 variables (removed 3) and now considering 3998/4001 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 974/977 places, 3998/4001 transitions.
[2026-05-28 04:50:09] [INFO ] Flow matrix only has 3601 transitions (discarded 397 similar events)
// Phase 1: matrix 3601 rows 974 cols
[2026-05-28 04:50:09] [INFO ] Computed 48 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24139 resets) in 16604 ms. (60 steps per ms)
BEST_FIRST walk for 1000000 steps (3268 resets) in 3059 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:50:29] [INFO ] Flow matrix only has 3601 transitions (discarded 397 similar events)
[2026-05-28 04:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:50:29] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2026-05-28 04:50:29] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-28 04:50:30] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2026-05-28 04:50:30] [INFO ] State equation strengthened by 2449 read => feed constraints.
[2026-05-28 04:50:30] [INFO ] [Real]Added 2449 Read/Feed constraints in 252 ms returned sat
[2026-05-28 04:50:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:50:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2026-05-28 04:50:30] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2026-05-28 04:50:31] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2026-05-28 04:50:33] [INFO ] [Nat]Added 2449 Read/Feed constraints in 2145 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:50:34] [INFO ] Deduced a trap composed of 139 places in 675 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:50:35] [INFO ] Deduced a trap composed of 49 places in 811 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:50:36] [INFO ] Deduced a trap composed of 58 places in 941 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:50:37] [INFO ] Deduced a trap composed of 59 places in 793 ms of which 74 ms to minimize.
[2026-05-28 04:50:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3936 ms
[2026-05-28 04:50:38] [INFO ] Computed and/alt/rep : 1337/1932/1337 causal constraints (skipped 2202 transitions) in 249 ms.
[2026-05-28 04:50:39] [INFO ] Added : 25 causal constraints over 6 iterations in 2097 ms. Result :sat
Minimization took 5262 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 974 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 974/974 places, 3998/3998 transitions.
Applied a total of 0 rules in 112 ms. Remains 974 /974 variables (removed 0) and now considering 3998/3998 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 974/974 places, 3998/3998 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 974/974 places, 3998/3998 transitions.
Applied a total of 0 rules in 106 ms. Remains 974 /974 variables (removed 0) and now considering 3998/3998 (removed 0) transitions.
[2026-05-28 04:50:45] [INFO ] Flow matrix only has 3601 transitions (discarded 397 similar events)
[2026-05-28 04:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:50:47] [INFO ] Implicit Places using invariants in 1600 ms returned [357]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1612 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 973/974 places, 3998/3998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 972 transition count 3997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 972 transition count 3997
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 971 transition count 3996
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 971 transition count 3996
Applied a total of 4 rules in 241 ms. Remains 971 /973 variables (removed 2) and now considering 3996/3998 (removed 2) transitions.
[2026-05-28 04:50:47] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
// Phase 1: matrix 3599 rows 971 cols
[2026-05-28 04:50:47] [INFO ] Computed 47 invariants in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:50:48] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2026-05-28 04:50:48] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:50:50] [INFO ] State equation strengthened by 2449 read => feed constraints.
[2026-05-28 04:51:20] [INFO ] Performed 357/971 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:51:50] [INFO ] Performed 649/971 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:52:08] [INFO ] Implicit Places using invariants and state equation in 79326 ms returned []
Implicit Place search using SMT with State Equation took 80957 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 971/974 places, 3996/3998 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82917 ms. Remains : 971/974 places, 3996/3998 transitions.
[2026-05-28 04:52:08] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:52:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24140 resets) in 16280 ms. (61 steps per ms)
BEST_FIRST walk for 1000001 steps (3276 resets) in 3181 ms. (314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:52:27] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:52:27] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2026-05-28 04:52:27] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 33 ms returned sat
[2026-05-28 04:52:28] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2026-05-28 04:52:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:52:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2026-05-28 04:52:29] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 18 ms returned sat
[2026-05-28 04:52:30] [INFO ] [Nat]Absence check using state equation in 1189 ms returned sat
[2026-05-28 04:52:30] [INFO ] State equation strengthened by 2449 read => feed constraints.
[2026-05-28 04:52:32] [INFO ] [Nat]Added 2449 Read/Feed constraints in 2167 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:52:33] [INFO ] Deduced a trap composed of 139 places in 603 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:52:34] [INFO ] Deduced a trap composed of 49 places in 766 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:52:34] [INFO ] Deduced a trap composed of 58 places in 767 ms of which 71 ms to minimize.
[2026-05-28 04:52:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2683 ms
[2026-05-28 04:52:35] [INFO ] Computed and/alt/rep : 1336/1924/1336 causal constraints (skipped 2201 transitions) in 285 ms.
[2026-05-28 04:52:36] [INFO ] Added : 20 causal constraints over 4 iterations in 1461 ms. Result :sat
Minimization took 7727 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3996/3996 transitions.
Applied a total of 0 rules in 107 ms. Remains 971 /971 variables (removed 0) and now considering 3996/3996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 971/971 places, 3996/3996 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3996/3996 transitions.
Applied a total of 0 rules in 103 ms. Remains 971 /971 variables (removed 0) and now considering 3996/3996 (removed 0) transitions.
[2026-05-28 04:52:44] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:52:46] [INFO ] Implicit Places using invariants in 1502 ms returned []
[2026-05-28 04:52:46] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:52:47] [INFO ] State equation strengthened by 2449 read => feed constraints.
[2026-05-28 04:53:17] [INFO ] Performed 361/971 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:53:47] [INFO ] Performed 667/971 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:54:02] [INFO ] Implicit Places using invariants and state equation in 76763 ms returned []
Implicit Place search using SMT with State Equation took 78304 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:54:03] [INFO ] Redundant transitions in 173 ms returned []
Running 3934 sub problems to find dead transitions.
[2026-05-28 04:54:03] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:54:03] [INFO ] Invariant cache hit.
[2026-05-28 04:54:03] [INFO ] State equation strengthened by 2449 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/968 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3934 unsolved
SMT process timed out in 35283ms, After SMT, problems are : Problem set: 0 solved, 3934 unsolved
Search for dead transitions found 0 dead transitions in 35290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113884 ms. Remains : 971/971 places, 3996/3996 transitions.
[2026-05-28 04:54:38] [INFO ] Flatten gal took : 128 ms
[2026-05-28 04:54:38] [INFO ] Flatten gal took : 225 ms
[2026-05-28 04:54:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15042233209627479843.gal : 40 ms
[2026-05-28 04:54:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1299732772197138285.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15042233209627479843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1299732772197138285.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (964 resets) in 1594 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (126 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1299732772197138285.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
Interrupted probabilistic random walk after 53289 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 53289 steps, saw 22429 distinct states, run finished after 3014 ms. (steps per millisecond=17 ) properties seen :0
[2026-05-28 04:54:41] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:54:41] [INFO ] Invariant cache hit.
[2026-05-28 04:54:42] [INFO ] State equation strengthened by 2449 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
At refinement iteration 1 (OVERLAPS) 878/879 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
[2026-05-28 04:54:43] [INFO ] Deduced a trap composed of 76 places in 808 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:44] [INFO ] Deduced a trap composed of 147 places in 779 ms of which 126 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 32/929 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/957 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/957 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/971 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3599/4570 variables, 971/1020 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4570 variables, 2449/3469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4570 variables, 0/3469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4570 variables, 0/3469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
After SMT solving in domain Real declared 4570/4570 variables, and 3469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4397 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 971/971 constraints, ReadFeed: 2449/2449 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 878/879 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:47] [INFO ] Deduced a trap composed of 173 places in 854 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:48] [INFO ] Deduced a trap composed of 125 places in 1004 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:49] [INFO ] Deduced a trap composed of 77 places in 730 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:50] [INFO ] Deduced a trap composed of 76 places in 691 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:50] [INFO ] Deduced a trap composed of 83 places in 742 ms of which 67 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 32/929 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:51] [INFO ] Deduced a trap composed of 5 places in 894 ms of which 29 ms to minimize.
SMT process timed out in 9947ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3996/3996 transitions.
Applied a total of 0 rules in 134 ms. Remains 971 /971 variables (removed 0) and now considering 3996/3996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 971/971 places, 3996/3996 transitions.
RANDOM walk for 40000 steps (964 resets) in 985 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
Interrupted probabilistic random walk after 63577 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63577 steps, saw 26694 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2026-05-28 04:54:55] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:54:55] [INFO ] Invariant cache hit.
[2026-05-28 04:54:55] [INFO ] State equation strengthened by 2449 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 878/879 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:57] [INFO ] Deduced a trap composed of 76 places in 1655 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:58] [INFO ] Deduced a trap composed of 147 places in 794 ms of which 128 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 32/929 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/957 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/957 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/971 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3599/4570 variables, 971/1020 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4570 variables, 2449/3469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4570 variables, 0/3469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4570 variables, 0/3469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4570/4570 variables, and 3469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4700 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 971/971 constraints, ReadFeed: 2449/2449 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 878/879 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:01] [INFO ] Deduced a trap composed of 173 places in 1255 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:02] [INFO ] Deduced a trap composed of 125 places in 741 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:03] [INFO ] Deduced a trap composed of 77 places in 1174 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:04] [INFO ] Deduced a trap composed of 76 places in 808 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:05] [INFO ] Deduced a trap composed of 83 places in 642 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 32/929 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:06] [INFO ] Deduced a trap composed of 5 places in 810 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:07] [INFO ] Deduced a trap composed of 27 places in 856 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:08] [INFO ] Deduced a trap composed of 27 places in 1050 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:09] [INFO ] Deduced a trap composed of 50 places in 861 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:09] [INFO ] Deduced a trap composed of 51 places in 804 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:11] [INFO ] Deduced a trap composed of 51 places in 1168 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:11] [INFO ] Deduced a trap composed of 51 places in 811 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:12] [INFO ] Deduced a trap composed of 51 places in 932 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:14] [INFO ] Deduced a trap composed of 51 places in 1133 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:14] [INFO ] Deduced a trap composed of 51 places in 797 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:15] [INFO ] Deduced a trap composed of 57 places in 773 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2026-05-28 04:55:16] [INFO ] Deduced a trap composed of 46 places in 818 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:17] [INFO ] Deduced a trap composed of 55 places in 795 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:18] [INFO ] Deduced a trap composed of 46 places in 810 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:18] [INFO ] Deduced a trap composed of 62 places in 762 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:19] [INFO ] Deduced a trap composed of 63 places in 763 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:19] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:20] [INFO ] Deduced a trap composed of 56 places in 772 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:21] [INFO ] Deduced a trap composed of 55 places in 751 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:22] [INFO ] Deduced a trap composed of 63 places in 826 ms of which 107 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:23] [INFO ] Deduced a trap composed of 57 places in 761 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:23] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:24] [INFO ] Deduced a trap composed of 50 places in 667 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:24] [INFO ] Deduced a trap composed of 46 places in 765 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:25] [INFO ] Deduced a trap composed of 50 places in 683 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:26] [INFO ] Deduced a trap composed of 50 places in 836 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:27] [INFO ] Deduced a trap composed of 50 places in 796 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:28] [INFO ] Deduced a trap composed of 50 places in 913 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-28 04:55:29] [INFO ] Flatten gal took : 147 ms
[2026-05-28 04:55:29] [INFO ] Applying decomposition
[2026-05-28 04:55:29] [INFO ] Flatten gal took : 115 ms
[2026-05-28 04:55:29] [INFO ] Deduced a trap composed of 58 places in 838 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 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/graph9103786762869443358.txt' '-o' '/tmp/graph9103786762869443358.bin' '-w' '/tmp/graph9103786762869443358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9103786762869443358.bin' '-l' '-1' '-v' '-w' '/tmp/graph9103786762869443358.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:55:29] [INFO ] Decomposing Gal with order
[2026-05-28 04:55:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:55:29] [INFO ] Deduced a trap composed of 56 places in 684 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:29] [INFO ] Removed a total of 7462 redundant transitions.
[2026-05-28 04:55:30] [INFO ] Flatten gal took : 492 ms
[2026-05-28 04:55:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2444 labels/synchronizations in 158 ms.
[2026-05-28 04:55:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17401707715357782500.gal : 29 ms
[2026-05-28 04:55:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15271323966505532109.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17401707715357782500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15271323966505532109.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2026-05-28 04:55:30] [INFO ] Deduced a trap composed of 56 places in 593 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality15271323966505532109.prop.
[2026-05-28 04:55:31] [INFO ] Deduced a trap composed of 61 places in 642 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:31] [INFO ] Deduced a trap composed of 57 places in 631 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:32] [INFO ] Deduced a trap composed of 59 places in 613 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 153
[2026-05-28 04:55:33] [INFO ] Deduced a trap composed of 51 places in 635 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:33] [INFO ] Deduced a trap composed of 51 places in 651 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:34] [INFO ] Deduced a trap composed of 51 places in 605 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:35] [INFO ] Deduced a trap composed of 51 places in 727 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:35] [INFO ] Deduced a trap composed of 51 places in 624 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:36] [INFO ] Deduced a trap composed of 51 places in 624 ms of which 68 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:37] [INFO ] Deduced a trap composed of 51 places in 600 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:37] [INFO ] Deduced a trap composed of 51 places in 670 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:38] [INFO ] Deduced a trap composed of 51 places in 665 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:39] [INFO ] Deduced a trap composed of 51 places in 693 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:39] [INFO ] Deduced a trap composed of 51 places in 608 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:40] [INFO ] Deduced a trap composed of 56 places in 607 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:41] [INFO ] Deduced a trap composed of 57 places in 682 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:41] [INFO ] Deduced a trap composed of 57 places in 544 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:42] [INFO ] Deduced a trap composed of 58 places in 644 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:43] [INFO ] Deduced a trap composed of 57 places in 606 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:43] [INFO ] Deduced a trap composed of 75 places in 571 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :153 after 1108
[2026-05-28 04:55:44] [INFO ] Deduced a trap composed of 57 places in 751 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:55:45] [INFO ] Deduced a trap composed of 58 places in 750 ms of which 35 ms to minimize.
SMT process timed out in 49778ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3996/3996 transitions.
Applied a total of 0 rules in 137 ms. Remains 971 /971 variables (removed 0) and now considering 3996/3996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 971/971 places, 3996/3996 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3996/3996 transitions.
Applied a total of 0 rules in 129 ms. Remains 971 /971 variables (removed 0) and now considering 3996/3996 (removed 0) transitions.
[2026-05-28 04:55:45] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:55:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:55:47] [INFO ] Implicit Places using invariants in 1555 ms returned []
[2026-05-28 04:55:47] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:55:48] [INFO ] State equation strengthened by 2449 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1108 after 3710
[2026-05-28 04:56:18] [INFO ] Performed 364/971 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2026-05-28 04:56:48] [INFO ] Performed 641/971 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:57:07] [INFO ] Implicit Places using invariants and state equation in 80103 ms returned []
Implicit Place search using SMT with State Equation took 81681 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:57:07] [INFO ] Redundant transitions in 172 ms returned []
Running 3934 sub problems to find dead transitions.
[2026-05-28 04:57:07] [INFO ] Flow matrix only has 3599 transitions (discarded 397 similar events)
[2026-05-28 04:57:07] [INFO ] Invariant cache hit.
[2026-05-28 04:57:07] [INFO ] State equation strengthened by 2449 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/968 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3934 unsolved
SMT process timed out in 36357ms, After SMT, problems are : Problem set: 0 solved, 3934 unsolved
Search for dead transitions found 0 dead transitions in 36367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118379 ms. Remains : 971/971 places, 3996/3996 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09 in 458477 ms.
[2026-05-28 04:57:43] [INFO ] Flatten gal took : 121 ms
[2026-05-28 04:57:44] [INFO ] Applying decomposition
[2026-05-28 04:57:44] [INFO ] Flatten gal took : 132 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/graph1628175189170664565.txt' '-o' '/tmp/graph1628175189170664565.bin' '-w' '/tmp/graph1628175189170664565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1628175189170664565.bin' '-l' '-1' '-v' '-w' '/tmp/graph1628175189170664565.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:57:44] [INFO ] Decomposing Gal with order
[2026-05-28 04:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:57:44] [INFO ] Removed a total of 7474 redundant transitions.
[2026-05-28 04:57:45] [INFO ] Flatten gal took : 476 ms
[2026-05-28 04:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2436 labels/synchronizations in 155 ms.
[2026-05-28 04:57:45] [INFO ] Time to serialize gal into /tmp/UpperBounds2735604835655782003.gal : 22 ms
[2026-05-28 04:57:45] [INFO ] Time to serialize properties into /tmp/UpperBounds11074656467346661493.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2735604835655782003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11074656467346661493.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11074656467346661493.prop.
ITS-tools command line returned an error code 137
[2026-05-28 05:09:23] [INFO ] Flatten gal took : 770 ms
[2026-05-28 05:09:23] [INFO ] Time to serialize gal into /tmp/UpperBounds4998852601891119916.gal : 59 ms
[2026-05-28 05:09:23] [INFO ] Time to serialize properties into /tmp/UpperBounds6805727942977794962.prop : 7 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4998852601891119916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6805727942977794962.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds6805727942977794962.prop.
ITS-tools command line returned an error code 137
[2026-05-28 05:23:44] [INFO ] Flatten gal took : 973 ms
[2026-05-28 05:23:49] [INFO ] Input system was already deterministic with 4003 transitions.
[2026-05-28 05:23:50] [INFO ] Transformed 977 places.
[2026-05-28 05:23:50] [INFO ] Transformed 4003 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-28 05:23:51] [INFO ] Time to serialize gal into /tmp/UpperBounds8951618050152371632.gal : 50 ms
[2026-05-28 05:23:51] [INFO ] Time to serialize properties into /tmp/UpperBounds5164535025175863522.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8951618050152371632.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5164535025175863522.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5164535025175863522.prop.

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r191-oct2-177969025600054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;