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.r047-tall-177946846500058.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 BusinessProcesses-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846500058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779484783121

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 21:19:44] [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-22 21:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:19:44] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-22 21:19:44] [INFO ] Transformed 262 places.
[2026-05-22 21:19:44] [INFO ] Transformed 219 transitions.
[2026-05-22 21:19:44] [INFO ] Found NUPN structural information;
[2026-05-22 21:19:44] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 204 rows 245 cols
[2026-05-22 21:19:44] [INFO ] Computed 43 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (136 resets) in 41 ms. (238 steps per ms)
FORMULA BusinessProcesses-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (184 resets) in 84 ms. (823 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 21:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:45] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2026-05-22 21:19:45] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2026-05-22 21:19:45] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:45] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 13 ms to minimize.
[2026-05-22 21:19:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2026-05-22 21:19:45] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2026-05-22 21:19:45] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:45] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:45] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:45] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 11 ms to minimize.
[2026-05-22 21:19:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 479 ms
[2026-05-22 21:19:46] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2026-05-22 21:19:46] [INFO ] Added : 116 causal constraints over 24 iterations in 492 ms. Result :sat
Minimization took 80 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:46] [INFO ] [Real]Absence check using 30 positive place invariants in 48 ms returned sat
[2026-05-22 21:19:46] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2026-05-22 21:19:46] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:46] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
[2026-05-22 21:19:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-22 21:19:47] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2026-05-22 21:19:47] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:47] [INFO ] Deduced a trap composed of 16 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-22 21:19:47] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:48] [INFO ] Deduced a trap composed of 17 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-22 21:19:48] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:48] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:48] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:48] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 15 ms to minimize.
[2026-05-22 21:19:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1243 ms
[2026-05-22 21:19:48] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 18 ms.
[2026-05-22 21:19:48] [INFO ] Added : 127 causal constraints over 26 iterations in 522 ms. Result :sat
Minimization took 80 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:49] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-22 21:19:49] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-22 21:19:49] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:49] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 6 ms to minimize.
[2026-05-22 21:19:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-22 21:19:49] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-22 21:19:49] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:49] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:49] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:49] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:49] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 10 ms to minimize.
[2026-05-22 21:19:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 383 ms
[2026-05-22 21:19:49] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2026-05-22 21:19:50] [INFO ] Added : 114 causal constraints over 23 iterations in 401 ms. Result :sat
Minimization took 74 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:50] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-22 21:19:50] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2026-05-22 21:19:50] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 5 ms to minimize.
[2026-05-22 21:19:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-22 21:19:50] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2026-05-22 21:19:50] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
[2026-05-22 21:19:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 399 ms
[2026-05-22 21:19:51] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 9 ms.
[2026-05-22 21:19:51] [INFO ] Added : 111 causal constraints over 23 iterations in 403 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:51] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-22 21:19:51] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-22 21:19:51] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 7 ms to minimize.
[2026-05-22 21:19:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-22 21:19:51] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-22 21:19:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 16 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-22 21:19:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:52] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 12 ms to minimize.
[2026-05-22 21:19:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1040 ms
[2026-05-22 21:19:52] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2026-05-22 21:19:53] [INFO ] Added : 110 causal constraints over 22 iterations in 308 ms. Result :sat
Minimization took 80 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:53] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-22 21:19:53] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 13 ms returned sat
[2026-05-22 21:19:53] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:53] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 6 ms to minimize.
[2026-05-22 21:19:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-22 21:19:53] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-22 21:19:53] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:53] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:53] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:53] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:54] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:54] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:54] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:54] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:54] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
[2026-05-22 21:19:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 696 ms
[2026-05-22 21:19:54] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 17 ms.
[2026-05-22 21:19:54] [INFO ] Added : 115 causal constraints over 24 iterations in 430 ms. Result :sat
Minimization took 77 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:55] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-22 21:19:55] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-22 21:19:55] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
[2026-05-22 21:19:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:19:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2026-05-22 21:19:55] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2026-05-22 21:19:55] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
[2026-05-22 21:19:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 338 ms
[2026-05-22 21:19:55] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2026-05-22 21:19:56] [INFO ] Added : 121 causal constraints over 25 iterations in 414 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 138 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 227 transition count 139
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 177 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 176 transition count 138
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 105 place count 176 transition count 103
Deduced a syphon composed of 35 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 75 rules applied. Total rules applied 180 place count 136 transition count 103
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 208 place count 108 transition count 75
Iterating global reduction 3 with 28 rules applied. Total rules applied 236 place count 108 transition count 75
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 316 place count 67 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 67 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 318 place count 66 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 66 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 65 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 321 place count 64 transition count 34
Applied a total of 321 rules in 64 ms. Remains 64 /245 variables (removed 181) and now considering 34/204 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 64/245 places, 34/204 transitions.
// Phase 1: matrix 34 rows 64 cols
[2026-05-22 21:19:56] [INFO ] Computed 30 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (43983 resets) in 1107 ms. (902 steps per ms)
FORMULA BusinessProcesses-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (27873 resets) in 801 ms. (1246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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-22 21:19:58] [INFO ] Flatten gal took : 26 ms
[2026-05-22 21:19:58] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:19:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3214390766045166263.gal : 5 ms
[2026-05-22 21:19:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13378028186941587598.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/ReachabilityCardinality3214390766045166263.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13378028186941587598.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13378028186941587598.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3,0.016153,4188,2,85,5,183,6,0,289,78,0
Total reachable state count : 3

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 14261 ms.

BK_STOP 1779484798741

--------------------
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="BusinessProcesses-PT-02"
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 BusinessProcesses-PT-02, 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 r047-tall-177946846500058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 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 ;