Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r223-smll-177969946300026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946300026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Mar 5 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Mar 16 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 5 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Mar 5 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Mar 5 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779796574263

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 11:56:16] [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-26 11:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:56:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 11:56:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 11:56:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1046 ms
[2026-05-26 11:56:18] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2026-05-26 11:56:18] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 25 ms.
[2026-05-26 11:56:18] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2026-05-26 11:56:18] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 10] Max Struct:[10, +inf, 10, 10, 10, 10]
FORMULA PhilosophersDyn-COL-10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 11:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-26 11:56:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-26 11:56:18] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2026-05-26 11:56:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2026-05-26 11:56:18] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-26 11:56:18] [INFO ] Added : 4 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-26 11:56:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2026-05-26 11:56:18] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 11:56:18] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-26 11:56:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-26 11:56:18] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 11:56:18] [INFO ] Added : 4 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:56:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-26 11:56:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:56:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-26 11:56:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-26 11:56:19] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 11:56:19] [INFO ] Added : 4 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:56:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-26 11:56:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-26 11:56:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-26 11:56:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-26 11:56:19] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 11:56:19] [INFO ] Added : 4 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, +inf, 10, 10, 10]
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2026-05-26 11:56:19] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 127 ms.
[2026-05-26 11:56:19] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, +inf, 10, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, +inf, 10, 10, 10]
[2026-05-26 11:56:19] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2026-05-26 11:56:19] [INFO ] Computed 39 invariants in 102 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, +inf, 10, 10, 10]
RANDOM walk for 10000 steps (1195 resets) in 293 ms. (34 steps per ms)
BEST_FIRST walk for 50005 steps (440 resets) in 151 ms. (328 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
[2026-05-26 11:56:19] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2026-05-26 11:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:20] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2026-05-26 11:56:20] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-26 11:56:20] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2026-05-26 11:56:21] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2026-05-26 11:56:21] [INFO ] [Real]Added 1030 Read/Feed constraints in 595 ms returned sat
[2026-05-26 11:56:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2026-05-26 11:56:21] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2026-05-26 11:56:22] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2026-05-26 11:56:22] [INFO ] [Nat]Added 1030 Read/Feed constraints in 603 ms returned sat
[2026-05-26 11:56:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 661 ms.
[2026-05-26 11:56:24] [INFO ] Added : 0 causal constraints over 0 iterations in 1553 ms. Result :sat
Minimization took 586 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:25] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2026-05-26 11:56:25] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2026-05-26 11:56:26] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2026-05-26 11:56:26] [INFO ] [Real]Added 1030 Read/Feed constraints in 621 ms returned sat
[2026-05-26 11:56:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-26 11:56:26] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-26 11:56:27] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2026-05-26 11:56:27] [INFO ] [Nat]Added 1030 Read/Feed constraints in 479 ms returned sat
[2026-05-26 11:56:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 306 ms.
[2026-05-26 11:56:29] [INFO ] Added : 0 causal constraints over 0 iterations in 1155 ms. Result :sat
Minimization took 582 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:29] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-26 11:56:29] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-26 11:56:30] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2026-05-26 11:56:30] [INFO ] [Real]Added 1030 Read/Feed constraints in 407 ms returned sat
[2026-05-26 11:56:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2026-05-26 11:56:30] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-26 11:56:31] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2026-05-26 11:56:31] [INFO ] [Nat]Added 1030 Read/Feed constraints in 453 ms returned sat
[2026-05-26 11:56:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 260 ms.
[2026-05-26 11:56:32] [INFO ] Added : 0 causal constraints over 0 iterations in 796 ms. Result :sat
Minimization took 616 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:33] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-26 11:56:33] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-26 11:56:33] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2026-05-26 11:56:34] [INFO ] [Real]Added 1030 Read/Feed constraints in 739 ms returned sat
[2026-05-26 11:56:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-26 11:56:34] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-26 11:56:35] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2026-05-26 11:56:35] [INFO ] [Nat]Added 1030 Read/Feed constraints in 476 ms returned sat
[2026-05-26 11:56:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 400 ms.
[2026-05-26 11:56:37] [INFO ] Added : 0 causal constraints over 0 iterations in 1208 ms. Result :sat
Minimization took 590 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:37] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2026-05-26 11:56:37] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 9 ms returned sat
[2026-05-26 11:56:38] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2026-05-26 11:56:38] [INFO ] [Real]Added 1030 Read/Feed constraints in 344 ms returned sat
[2026-05-26 11:56:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 11:56:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-26 11:56:38] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2026-05-26 11:56:39] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2026-05-26 11:56:39] [INFO ] [Nat]Added 1030 Read/Feed constraints in 582 ms returned sat
[2026-05-26 11:56:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 294 ms.
[2026-05-26 11:56:40] [INFO ] Added : 0 causal constraints over 0 iterations in 499 ms. Result :sat
Minimization took 584 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 268 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2026-05-26 11:56:41] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2026-05-26 11:56:41] [INFO ] Invariant cache hit.
[2026-05-26 11:56:41] [INFO ] State equation strengthened by 1030 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20127 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 2040/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 380 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 720/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46504ms problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 46556ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 112 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46998 ms. Remains : 170/170 places, 1885/2265 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 1885 rows 170 cols
[2026-05-26 11:57:29] [INFO ] Computed 39 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
RANDOM walk for 1000000 steps (119434 resets) in 10418 ms. (95 steps per ms)
BEST_FIRST walk for 5000004 steps (44497 resets) in 8186 ms. (610 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
[2026-05-26 11:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:57:48] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:57:48] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 11:57:48] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2026-05-26 11:57:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 11:57:49] [INFO ] [Real]Added 1010 Read/Feed constraints in 948 ms returned sat
[2026-05-26 11:57:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:57:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-26 11:57:49] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 17 ms returned sat
[2026-05-26 11:57:50] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2026-05-26 11:57:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2223 ms returned sat
[2026-05-26 11:57:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 235 ms.
[2026-05-26 11:57:52] [INFO ] Added : 0 causal constraints over 0 iterations in 409 ms. Result :sat
Minimization took 4507 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:57:57] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:57:57] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2026-05-26 11:57:58] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2026-05-26 11:57:58] [INFO ] [Real]Added 1010 Read/Feed constraints in 678 ms returned sat
[2026-05-26 11:57:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:57:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-26 11:57:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 22 ms returned sat
[2026-05-26 11:57:59] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2026-05-26 11:58:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 3173 ms returned sat
[2026-05-26 11:58:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 234 ms.
[2026-05-26 11:58:03] [INFO ] Added : 0 causal constraints over 0 iterations in 431 ms. Result :sat
Minimization took 4502 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:58:07] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:58:07] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2026-05-26 11:58:08] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2026-05-26 11:58:09] [INFO ] [Real]Added 1010 Read/Feed constraints in 487 ms returned sat
[2026-05-26 11:58:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:58:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:58:09] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 20 ms returned sat
[2026-05-26 11:58:09] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2026-05-26 11:58:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2175 ms returned sat
[2026-05-26 11:58:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 240 ms.
[2026-05-26 11:58:12] [INFO ] Added : 0 causal constraints over 0 iterations in 413 ms. Result :sat
Minimization took 4509 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:58:16] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:58:16] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 15 ms returned sat
[2026-05-26 11:58:17] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2026-05-26 11:58:19] [INFO ] [Real]Added 1010 Read/Feed constraints in 1896 ms returned sat
[2026-05-26 11:58:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:58:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-26 11:58:19] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2026-05-26 11:58:20] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2026-05-26 11:58:22] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2152 ms returned sat
[2026-05-26 11:58:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 237 ms.
[2026-05-26 11:58:22] [INFO ] Added : 0 causal constraints over 0 iterations in 403 ms. Result :sat
Minimization took 4502 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:58:27] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:58:27] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 16 ms returned sat
[2026-05-26 11:58:27] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2026-05-26 11:58:29] [INFO ] [Real]Added 1010 Read/Feed constraints in 1088 ms returned sat
[2026-05-26 11:58:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 11:58:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 11:58:29] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 15 ms returned sat
[2026-05-26 11:58:29] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2026-05-26 11:58:32] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2524 ms returned sat
[2026-05-26 11:58:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 236 ms.
[2026-05-26 11:58:32] [INFO ] Added : 0 causal constraints over 0 iterations in 410 ms. Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-26 11:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 11:58:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-26 11:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 11:58:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 11:58:50] [INFO ] Implicit Places using invariants and state equation in 12687 ms returned []
Implicit Place search using SMT with State Equation took 12871 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 11:58:50] [INFO ] Redundant transitions in 166 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-26 11:58:50] [INFO ] Invariant cache hit.
[2026-05-26 11:58:50] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64365ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 64375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77523 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (4763 resets) in 2229 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (284 resets) in 293 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (282 resets) in 272 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (339 resets) in 283 ms. (140 steps per ms) remains 9/9 properties
[2026-05-26 11:59:57] [INFO ] Flatten gal took : 789 ms
BEST_FIRST walk for 40004 steps (360 resets) in 439 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 430 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (397 resets) in 299 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (401 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (387 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (394 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
[2026-05-26 11:59:58] [INFO ] Flatten gal took : 540 ms
[2026-05-26 11:59:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2637466090909375593.gal : 138 ms
[2026-05-26 11:59:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14030092830950368234.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2637466090909375593.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14030092830950368234.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
Loading property file /tmp/ReachabilityCardinality14030092830950368234.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :389 after 1305
Interrupted probabilistic random walk after 136280 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 9
Probabilistic random walk after 136280 steps, saw 35562 distinct states, run finished after 3006 ms. (steps per millisecond=45 ) properties seen :0
[2026-05-26 12:00:01] [INFO ] Invariant cache hit.
[2026-05-26 12:00:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1305 after 2791
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :2791 after 7485
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :7485 after 13700
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10146ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:00:11] [INFO ] Invariant cache hit.
[2026-05-26 12:00:11] [INFO ] State equation strengthened by 1010 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.
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :13700 after 21482
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :21482 after 34433
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Detected timeout of ITS tools.
[2026-05-26 12:00:48] [INFO ] Flatten gal took : 155 ms
[2026-05-26 12:00:48] [INFO ] Applying decomposition
[2026-05-26 12:00:48] [INFO ] Flatten gal took : 147 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/graph13511672980189444526.txt' '-o' '/tmp/graph13511672980189444526.bin' '-w' '/tmp/graph13511672980189444526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13511672980189444526.bin' '-l' '-1' '-v' '-w' '/tmp/graph13511672980189444526.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:00:49] [INFO ] Decomposing Gal with order
[2026-05-26 12:00:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:00:52] [INFO ] Removed a total of 4345 redundant transitions.
[2026-05-26 12:00:53] [INFO ] Flatten gal took : 3383 ms
[2026-05-26 12:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 1530 labels/synchronizations in 279 ms.
[2026-05-26 12:00:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality981169488737210930.gal : 31 ms
[2026-05-26 12:00:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18316412414936676977.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/ReachabilityCardinality981169488737210930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18316412414936676977.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/ReachabilityCardinality18316412414936676977.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :11 after 22
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :22 after 37
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :37 after 77
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :77 after 192
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :192 after 406
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :406 after 898
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :898 after 1878
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44710ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44721ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44831 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4746 resets) in 1645 ms. (24 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (284 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (281 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1878 after 3717
BEST_FIRST walk for 40004 steps (338 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (405 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (398 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (391 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (394 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :3717 after 7846
Interrupted probabilistic random walk after 146881 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 9
Probabilistic random walk after 146881 steps, saw 37985 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2026-05-26 12:01:00] [INFO ] Invariant cache hit.
[2026-05-26 12:01:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :7846 after 14516
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :14516 after 28940
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Detected timeout of ITS tools.
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90069ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-26 12:02:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:02:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-26 12:02:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:02:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:02:42] [INFO ] Implicit Places using invariants and state equation in 11584 ms returned []
Implicit Place search using SMT with State Equation took 11739 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:02:42] [INFO ] Redundant transitions in 148 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:02:42] [INFO ] Invariant cache hit.
[2026-05-26 12:02:42] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 209 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65004ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 65011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77002 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4, 2, 4, 2, 2] Max Struct:[10, +inf, 10, 10, 10]
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2026-05-26 12:03:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1214 resets) in 82 ms. (120 steps per ms)
BEST_FIRST walk for 10001 steps (72 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2026-05-26 12:03:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:03:47] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:03:47] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 15 ms returned sat
[2026-05-26 12:03:48] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2026-05-26 12:03:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:03:48] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:03:49] [INFO ] [Real]Added 1010 Read/Feed constraints in 1142 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 316 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2026-05-26 12:03:49] [INFO ] Computed 39 invariants in 87 ms
[2026-05-26 12:03:49] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44827ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44837ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45163 ms. Remains : 160/170 places, 1875/1885 transitions.
[2026-05-26 12:04:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119333 resets) in 8466 ms. (118 steps per ms)
BEST_FIRST walk for 1000001 steps (7462 resets) in 1260 ms. (793 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2026-05-26 12:04:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:04:44] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-26 12:04:44] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2026-05-26 12:04:44] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2026-05-26 12:04:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:04:45] [INFO ] [Real]Added 1010 Read/Feed constraints in 460 ms returned sat
[2026-05-26 12:04:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:04:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:04:45] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2026-05-26 12:04:45] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2026-05-26 12:04:50] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:04:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 9144 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 116 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 119 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2026-05-26 12:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:04:56] [INFO ] Implicit Places using invariants in 927 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 933 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 97 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1149 ms. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2026-05-26 12:04:56] [INFO ] Computed 29 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119264 resets) in 8804 ms. (113 steps per ms)
BEST_FIRST walk for 1000001 steps (7462 resets) in 1038 ms. (962 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2026-05-26 12:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:05:06] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:05:06] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 11 ms returned sat
[2026-05-26 12:05:07] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2026-05-26 12:05:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:05:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-26 12:05:07] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 10 ms returned sat
[2026-05-26 12:05:07] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2026-05-26 12:05:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:05:12] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:05:15] [INFO ] [Nat]Added 1010 Read/Feed constraints in 7530 ms returned sat
[2026-05-26 12:05:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 266 ms.
[2026-05-26 12:05:15] [INFO ] Added : 0 causal constraints over 0 iterations in 498 ms. Result :sat
Minimization took 5077 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 104 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 97 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2026-05-26 12:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:05:21] [INFO ] Implicit Places using invariants in 655 ms returned []
[2026-05-26 12:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:05:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:05:54] [INFO ] Performed 9/150 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-05-26 12:06:24] [INFO ] Performed 16/150 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-05-26 12:07:07] [INFO ] Performed 21/150 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2026-05-26 12:07:40] [INFO ] Performed 23/150 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2026-05-26 12:07:40] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2026-05-26 12:07:40] [INFO ] Implicit Places using invariants and state equation in 138464 ms returned []
Implicit Place search using SMT with State Equation took 139128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:07:40] [INFO ] Redundant transitions in 47 ms returned []
Running 1830 sub problems to find dead transitions.
[2026-05-26 12:07:40] [INFO ] Invariant cache hit.
[2026-05-26 12:07:40] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/2025 variables, and 29 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 64986ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 64992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204275 ms. Remains : 150/150 places, 1875/1875 transitions.
[2026-05-26 12:08:45] [INFO ] Flatten gal took : 214 ms
RANDOM walk for 40000 steps (4776 resets) in 1164 ms. (34 steps per ms) remains 2/2 properties
[2026-05-26 12:08:45] [INFO ] Flatten gal took : 166 ms
BEST_FIRST walk for 40004 steps (296 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
[2026-05-26 12:08:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16557562841780007461.gal : 42 ms
[2026-05-26 12:08:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14107587220133543671.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/ReachabilityCardinality16557562841780007461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14107587220133543671.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (296 resets) in 133 ms. (298 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 ...330
Loading property file /tmp/ReachabilityCardinality14107587220133543671.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 43
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :43 after 77
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :77 after 94
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :94 after 164
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :164 after 581
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :581 after 839
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :839 after 1651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1651 after 3049
Interrupted probabilistic random walk after 203480 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 203480 steps, saw 49928 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2026-05-26 12:08:48] [INFO ] Invariant cache hit.
[2026-05-26 12:08:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3049 after 4482
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3459 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2015/2025 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2809 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6312ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 106 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Running 1830 sub problems to find dead transitions.
[2026-05-26 12:08:55] [INFO ] Invariant cache hit.
[2026-05-26 12:08:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4482 after 11577
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11577 after 29800
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/2025 variables, and 29 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Detected timeout of ITS tools.
[2026-05-26 12:09:36] [INFO ] Flatten gal took : 115 ms
[2026-05-26 12:09:36] [INFO ] Applying decomposition
[2026-05-26 12:09:36] [INFO ] Flatten gal took : 141 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/graph17975435658884485787.txt' '-o' '/tmp/graph17975435658884485787.bin' '-w' '/tmp/graph17975435658884485787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17975435658884485787.bin' '-l' '-1' '-v' '-w' '/tmp/graph17975435658884485787.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:09:36] [INFO ] Decomposing Gal with order
[2026-05-26 12:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:09:37] [INFO ] Removed a total of 2757 redundant transitions.
[2026-05-26 12:09:37] [INFO ] Flatten gal took : 621 ms
[2026-05-26 12:09:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 35 ms.
[2026-05-26 12:09:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10674269862922387203.gal : 19 ms
[2026-05-26 12:09:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17409876114843239566.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/ReachabilityCardinality10674269862922387203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17409876114843239566.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 ...330
Loading property file /tmp/ReachabilityCardinality17409876114843239566.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 33
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :33 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 193
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :193 after 239
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :239 after 297
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :297 after 887
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :887 after 1147
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1147 after 3027
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/2025 variables, and 29 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44987ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45102 ms. Remains : 150/150 places, 1875/1875 transitions.
RANDOM walk for 40000 steps (4776 resets) in 664 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3027 after 6072
Interrupted probabilistic random walk after 221842 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221842 steps, saw 54336 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2026-05-26 12:09:43] [INFO ] Invariant cache hit.
[2026-05-26 12:09:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6072 after 14360
At refinement iteration 8 (OVERLAPS) 10/2025 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6324 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 2/1181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2015 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :14360 after 32600
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28693 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35045ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 105 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2026-05-26 12:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:10:19] [INFO ] Implicit Places using invariants in 586 ms returned []
[2026-05-26 12:10:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:10:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-26 12:11:06] [INFO ] Performed 10/150 implicitness test of which 0 returned IMPLICIT in 46 seconds.
[2026-05-26 12:11:44] [INFO ] Performed 19/150 implicitness test of which 0 returned IMPLICIT in 84 seconds.
[2026-05-26 12:12:26] [INFO ] Performed 24/150 implicitness test of which 0 returned IMPLICIT in 125 seconds.
[2026-05-26 12:12:26] [INFO ] Timeout of Implicit test with SMT after 125 seconds.
[2026-05-26 12:12:26] [INFO ] Implicit Places using invariants and state equation in 127105 ms returned []
Implicit Place search using SMT with State Equation took 127694 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:12:26] [INFO ] Redundant transitions in 49 ms returned []
Running 1830 sub problems to find dead transitions.
[2026-05-26 12:12:26] [INFO ] Invariant cache hit.
[2026-05-26 12:12:26] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/2025 variables, and 29 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65285ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 65291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193141 ms. Remains : 150/150 places, 1875/1875 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[10]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00 in 584476 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-01
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 1885 rows 170 cols
[2026-05-26 12:13:31] [INFO ] Computed 39 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1182 resets) in 79 ms. (125 steps per ms)
BEST_FIRST walk for 10000 steps (84 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2026-05-26 12:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:13:32] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:13:32] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2026-05-26 12:13:32] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2026-05-26 12:13:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:13:33] [INFO ] [Real]Added 1010 Read/Feed constraints in 538 ms returned sat
[2026-05-26 12:13:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:13:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:13:33] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:13:33] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2026-05-26 12:13:34] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:13:34] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1148 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 93 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:13:34] [INFO ] Invariant cache hit.
[2026-05-26 12:13:35] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44674ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44775 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2026-05-26 12:14:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (119326 resets) in 9747 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (8511 resets) in 1237 ms. (807 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2026-05-26 12:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:14:32] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:14:32] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:14:32] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2026-05-26 12:14:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:14:33] [INFO ] [Real]Added 1010 Read/Feed constraints in 484 ms returned sat
[2026-05-26 12:14:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:14:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:14:33] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 15 ms returned sat
[2026-05-26 12:14:33] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2026-05-26 12:14:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 3328 ms returned sat
[2026-05-26 12:14:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 376 ms.
[2026-05-26 12:14:37] [INFO ] Added : 0 causal constraints over 0 iterations in 627 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 112 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-26 12:14:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:14:43] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-05-26 12:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:14:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:15:17] [INFO ] Performed 9/170 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2026-05-26 12:16:00] [INFO ] Performed 19/170 implicitness test of which 0 returned IMPLICIT in 76 seconds.
[2026-05-26 12:16:45] [INFO ] Performed 22/170 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-26 12:16:45] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-26 12:16:45] [INFO ] Implicit Places using invariants and state equation in 122374 ms returned []
Implicit Place search using SMT with State Equation took 123047 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:16:45] [INFO ] Redundant transitions in 44 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:16:45] [INFO ] Invariant cache hit.
[2026-05-26 12:16:45] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64735ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 64741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187961 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2026-05-26 12:17:52] [INFO ] Flatten gal took : 144 ms
RANDOM walk for 40000 steps (4777 resets) in 563 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (340 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
[2026-05-26 12:17:52] [INFO ] Flatten gal took : 115 ms
[2026-05-26 12:17:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9200923759801643767.gal : 17 ms
[2026-05-26 12:17:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4206220063900468607.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/ReachabilityCardinality9200923759801643767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4206220063900468607.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/ReachabilityCardinality4206220063900468607.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :389 after 1305
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1305 after 2791
Interrupted probabilistic random walk after 244733 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 244733 steps, saw 62383 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-26 12:17:55] [INFO ] Invariant cache hit.
[2026-05-26 12:17:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 990/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2791 after 7485
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3375ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:17:58] [INFO ] Invariant cache hit.
[2026-05-26 12:17:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7485 after 13700
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :13700 after 21482
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :21482 after 34433
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Detected timeout of ITS tools.
[2026-05-26 12:18:42] [INFO ] Flatten gal took : 115 ms
[2026-05-26 12:18:42] [INFO ] Applying decomposition
[2026-05-26 12:18:42] [INFO ] Flatten gal took : 94 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/graph7588057269255244410.txt' '-o' '/tmp/graph7588057269255244410.bin' '-w' '/tmp/graph7588057269255244410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7588057269255244410.bin' '-l' '-1' '-v' '-w' '/tmp/graph7588057269255244410.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:18:42] [INFO ] Decomposing Gal with order
[2026-05-26 12:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:18:43] [INFO ] Removed a total of 4809 redundant transitions.
[2026-05-26 12:18:43] [INFO ] Flatten gal took : 393 ms
[2026-05-26 12:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 52 ms.
[2026-05-26 12:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15928784403866979360.gal : 19 ms
[2026-05-26 12:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11269793184526846365.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/ReachabilityCardinality15928784403866979360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11269793184526846365.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 ...330
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 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45043ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 45048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45146 ms. Remains : 170/170 places, 1885/1885 transitions.
Loading property file /tmp/ReachabilityCardinality11269793184526846365.prop.
RANDOM walk for 40000 steps (4789 resets) in 538 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (339 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 125
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :125 after 197
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :197 after 259
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :259 after 589
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :589 after 928
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :928 after 2874
Interrupted probabilistic random walk after 276849 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276849 steps, saw 69937 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2026-05-26 12:18:46] [INFO ] Invariant cache hit.
[2026-05-26 12:18:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 990/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2874 after 5849
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 990/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3929 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4969ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 90 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-26 12:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:18:52] [INFO ] Implicit Places using invariants in 382 ms returned []
[2026-05-26 12:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:18:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5849 after 17330
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :17330 after 31631
[2026-05-26 12:19:26] [INFO ] Performed 10/170 implicitness test of which 0 returned IMPLICIT in 33 seconds.
Detected timeout of ITS tools.
[2026-05-26 12:20:02] [INFO ] Performed 19/170 implicitness test of which 0 returned IMPLICIT in 69 seconds.
[2026-05-26 12:20:33] [INFO ] Performed 25/170 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2026-05-26 12:21:03] [INFO ] Performed 83/170 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2026-05-26 12:21:03] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2026-05-26 12:21:03] [INFO ] Implicit Places using invariants and state equation in 130940 ms returned []
Implicit Place search using SMT with State Equation took 131325 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:21:03] [INFO ] Redundant transitions in 46 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:21:03] [INFO ] Invariant cache hit.
[2026-05-26 12:21:03] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 65558ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 65562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197037 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-01 in 517214 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2026-05-26 12:22:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1177 resets) in 96 ms. (103 steps per ms)
BEST_FIRST walk for 10001 steps (90 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2026-05-26 12:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:22:09] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:22:09] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:22:09] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2026-05-26 12:22:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:22:10] [INFO ] [Real]Added 1010 Read/Feed constraints in 563 ms returned sat
[2026-05-26 12:22:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:22:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:22:10] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:22:10] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2026-05-26 12:22:11] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:22:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1150 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 190 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2026-05-26 12:22:12] [INFO ] Computed 39 invariants in 31 ms
[2026-05-26 12:22:12] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44676ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44680ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44874 ms. Remains : 160/170 places, 1875/1885 transitions.
[2026-05-26 12:22:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119275 resets) in 10735 ms. (93 steps per ms)
BEST_FIRST walk for 1000001 steps (9405 resets) in 2392 ms. (417 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2026-05-26 12:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:23:10] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:23:10] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:23:10] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2026-05-26 12:23:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:23:11] [INFO ] [Real]Added 1010 Read/Feed constraints in 935 ms returned sat
[2026-05-26 12:23:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:23:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:23:11] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2026-05-26 12:23:12] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2026-05-26 12:23:16] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:23:21] [INFO ] [Nat]Added 1010 Read/Feed constraints in 9134 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 104 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2026-05-26 12:23:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:23:21] [INFO ] Implicit Places using invariants in 394 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 397 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 219 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2026-05-26 12:23:22] [INFO ] Computed 29 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:23:22] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-26 12:23:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:23:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:23:56] [INFO ] Performed 106/140 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-05-26 12:24:28] [INFO ] Performed 109/140 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2026-05-26 12:25:13] [INFO ] Performed 115/140 implicitness test of which 0 returned IMPLICIT in 108 seconds.
[2026-05-26 12:25:46] [INFO ] Performed 117/140 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2026-05-26 12:25:46] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2026-05-26 12:25:46] [INFO ] Implicit Places using invariants and state equation in 143844 ms returned []
Implicit Place search using SMT with State Equation took 144147 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 144867 ms. Remains : 140/160 places, 1865/1875 transitions.
[2026-05-26 12:25:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (178911 resets) in 12489 ms. (80 steps per ms)
BEST_FIRST walk for 1000001 steps (11363 resets) in 2316 ms. (431 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2026-05-26 12:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:26:01] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:26:01] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 9 ms returned sat
[2026-05-26 12:26:01] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2026-05-26 12:26:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:26:03] [INFO ] [Real]Added 1010 Read/Feed constraints in 1525 ms returned sat
[2026-05-26 12:26:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:26:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:26:03] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 13 ms returned sat
[2026-05-26 12:26:03] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2026-05-26 12:26:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1714 ms returned sat
[2026-05-26 12:26:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 343 ms.
[2026-05-26 12:26:06] [INFO ] Added : 0 causal constraints over 0 iterations in 552 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 163 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 111 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2026-05-26 12:26:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:26:11] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-26 12:26:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:26:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:26:44] [INFO ] Performed 106/140 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-26 12:27:25] [INFO ] Performed 115/140 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2026-05-26 12:27:58] [INFO ] Performed 122/140 implicitness test of which 0 returned IMPLICIT in 105 seconds.
[2026-05-26 12:28:30] [INFO ] Performed 129/140 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2026-05-26 12:28:30] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2026-05-26 12:28:30] [INFO ] Implicit Places using invariants and state equation in 139340 ms returned []
Implicit Place search using SMT with State Equation took 139624 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:28:30] [INFO ] Redundant transitions in 42 ms returned []
Running 1820 sub problems to find dead transitions.
[2026-05-26 12:28:30] [INFO ] Invariant cache hit.
[2026-05-26 12:28:30] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 140/2005 variables, and 29 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/140 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1820/1100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1820 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 3 (OVERLAPS) 1865/2005 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2005/2005 variables, and 1179 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65095ms problems are : Problem set: 0 solved, 1820 unsolved
Search for dead transitions found 0 dead transitions in 65099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204893 ms. Remains : 140/140 places, 1865/1865 transitions.
[2026-05-26 12:29:35] [INFO ] Flatten gal took : 99 ms
[2026-05-26 12:29:36] [INFO ] Flatten gal took : 109 ms
[2026-05-26 12:29:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6203815521515172645.gal : 13 ms
[2026-05-26 12:29:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9336803209207567569.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/ReachabilityCardinality6203815521515172645.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9336803209207567569.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
RANDOM walk for 40000 steps (7150 resets) in 1514 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (452 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (452 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9336803209207567569.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 62
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :62 after 110
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :110 after 239
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 898 ms. (steps per millisecond=54 ) properties seen :0
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :239 after 404
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :404 after 746
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 831 ms. (steps per millisecond=58 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-COL-10-UpperBounds-08 4 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-14 4 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-02 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02 in 449069 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-03
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 1885 rows 170 cols
[2026-05-26 12:29:38] [INFO ] Computed 39 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1199 resets) in 82 ms. (120 steps per ms)
BEST_FIRST walk for 10001 steps (100 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2026-05-26 12:29:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:29:38] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:29:38] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2026-05-26 12:29:39] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2026-05-26 12:29:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:29:39] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:29:40] [INFO ] [Real]Added 1010 Read/Feed constraints in 1148 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 87 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:29:40] [INFO ] Invariant cache hit.
[2026-05-26 12:29:40] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44428ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44525 ms. Remains : 170/170 places, 1885/1885 transitions.
[2026-05-26 12:30:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (119467 resets) in 8115 ms. (123 steps per ms)
BEST_FIRST walk for 1000001 steps (9998 resets) in 1180 ms. (846 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2026-05-26 12:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:30:34] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:30:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:30:34] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2026-05-26 12:30:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:30:36] [INFO ] [Real]Added 1010 Read/Feed constraints in 1737 ms returned sat
[2026-05-26 12:30:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:30:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:30:36] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2026-05-26 12:30:37] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2026-05-26 12:30:39] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2009 ms returned sat
[2026-05-26 12:30:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 238 ms.
[2026-05-26 12:30:39] [INFO ] Added : 0 causal constraints over 0 iterations in 397 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-26 12:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:30:44] [INFO ] Implicit Places using invariants in 489 ms returned []
[2026-05-26 12:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:30:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:31:15] [INFO ] Performed 9/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-26 12:31:57] [INFO ] Performed 19/170 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2026-05-26 12:32:28] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 103 seconds.
[2026-05-26 12:32:54] [INFO ] Implicit Places using invariants and state equation in 129953 ms returned []
Implicit Place search using SMT with State Equation took 130449 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:32:54] [INFO ] Redundant transitions in 44 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:32:54] [INFO ] Invariant cache hit.
[2026-05-26 12:32:54] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 2339 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 31380 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66447ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 66451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197051 ms. Remains : 170/170 places, 1885/1885 transitions.
[2026-05-26 12:34:01] [INFO ] Flatten gal took : 97 ms
[2026-05-26 12:34:01] [INFO ] Flatten gal took : 131 ms
[2026-05-26 12:34:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13008147158501592419.gal : 14 ms
[2026-05-26 12:34:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12623435660802306962.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/ReachabilityCardinality13008147158501592419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12623435660802306962.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 ...330
RANDOM walk for 40000 steps (4764 resets) in 1299 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (400 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (395 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12623435660802306962.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :389 after 1305
Interrupted probabilistic random walk after 222918 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 222918 steps, saw 56892 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2026-05-26 12:34:04] [INFO ] Invariant cache hit.
[2026-05-26 12:34:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1305 after 2791
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2791 after 7485
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6096ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 91 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:34:10] [INFO ] Invariant cache hit.
[2026-05-26 12:34:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7485 after 13700
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13700 after 21482
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :21482 after 34433
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Detected timeout of ITS tools.
[2026-05-26 12:34:51] [INFO ] Flatten gal took : 104 ms
[2026-05-26 12:34:51] [INFO ] Applying decomposition
[2026-05-26 12:34:51] [INFO ] Flatten gal took : 110 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/graph13960283253598764415.txt' '-o' '/tmp/graph13960283253598764415.bin' '-w' '/tmp/graph13960283253598764415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13960283253598764415.bin' '-l' '-1' '-v' '-w' '/tmp/graph13960283253598764415.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:34:52] [INFO ] Decomposing Gal with order
[2026-05-26 12:34:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:34:52] [INFO ] Removed a total of 2867 redundant transitions.
[2026-05-26 12:34:52] [INFO ] Flatten gal took : 683 ms
[2026-05-26 12:34:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 15 ms.
[2026-05-26 12:34:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10065115398215019110.gal : 37 ms
[2026-05-26 12:34:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9016020910988977823.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/ReachabilityCardinality10065115398215019110.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9016020910988977823.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
Loading property file /tmp/ReachabilityCardinality9016020910988977823.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 37
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :37 after 202
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :202 after 216
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :216 after 254
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :254 after 381
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :381 after 1337
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44447ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44547 ms. Remains : 170/170 places, 1885/1885 transitions.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1337 after 2777
RANDOM walk for 40000 steps (4759 resets) in 483 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (397 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (394 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2777 after 5669
Interrupted probabilistic random walk after 210925 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 210925 steps, saw 54359 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2026-05-26 12:34:58] [INFO ] Invariant cache hit.
[2026-05-26 12:34:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5669 after 10828
At refinement iteration 10 (OVERLAPS) 10/2055 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4738 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10828 after 39529
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21013ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 173 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 107 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-26 12:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:35:20] [INFO ] Implicit Places using invariants in 722 ms returned []
[2026-05-26 12:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:35:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :39529 after 56309
Detected timeout of ITS tools.
[2026-05-26 12:35:54] [INFO ] Performed 10/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2026-05-26 12:36:29] [INFO ] Performed 19/170 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2026-05-26 12:37:00] [INFO ] Performed 29/170 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2026-05-26 12:37:30] [INFO ] Performed 101/170 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2026-05-26 12:37:30] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2026-05-26 12:37:30] [INFO ] Implicit Places using invariants and state equation in 129466 ms returned []
Implicit Place search using SMT with State Equation took 130190 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:37:30] [INFO ] Redundant transitions in 45 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-26 12:37:30] [INFO ] Invariant cache hit.
[2026-05-26 12:37:30] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
(s128 2.0timeout
^^^^^^^^^^
(error "Invalid token: 2.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 2.0)
(s121 2.0)
(s122 2.0)
(s123 2.0)
(s124 2.0)
(s125 2.0)
(s126 2.0)
(s127 2.0)
(s128 2.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64382ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 64388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194742 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[10]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-03 in 536504 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2026-05-26 12:38:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1197 resets) in 81 ms. (121 steps per ms)
BEST_FIRST walk for 10001 steps (98 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2026-05-26 12:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 12:38:34] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-26 12:38:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2026-05-26 12:38:35] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2026-05-26 12:38:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:38:36] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 12:38:36] [INFO ] [Real]Added 1010 Read/Feed constraints in 1141 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 181 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2026-05-26 12:38:36] [INFO ] Computed 39 invariants in 29 ms
[2026-05-26 12:38:36] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44846ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45036 ms. Remains : 160/170 places, 1875/1885 transitions.
[2026-05-26 12:39:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (119403 resets) in 8016 ms. (124 steps per ms)
BEST_FIRST walk for 1000001 steps (10377 resets) in 1154 ms. (865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2026-05-26 12:39:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:39:30] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-26 12:39:30] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 18 ms returned sat
[2026-05-26 12:39:31] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2026-05-26 12:39:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:39:32] [INFO ] [Real]Added 1010 Read/Feed constraints in 914 ms returned sat
[2026-05-26 12:39:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:39:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-26 12:39:32] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 18 ms returned sat
[2026-05-26 12:39:33] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2026-05-26 12:39:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 3144 ms returned sat
[2026-05-26 12:39:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 238 ms.
[2026-05-26 12:39:36] [INFO ] Added : 0 causal constraints over 0 iterations in 434 ms. Result :sat
Minimization took 5219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 91 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 92 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2026-05-26 12:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:39:42] [INFO ] Implicit Places using invariants in 681 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 686 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 193 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2026-05-26 12:39:43] [INFO ] Computed 29 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:39:43] [INFO ] Implicit Places using invariants in 488 ms returned []
[2026-05-26 12:39:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:39:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:40:20] [INFO ] Performed 7/140 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2026-05-26 12:40:52] [INFO ] Performed 9/140 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2026-05-26 12:41:24] [INFO ] Performed 11/140 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2026-05-26 12:41:55] [INFO ] Performed 16/140 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2026-05-26 12:41:55] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2026-05-26 12:41:55] [INFO ] Implicit Places using invariants and state equation in 132264 ms returned []
Implicit Place search using SMT with State Equation took 132752 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 133724 ms. Remains : 140/160 places, 1865/1875 transitions.
[2026-05-26 12:41:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (178936 resets) in 11115 ms. (89 steps per ms)
BEST_FIRST walk for 1000001 steps (14084 resets) in 1152 ms. (867 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2026-05-26 12:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:42:08] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:42:08] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 9 ms returned sat
[2026-05-26 12:42:08] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2026-05-26 12:42:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:42:09] [INFO ] [Real]Added 1010 Read/Feed constraints in 760 ms returned sat
[2026-05-26 12:42:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 12:42:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-26 12:42:09] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 9 ms returned sat
[2026-05-26 12:42:10] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2026-05-26 12:42:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2191 ms returned sat
[2026-05-26 12:42:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 293 ms.
[2026-05-26 12:42:13] [INFO ] Added : 0 causal constraints over 0 iterations in 742 ms. Result :sat
Minimization took 4515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 151 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 154 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2026-05-26 12:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:42:18] [INFO ] Implicit Places using invariants in 536 ms returned []
[2026-05-26 12:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 12:42:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-26 12:42:55] [INFO ] Performed 7/140 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2026-05-26 12:43:27] [INFO ] Performed 9/140 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2026-05-26 12:44:06] [INFO ] Performed 12/140 implicitness test of which 0 returned IMPLICIT in 106 seconds.
[2026-05-26 12:44:38] [INFO ] Performed 14/140 implicitness test of which 0 returned IMPLICIT in 138 seconds.
[2026-05-26 12:44:38] [INFO ] Timeout of Implicit test with SMT after 138 seconds.
[2026-05-26 12:44:38] [INFO ] Implicit Places using invariants and state equation in 140576 ms returned []
Implicit Place search using SMT with State Equation took 141118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 12:44:39] [INFO ] Redundant transitions in 43 ms returned []
Running 1820 sub problems to find dead transitions.
[2026-05-26 12:44:39] [INFO ] Invariant cache hit.
[2026-05-26 12:44:39] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2005/2005 variables, and 169 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1820/1100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1820 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 3 (OVERLAPS) 1865/2005 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2005 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2005/2005 variables, and 2279 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 31514 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1820/1100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66429ms problems are : Problem set: 0 solved, 1820 unsolved
Search for dead transitions found 0 dead transitions in 66433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207759 ms. Remains : 140/140 places, 1865/1865 transitions.
[2026-05-26 12:45:45] [INFO ] Flatten gal took : 96 ms
RANDOM walk for 40000 steps (7138 resets) in 772 ms. (51 steps per ms) remains 2/2 properties
[2026-05-26 12:45:45] [INFO ] Flatten gal took : 169 ms
BEST_FIRST walk for 40004 steps (560 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2026-05-26 12:45:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16945323317441374887.gal : 13 ms
[2026-05-26 12:45:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16234745410585876899.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/ReachabilityCardinality16945323317441374887.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16234745410585876899.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 ...330
BEST_FIRST walk for 40004 steps (560 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16234745410585876899.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 751 ms. (steps per millisecond=64 ) properties seen :0
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 62
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :62 after 110
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :110 after 239
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :239 after 404
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 748 ms. (steps per millisecond=64 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-COL-10-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05 in 432626 ms.
[2026-05-26 12:45:47] [INFO ] Flatten gal took : 90 ms
[2026-05-26 12:45:47] [INFO ] Applying decomposition
[2026-05-26 12:45:47] [INFO ] Flatten gal took : 92 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/graph13152309528938080762.txt' '-o' '/tmp/graph13152309528938080762.bin' '-w' '/tmp/graph13152309528938080762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13152309528938080762.bin' '-l' '-1' '-v' '-w' '/tmp/graph13152309528938080762.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:45:47] [INFO ] Decomposing Gal with order
[2026-05-26 12:45:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:45:48] [INFO ] Removed a total of 2660 redundant transitions.
[2026-05-26 12:45:48] [INFO ] Flatten gal took : 463 ms
[2026-05-26 12:45:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-26 12:45:48] [INFO ] Time to serialize gal into /tmp/UpperBounds14860736776519835411.gal : 14 ms
[2026-05-26 12:45:48] [INFO ] Time to serialize properties into /tmp/UpperBounds7874481286979252502.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/UpperBounds14860736776519835411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7874481286979252502.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 ...305
Loading property file /tmp/UpperBounds7874481286979252502.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,199051,172.183,2477552,2,234511,5,3.07206e+06,6,0,2588,922616,0
Total reachable state count : 199051

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-00 :0 <= gu4.WaitRight_0+gu5.WaitRight_1+gu6.WaitRight_2+gu7.WaitRight_3+gu0.WaitRight_4+gu1.WaitRight_5...224
FORMULA PhilosophersDyn-COL-10-UpperBounds-04 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-10-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-10-UpperBounds-15 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-10-UpperBounds-00 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-00,0,172.604,2477552,1,0,7,3.07206e+06,9,1,3108,922616,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-01 :0 <= gu4.Forks_0+gu5.Forks_1+gu6.Forks_2+gu7.Forks_3+gu0.Forks_4+gu1.Forks_5+gu8.Forks_6+gu9.Forks_7...184
FORMULA PhilosophersDyn-COL-10-UpperBounds-01 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-01,0,172.899,2477552,1,0,8,3.07206e+06,10,1,3398,922616,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-03 :0 <= gu4.HasLeft_0+gu5.HasLeft_1+gu6.HasLeft_2+gu7.HasLeft_3+gu0.HasLeft_4+gu1.HasLeft_5+gu8.HasLeft...204
FORMULA PhilosophersDyn-COL-10-UpperBounds-07 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-10-UpperBounds-11 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-10-UpperBounds-03 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-03,0,173.213,2477552,1,0,9,3.07206e+06,11,1,3742,922616,6
Total runtime 3145196 ms.

BK_STOP 1779799722066

--------------------
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="PhilosophersDyn-COL-10"
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 PhilosophersDyn-COL-10, 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 r223-smll-177969946300026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 ;