Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600020.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 90K 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 MedleyA-PT-08-UpperBounds-00
FORMULA_NAME MedleyA-PT-08-UpperBounds-01
FORMULA_NAME MedleyA-PT-08-UpperBounds-02
FORMULA_NAME MedleyA-PT-08-UpperBounds-03
FORMULA_NAME MedleyA-PT-08-UpperBounds-04
FORMULA_NAME MedleyA-PT-08-UpperBounds-05
FORMULA_NAME MedleyA-PT-08-UpperBounds-06
FORMULA_NAME MedleyA-PT-08-UpperBounds-07
FORMULA_NAME MedleyA-PT-08-UpperBounds-08
FORMULA_NAME MedleyA-PT-08-UpperBounds-09
FORMULA_NAME MedleyA-PT-08-UpperBounds-10
FORMULA_NAME MedleyA-PT-08-UpperBounds-11
FORMULA_NAME MedleyA-PT-08-UpperBounds-12
FORMULA_NAME MedleyA-PT-08-UpperBounds-13
FORMULA_NAME MedleyA-PT-08-UpperBounds-14
FORMULA_NAME MedleyA-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942855562

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:17] [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-28 04:34:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:17] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2026-05-28 04:34:17] [INFO ] Transformed 147 places.
[2026-05-28 04:34:17] [INFO ] Transformed 312 transitions.
[2026-05-28 04:34:17] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:17] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 312 rows 147 cols
[2026-05-28 04:34:17] [INFO ] Computed 11 invariants in 15 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (495 resets) in 90 ms. (109 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (929 resets) in 138 ms. (503 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-28 04:34:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:18] [INFO ] [Real]Absence check using 6 positive place invariants in 47 ms returned sat
[2026-05-28 04:34:18] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2026-05-28 04:34:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 34 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:20] [INFO ] Deduced a trap composed of 25 places in 1303 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:21] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 10 ms to minimize.
[2026-05-28 04:34:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1519 ms
[2026-05-28 04:34:21] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:22] [INFO ] Deduced a trap composed of 25 places in 605 ms of which 17 ms to minimize.
[2026-05-28 04:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 655 ms
[2026-05-28 04:34:22] [INFO ] Added : 78 causal constraints over 16 iterations in 1103 ms. Result :sat
Minimization took 168 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-28 04:34:22] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 59 ms.
[2026-05-28 04:34:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-28 04:34:23] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:23] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 20 ms to minimize.
[2026-05-28 04:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2026-05-28 04:34:23] [INFO ] Added : 74 causal constraints over 15 iterations in 834 ms. Result :sat
Minimization took 176 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:24] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 23 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2026-05-28 04:34:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-28 04:34:24] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:25] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 9 ms to minimize.
[2026-05-28 04:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2026-05-28 04:34:25] [INFO ] Added : 75 causal constraints over 16 iterations in 693 ms. Result :sat
Minimization took 195 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:25] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2026-05-28 04:34:25] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 43 ms.
[2026-05-28 04:34: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-28 04:34:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 13 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2026-05-28 04:34:26] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:26] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:26] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 42 ms to minimize.
[2026-05-28 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2026-05-28 04:34:26] [INFO ] Added : 77 causal constraints over 16 iterations in 827 ms. Result :sat
Minimization took 218 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 4 ms to minimize.
[2026-05-28 04:34: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-28 04:34:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 19 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 6 ms to minimize.
[2026-05-28 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2026-05-28 04:34:27] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 27 ms.
[2026-05-28 04:34:28] [INFO ] Added : 79 causal constraints over 16 iterations in 737 ms. Result :sat
Minimization took 203 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:28] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:28] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:28] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2026-05-28 04:34: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-28 04:34:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:29] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:29] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2026-05-28 04:34:29] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 20 ms.
[2026-05-28 04:34:30] [INFO ] Added : 87 causal constraints over 18 iterations in 716 ms. Result :sat
Minimization took 198 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:30] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-28 04:34: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-28 04:34:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-28 04:34:30] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 18 ms to minimize.
[2026-05-28 04:34:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 620 ms
[2026-05-28 04:34:31] [INFO ] Added : 71 causal constraints over 15 iterations in 1092 ms. Result :sat
Minimization took 198 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]
FORMULA MedleyA-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 140 transition count 275
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 63 place count 117 transition count 270
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 63 place count 117 transition count 267
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 114 transition count 267
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 97 place count 86 transition count 232
Iterating global reduction 2 with 28 rules applied. Total rules applied 125 place count 86 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 125 place count 86 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 84 transition count 230
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 138 place count 75 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 147 place count 75 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 73 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 73 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 72 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 72 transition count 203
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 181 place count 58 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 58 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 56 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 56 transition count 185
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 199 place count 50 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 3 with 35 rules applied. Total rules applied 234 place count 50 transition count 180
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 238 place count 48 transition count 203
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 48 transition count 198
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 248 place count 43 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 251 place count 43 transition count 195
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 43 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 41 transition count 193
Applied a total of 255 rules in 99 ms. Remains 41 /147 variables (removed 106) and now considering 193/312 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 41/147 places, 193/312 transitions.
[2026-05-28 04:34:32] [INFO ] Flow matrix only has 170 transitions (discarded 23 similar events)
// Phase 1: matrix 170 rows 41 cols
[2026-05-28 04:34:32] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (18 resets) in 842 ms. (1186 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000000 steps (105 resets) in 1136 ms. (1759 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-28 04:34:34] [INFO ] Flow matrix only has 170 transitions (discarded 23 similar events)
[2026-05-28 04:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 04:34:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 36 ms returned sat
[2026-05-28 04:34:34] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-28 04:34:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 04:34:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-28 04:34:34] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-28 04:34:34] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-28 04:34:34] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2026-05-28 04:34:34] [INFO ] Computed and/alt/rep : 13/73/13 causal constraints (skipped 153 transitions) in 17 ms.
[2026-05-28 04:34:35] [INFO ] Added : 1 causal constraints over 1 iterations in 118 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-28 04:34:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Nat]Added 92 Read/Feed constraints in 22 ms returned sat
[2026-05-28 04:34:35] [INFO ] Computed and/alt/rep : 13/73/13 causal constraints (skipped 153 transitions) in 21 ms.
[2026-05-28 04:34:35] [INFO ] Added : 1 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA MedleyA-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 41 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p56) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 191/191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 40 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 39 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 39 transition count 188
Applied a total of 5 rules in 48 ms. Remains 39 /41 variables (removed 2) and now considering 188/191 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 39/41 places, 188/191 transitions.
[2026-05-28 04:34:35] [INFO ] Flow matrix only has 154 transitions (discarded 34 similar events)
// Phase 1: matrix 154 rows 39 cols
[2026-05-28 04:34:35] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (89 resets) in 836 ms. (1194 steps per ms)
BEST_FIRST walk for 1000001 steps (16 resets) in 527 ms. (1893 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:34:37] [INFO ] Flow matrix only has 154 transitions (discarded 34 similar events)
[2026-05-28 04:34:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:37] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 04:34:37] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:37] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-28 04:34:37] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-28 04:34:37] [INFO ] [Real]Added 84 Read/Feed constraints in 32 ms returned sat
[2026-05-28 04:34:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 04:34:37] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:37] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2026-05-28 04:34:37] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2026-05-28 04:34:37] [INFO ] Computed and/alt/rep : 12/76/12 causal constraints (skipped 138 transitions) in 13 ms.
[2026-05-28 04:34:37] [INFO ] Added : 3 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 188/188 transitions.
Applied a total of 0 rules in 9 ms. Remains 39 /39 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 39/39 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 188/188 transitions.
Applied a total of 0 rules in 15 ms. Remains 39 /39 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-28 04:34:37] [INFO ] Flow matrix only has 154 transitions (discarded 34 similar events)
[2026-05-28 04:34:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:37] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-28 04:34:37] [INFO ] Flow matrix only has 154 transitions (discarded 34 similar events)
[2026-05-28 04:34:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:37] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-28 04:34:37] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:34:37] [INFO ] Redundant transitions in 4 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-28 04:34:37] [INFO ] Flow matrix only has 154 transitions (discarded 34 similar events)
[2026-05-28 04:34:37] [INFO ] Invariant cache hit.
[2026-05-28 04:34:37] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/39 variables, 6/9 constraints. Problems are: Problem set: 35 solved, 149 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 154/193 variables, 39/50 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 84/134 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/134 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/134 constraints. Problems are: Problem set: 46 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 134 constraints, problems are : Problem set: 46 solved, 138 unsolved in 8616 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 6/9 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 154/193 variables, 39/50 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 84/134 constraints. Problems are: Problem set: 46 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 138/272 constraints. Problems are: Problem set: 46 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 272 constraints, problems are : Problem set: 46 solved, 138 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 138/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39067ms problems are : Problem set: 46 solved, 138 unsolved
Search for dead transitions found 46 dead transitions in 39077ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 39/39 places, 142/188 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 36 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 36 transition count 139
Applied a total of 20 rules in 13 ms. Remains 36 /39 variables (removed 3) and now considering 139/142 (removed 3) transitions.
// Phase 1: matrix 139 rows 36 cols
[2026-05-28 04:35:16] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:35:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-28 04:35:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:35:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-28 04:35:17] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 36/39 places, 139/188 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39820 ms. Remains : 36/39 places, 139/188 transitions.
[2026-05-28 04:35:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA MedleyA-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (11 resets) in 624 ms. (1600 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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-28 04:35:18] [INFO ] Flatten gal took : 77 ms
[2026-05-28 04:35:18] [INFO ] Flatten gal took : 17 ms
[2026-05-28 04:35:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7490014613798349308.gal : 8 ms
[2026-05-28 04:35:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5768347918860126634.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/ReachabilityCardinality7490014613798349308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5768347918860126634.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 60776 ms.

BK_STOP 1779942918378

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="MedleyA-PT-08"
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 MedleyA-PT-08, 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 r191-oct2-177969025600020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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