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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K Mar 8 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 8 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 8 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 8 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Mar 16 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Mar 8 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 8 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 8 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:42 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-S04J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779815000073

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:03:22] [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:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:03:22] [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:03:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:03:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1608 ms
[2026-05-26 17:03:24] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 59 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2026-05-26 17:03:24] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 13 ms.
[2026-05-26 17:03:24] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:03:24] [INFO ] Computed 26 invariants in 21 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 5, 0, 0, 0, 0, 4, 1, 0, 1, 0, 0, 0, 0] Max Struct:[8, 8, 1, 5, 4, 2, 1, 1, 4, 1, 5, 1, 4, 30, 8, 8]
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:03:24] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:03:24] [INFO ] Computed 26 invariants in 12 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:25] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2026-05-26 17:03:25] [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:03:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-26 17:03:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:03:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:03:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 15 ms.
[2026-05-26 17:03:25] [INFO ] Added : 57 causal constraints over 12 iterations in 269 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:25] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-26 17:03:25] [INFO ] [Real]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:03:25] [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:03:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:03:26] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:26] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:26] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 5 ms to minimize.
[2026-05-26 17:03:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2026-05-26 17:03:26] [INFO ] Added : 38 causal constraints over 9 iterations in 398 ms. Result :sat
Minimization took 88 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:26] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:03: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 17:03:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:03:26] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:03:27] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:03:27] [INFO ] Added : 8 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:27] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:03:27] [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:03:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 59 ms returned sat
[2026-05-26 17:03:27] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 27 ms.
[2026-05-26 17:03:27] [INFO ] Added : 28 causal constraints over 6 iterations in 190 ms. Result :sat
Minimization took 215 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:27] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-26 17:03:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-26 17:03:28] [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:03:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-26 17:03:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 15 ms.
[2026-05-26 17:03:28] [INFO ] Added : 23 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:28] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:03:28] [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:03:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2026-05-26 17:03:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:03:28] [INFO ] Added : 54 causal constraints over 11 iterations in 236 ms. Result :sat
Minimization took 51 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:28] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:03:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:03:29] [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:03:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 19 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:03:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-26 17:03:29] [INFO ] Added : 7 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:29] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-26 17:03:29] [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:03:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-26 17:03:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:29] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
[2026-05-26 17:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2026-05-26 17:03:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:29] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 7 ms to minimize.
[2026-05-26 17:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2026-05-26 17:03:29] [INFO ] Added : 29 causal constraints over 6 iterations in 204 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:29] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:03: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 17:03:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:03:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-26 17:03:30] [INFO ] Added : 54 causal constraints over 11 iterations in 194 ms. Result :sat
Minimization took 94 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:30] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:03: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 17:03:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:03:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:30] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:30] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 7 ms to minimize.
[2026-05-26 17:03:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2026-05-26 17:03:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-26 17:03:31] [INFO ] Added : 57 causal constraints over 12 iterations in 186 ms. Result :sat
Minimization took 101 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:31] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:03:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:03:31] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:03:31] [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:03:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2026-05-26 17:03:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:03:31] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-26 17:03:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:03:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:31] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:31] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:32] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 6 ms to minimize.
[2026-05-26 17:03:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 433 ms
[2026-05-26 17:03:32] [INFO ] Added : 58 causal constraints over 13 iterations in 650 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 4, 2, 1, 1, 5, 4, 30, 8, 8]
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:03:32] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 226 ms.
[2026-05-26 17:03:32] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +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, 0] Max Struct:[8, 8, 4, 2, 1, 1, 5, 4, 30, 8, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 4, 2, 1, 1, 5, 4, 30, 8, 8]
[2026-05-26 17:03:32] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2026-05-26 17:03:32] [INFO ] Computed 54 invariants in 216 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 4, 2, 1, 1, 5, 4, 30, 8, 8]
RANDOM walk for 10000 steps (3 resets) in 208 ms. (47 steps per ms)
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (15 resets) in 319 ms. (218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 7, 1, 1, 4, 1] Max Struct:[8, 8, 5, 4, 30, 8]
[2026-05-26 17:03:33] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2026-05-26 17:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:33] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2026-05-26 17:03:33] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 26 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:33] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2026-05-26 17:03:33] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 35 ms returned sat
[2026-05-26 17:03:35] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2026-05-26 17:03:35] [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:03:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 19 ms returned sat
[2026-05-26 17:03:35] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned sat
[2026-05-26 17:03:37] [INFO ] [Nat]Absence check using state equation in 1679 ms returned sat
[2026-05-26 17:03:37] [INFO ] State equation strengthened by 160 read => feed constraints.
[2026-05-26 17:03:37] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 17:03:37] [INFO ] [Nat]Added 160 Read/Feed constraints in 532 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:39] [INFO ] Deduced a trap composed of 75 places in 1318 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:03:40] [INFO ] Deduced a trap composed of 146 places in 1378 ms of which 276 ms to minimize.
[2026-05-26 17:03:40] [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 1
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:03:40] [INFO ] [Real]Absence check using 16 positive place invariants in 27 ms returned sat
[2026-05-26 17:03:40] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 48 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:41] [INFO ] [Real]Absence check using 16 positive place invariants in 28 ms returned sat
[2026-05-26 17:03:41] [INFO ] [Real]Absence check using 16 positive and 38 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:03:41] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:03:41] [INFO ] [Real]Absence check using 16 positive place invariants in 29 ms returned sat
[2026-05-26 17:03:41] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 46 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 7, 1, 1, 4, 1] Max Struct:[1, 8, 1, 1, 4, 1]
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 8 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 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 76 rules applied. Total rules applied 76 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 556 transition count 1692
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 8 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 468 place count 476 transition count 1612
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 484 place count 476 transition count 1596
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 500 place count 460 transition count 1596
Applied a total of 500 rules in 602 ms. Remains 460 /712 variables (removed 252) and now considering 1596/1844 (removed 248) transitions.
Running 1592 sub problems to find dead transitions.
[2026-05-26 17:03:42] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
// Phase 1: matrix 1564 rows 460 cols
[2026-05-26 17:03:42] [INFO ] Computed 50 invariants in 99 ms
[2026-05-26 17:03:42] [INFO ] State equation strengthened by 160 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 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 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.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 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 10.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
SMT process timed out in 23174ms, After SMT, problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 23221ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23873 ms. Remains : 460/712 places, 1596/1844 transitions.
[2026-05-26 17:04:05] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
[2026-05-26 17:04:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000001 steps (92 resets) in 9575 ms. (104 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 2926 ms. (341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2026-05-26 17:04:17] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
[2026-05-26 17:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:04:18] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2026-05-26 17:04:18] [INFO ] [Real]Absence check using 15 positive and 35 generalized place invariants in 35 ms returned sat
[2026-05-26 17:04:19] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2026-05-26 17:04: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 17:04:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2026-05-26 17:04:19] [INFO ] [Nat]Absence check using 15 positive and 35 generalized place invariants in 34 ms returned sat
[2026-05-26 17:04:20] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2026-05-26 17:04:20] [INFO ] State equation strengthened by 160 read => feed constraints.
[2026-05-26 17:04:21] [INFO ] [Nat]Added 160 Read/Feed constraints in 733 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:22] [INFO ] Deduced a trap composed of 34 places in 917 ms of which 75 ms to minimize.
[2026-05-26 17:04:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1013 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[7]
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-01 7 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 5 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:04:23] [INFO ] Flatten gal took : 441 ms
[2026-05-26 17:04:23] [INFO ] Flatten gal took : 202 ms
[2026-05-26 17:04:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8577249310341311943.gal : 79 ms
[2026-05-26 17:04:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15065201279298921295.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/ReachabilityCardinality8577249310341311943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15065201279298921295.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 61177 ms.

BK_STOP 1779815063601

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

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