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-177969946400051.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 PolyORBLF-COL-S06J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946400051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.7K Mar 8 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 8 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 8 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Mar 16 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 16 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 8 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 15:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 8 15:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779815937369

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:18:59] [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 17:18:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:18:59] [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 17:19:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:19:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1173 ms
[2026-05-26 17:19:00] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 894 PT places and 14420.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2026-05-26 17:19:00] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2026-05-26 17:19:00] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:19:00] [INFO ] Computed 26 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 10, 1, 0, 0, 0, 1, 6, 0, 0, 1, 0, 0] Max Struct:[8, 6, 6, 7, 24, 1, 6, 40, 8, 25, 6, 8, 8, 1, 3, 6]
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:19:01] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:19:01] [INFO ] Computed 26 invariants in 13 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:01] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2026-05-26 17:19:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2026-05-26 17:19:01] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-26 17:19:01] [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 17:19:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:19:01] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:19:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:19:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:01] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 17 ms to minimize.
[2026-05-26 17:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2026-05-26 17:19:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:19:01] [INFO ] Added : 28 causal constraints over 6 iterations in 144 ms. Result :sat
Minimization took 52 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:19:02] [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 17:19:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2026-05-26 17:19:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-26 17:19:02] [INFO ] Added : 9 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-26 17:19:02] [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 17:19:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:19:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:02] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 8 ms to minimize.
[2026-05-26 17:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2026-05-26 17:19:02] [INFO ] Added : 24 causal constraints over 6 iterations in 192 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:19:03] [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 17:19:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-26 17:19:03] [INFO ] Added : 54 causal constraints over 11 iterations in 174 ms. Result :sat
Minimization took 74 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-26 17:19:03] [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 17:19:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2026-05-26 17:19:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:19:03] [INFO ] Added : 29 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:19:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-26 17:19:04] [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 17:19:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2026-05-26 17:19:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:04] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 13 ms to minimize.
[2026-05-26 17:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2026-05-26 17:19:04] [INFO ] Added : 34 causal constraints over 8 iterations in 183 ms. Result :sat
Minimization took 51 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:04] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:04] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-26 17:19:04] [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 17:19:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-26 17:19:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:04] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 5 ms to minimize.
[2026-05-26 17:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2026-05-26 17:19:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:04] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 11 ms to minimize.
[2026-05-26 17:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-26 17:19:04] [INFO ] Added : 54 causal constraints over 11 iterations in 264 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:05] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-26 17:19:05] [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 17:19:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:19:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:05] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:05] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:05] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:05] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:05] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 4 ms to minimize.
[2026-05-26 17:19:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 372 ms
[2026-05-26 17:19:05] [INFO ] Added : 57 causal constraints over 12 iterations in 542 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:05] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:19:05] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-26 17:19:05] [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 17:19:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 56 ms returned sat
[2026-05-26 17:19:06] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-26 17:19:06] [INFO ] Added : 30 causal constraints over 7 iterations in 71 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:06] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:19:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 22 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-26 17:19:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:19:06] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:19:06] [INFO ] Added : 10 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 10, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[8, 6, 6, 1, 10, 6, 40, 8, 1, 8, 8, 3, 6]
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2026-05-26 17:19:07] [INFO ] Unfolded HLPN to a Petri net with 894 places and 14334 transitions 119772 arcs in 293 ms.
[2026-05-26 17:19:07] [INFO ] Unfolded 10 HLPN properties in 4 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 6, 6, 40, 8, 8, 8, 3, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 6, 6, 40, 8, 8, 8, 3, 6]
[2026-05-26 17:19:07] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2026-05-26 17:19:07] [INFO ] Computed 62 invariants in 348 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 6, 6, 32, 8, 8, 8, 3, 6]
RANDOM walk for 10000 steps (59 resets) in 256 ms. (38 steps per ms)
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80004 steps (186 resets) in 513 ms. (155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 5, 4, 4, 1, 1, 1] Max Struct:[8, 6, 6, 6, 32, 8, 8, 8]
[2026-05-26 17:19:08] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
[2026-05-26 17:19:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:08] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2026-05-26 17:19:08] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 49 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:08] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2026-05-26 17:19:08] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 45 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:09] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2026-05-26 17:19:09] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 45 ms returned sat
[2026-05-26 17:19:11] [INFO ] [Real]Absence check using state equation in 2349 ms returned sat
[2026-05-26 17:19:11] [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 17:19:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2026-05-26 17:19:12] [INFO ] [Nat]Absence check using 23 positive and 39 generalized place invariants in 42 ms returned sat
[2026-05-26 17:19:14] [INFO ] [Nat]Absence check using state equation in 2288 ms returned sat
[2026-05-26 17:19:14] [INFO ] State equation strengthened by 224 read => feed constraints.
[2026-05-26 17:19:14] [INFO ] [Nat]Added 224 Read/Feed constraints in 381 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:19:17] [INFO ] Deduced a trap composed of 93 places in 2285 ms of which 287 ms to minimize.
[2026-05-26 17:19:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:17] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:17] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:17] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2026-05-26 17:19:17] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 53 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned sat
[2026-05-26 17:19:18] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 80 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2026-05-26 17:19:18] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 78 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 5, 4, 4, 1, 1, 1] Max Struct:[1, 2, 6, 4, 4, 1, 1, 1]
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 48 out of 894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 894/894 places, 3574/3574 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 888 transition count 3502
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 150 place count 816 transition count 3502
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 150 place count 816 transition count 3390
Deduced a syphon composed of 112 places in 9 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 374 place count 704 transition count 3390
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 566 place count 608 transition count 3294
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 582 place count 608 transition count 3278
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 598 place count 592 transition count 3278
Applied a total of 598 rules in 979 ms. Remains 592 /894 variables (removed 302) and now considering 3278/3574 (removed 296) transitions.
Running 3272 sub problems to find dead transitions.
[2026-05-26 17:19:19] [INFO ] Flow matrix only has 3230 transitions (discarded 48 similar events)
// Phase 1: matrix 3230 rows 592 cols
[2026-05-26 17:19:19] [INFO ] Computed 56 invariants in 141 ms
[2026-05-26 17:19:20] [INFO ] State equation strengthened by 224 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3272 unsolved
SMT process timed out in 27615ms, After SMT, problems are : Problem set: 0 solved, 3272 unsolved
Search for dead transitions found 0 dead transitions in 27675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28715 ms. Remains : 592/894 places, 3278/3574 transitions.
[2026-05-26 17:19:47] [INFO ] Flow matrix only has 3230 transitions (discarded 48 similar events)
[2026-05-26 17:19:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (10978 resets) in 20038 ms. (49 steps per ms)
BEST_FIRST walk for 706760 steps (1448 resets) in 5001 ms. (141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2026-05-26 17:20:12] [INFO ] Flow matrix only has 3230 transitions (discarded 48 similar events)
[2026-05-26 17:20:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:20:12] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2026-05-26 17:20:12] [INFO ] [Real]Absence check using 18 positive and 38 generalized place invariants in 57 ms returned sat
[2026-05-26 17:20:15] [INFO ] [Real]Absence check using state equation in 2825 ms returned sat
[2026-05-26 17:20:15] [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 17:20:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2026-05-26 17:20:15] [INFO ] [Nat]Absence check using 18 positive and 38 generalized place invariants in 91 ms returned sat
[2026-05-26 17:20:24] [INFO ] [Nat]Absence check using state equation in 8545 ms returned sat
[2026-05-26 17:20:24] [INFO ] State equation strengthened by 224 read => feed constraints.
[2026-05-26 17:20:26] [INFO ] [Nat]Added 224 Read/Feed constraints in 2162 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:28] [INFO ] Deduced a trap composed of 56 places in 1734 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:30] [INFO ] Deduced a trap composed of 56 places in 1958 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:32] [INFO ] Deduced a trap composed of 56 places in 1661 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:34] [INFO ] Deduced a trap composed of 56 places in 1693 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:36] [INFO ] Deduced a trap composed of 56 places in 1875 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:38] [INFO ] Deduced a trap composed of 56 places in 1707 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:20:39] [INFO ] Deduced a trap composed of 151 places in 1689 ms of which 302 ms to minimize.
[2026-05-26 17:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 13260 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[5]
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-26 17:20:40] [INFO ] Flatten gal took : 588 ms
[2026-05-26 17:20:41] [INFO ] Flatten gal took : 245 ms
[2026-05-26 17:20:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13547533272545873610.gal : 150 ms
[2026-05-26 17:20:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11213085463972752968.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/ReachabilityCardinality13547533272545873610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11213085463972752968.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 101848 ms.

BK_STOP 1779816041352

--------------------
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="PolyORBLF-COL-S06J06T08"
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 PolyORBLF-COL-S06J06T08, 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-177969946400051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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