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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.2K Mar 8 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 8 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 8 15:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 15:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Mar 16 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 8 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 15:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 8 15:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:43 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-S04J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779815222001

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:07:04] [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:07:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:07:05] [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:07:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:07:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1424 ms
[2026-05-26 17:07:06] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 105 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2026-05-26 17:07:06] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 13 ms.
[2026-05-26 17:07:06] [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:07:06] [INFO ] Computed 26 invariants in 13 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 1, 0, 0, 4, 0, 0, 0, 0, 0, 1, 1, 7, 0, 0, 1] Max Struct:[1, 23, 30, 4, 4, 3, 8, 4, 1, 8, 1, 1, 7, 150, 1, 8]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:07:06] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:07:06] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:07] [INFO ] [Real]Absence check using 11 positive place invariants in 35 ms returned sat
[2026-05-26 17:07:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 141 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:07] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2026-05-26 17:07:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2026-05-26 17:07:07] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-26 17:07:07] [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:07:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-26 17:07:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:07:07] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-26 17:07:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:07:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2026-05-26 17:07:07] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2026-05-26 17:07:08] [INFO ] Added : 54 causal constraints over 11 iterations in 360 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:08] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:07:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:07:08] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-26 17:07:08] [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:07:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:07:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:07:08] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-26 17:07:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:07:08] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 24 ms to minimize.
[2026-05-26 17:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2026-05-26 17:07:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:07:08] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 13 ms to minimize.
[2026-05-26 17:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2026-05-26 17:07:08] [INFO ] Added : 23 causal constraints over 5 iterations in 267 ms. Result :sat
Minimization took 62 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:08] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:07:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:07:09] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-26 17:07:09] [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:07:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:07:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:07:09] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2026-05-26 17:07:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 71 ms returned sat
[2026-05-26 17:07:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-26 17:07:09] [INFO ] Added : 54 causal constraints over 11 iterations in 312 ms. Result :sat
Minimization took 95 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:09] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:07:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:07:09] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:07:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 80 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 16 ms returned sat
[2026-05-26 17:07:10] [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:07:10] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 7 ms to minimize.
[2026-05-26 17:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2026-05-26 17:07:10] [INFO ] Added : 57 causal constraints over 12 iterations in 378 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:10] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Real]Added 8 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:07:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2026-05-26 17:07:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:07:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-26 17:07:11] [INFO ] Added : 8 causal constraints over 2 iterations in 73 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:11] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:07: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:07:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:07:11] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 6 ms to minimize.
[2026-05-26 17:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2026-05-26 17:07:11] [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:07:11] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 13 ms to minimize.
[2026-05-26 17:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2026-05-26 17:07:11] [INFO ] Added : 33 causal constraints over 7 iterations in 239 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:11] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:07:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-26 17:07:12] [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:07:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:07:12] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:07:12] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 6 ms to minimize.
[2026-05-26 17:07:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2026-05-26 17:07:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:07:12] [INFO ] Added : 57 causal constraints over 12 iterations in 199 ms. Result :sat
Minimization took 94 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:07:12] [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:07:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-26 17:07:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:07:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:07:12] [INFO ] Added : 6 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:13] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:07:13] [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:07:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:07:13] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 5 ms to minimize.
[2026-05-26 17:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2026-05-26 17:07:13] [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:07:13] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 9 ms to minimize.
[2026-05-26 17:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-26 17:07:13] [INFO ] Added : 59 causal constraints over 12 iterations in 307 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:13] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:07:13] [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:07:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:07:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:07:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-26 17:07:14] [INFO ] Added : 38 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 30, 4, 3, 8, 4, 1, 8, 150, 1, 8]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-01 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:07:14] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 216 ms.
[2026-05-26 17:07:14] [INFO ] Unfolded 10 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, 1] 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, 1] Max Struct:[30, 4, 3, 8, 4, 1, 8, 150, 1, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[30, 4, 3, 8, 4, 1, 8, 150, 1, 8]
[2026-05-26 17:07:14] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2026-05-26 17:07:14] [INFO ] Computed 58 invariants in 237 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[30, 4, 3, 8, 4, 1, 8, 10, 1, 8]
RANDOM walk for 10000 steps (2 resets) in 204 ms. (48 steps per ms)
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (12 resets) in 346 ms. (144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3, 1, 4] Max Struct:[30, 4, 8, 10]
[2026-05-26 17:07:15] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2026-05-26 17:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:15] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2026-05-26 17:07:15] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 22 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:15] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2026-05-26 17:07:15] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 70 ms returned sat
[2026-05-26 17:07:18] [INFO ] [Real]Absence check using state equation in 2248 ms returned sat
[2026-05-26 17:07:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2026-05-26 17:07:18] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 80 ms returned sat
[2026-05-26 17:07:20] [INFO ] [Nat]Absence check using state equation in 1707 ms returned sat
[2026-05-26 17:07:20] [INFO ] State equation strengthened by 160 read => feed constraints.
[2026-05-26 17:07:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 17:07:21] [INFO ] [Nat]Added 160 Read/Feed constraints in 1025 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:07:21] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2026-05-26 17:07:21] [INFO ] [Real]Absence check using 16 positive and 42 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:07:21] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2026-05-26 17:07:21] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 66 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3, 1, 4] Max Struct:[4, 4, 1, 4]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 32 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 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 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 148 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 9 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 340 place count 620 transition count 1932
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
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 500 place count 540 transition count 1852
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 516 place count 540 transition count 1836
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 532 place count 524 transition count 1836
Applied a total of 532 rules in 693 ms. Remains 524 /792 variables (removed 268) and now considering 1836/2100 (removed 264) transitions.
Running 1832 sub problems to find dead transitions.
[2026-05-26 17:07:22] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 524 cols
[2026-05-26 17:07:22] [INFO ] Computed 54 invariants in 147 ms
[2026-05-26 17:07:22] [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
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
SMT process timed out in 24071ms, After SMT, problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 24129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24877 ms. Remains : 524/792 places, 1836/2100 transitions.
[2026-05-26 17:07:46] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2026-05-26 17:07:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (92 resets) in 9849 ms. (101 steps per ms)
BEST_FIRST walk for 1000001 steps (877 resets) in 4396 ms. (227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2026-05-26 17:08:01] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2026-05-26 17:08:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:08:01] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2026-05-26 17:08:01] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 30 ms returned sat
[2026-05-26 17:08:02] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2026-05-26 17:08:02] [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:08:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 31 ms returned sat
[2026-05-26 17:08:02] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 51 ms returned sat
[2026-05-26 17:08:03] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2026-05-26 17:08:03] [INFO ] State equation strengthened by 160 read => feed constraints.
[2026-05-26 17:08:07] [INFO ] [Nat]Added 160 Read/Feed constraints in 4108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:08] [INFO ] Deduced a trap composed of 50 places in 1063 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:12] [INFO ] Deduced a trap composed of 33 places in 739 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:13] [INFO ] Deduced a trap composed of 101 places in 1500 ms of which 292 ms to minimize.
[2026-05-26 17:08:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 6134 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[3]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-03 3 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:08:14] [INFO ] Flatten gal took : 527 ms
[2026-05-26 17:08:14] [INFO ] Flatten gal took : 267 ms
[2026-05-26 17:08:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6651648704418942935.gal : 122 ms
[2026-05-26 17:08:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3878750277921853457.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/ReachabilityCardinality6651648704418942935.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3878750277921853457.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 70317 ms.

BK_STOP 1779815295112

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

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