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.r143-smll-177955812400020.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 FireWire-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:04 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 86K 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 FireWire-PT-02-UpperBounds-00
FORMULA_NAME FireWire-PT-02-UpperBounds-01
FORMULA_NAME FireWire-PT-02-UpperBounds-02
FORMULA_NAME FireWire-PT-02-UpperBounds-03
FORMULA_NAME FireWire-PT-02-UpperBounds-04
FORMULA_NAME FireWire-PT-02-UpperBounds-05
FORMULA_NAME FireWire-PT-02-UpperBounds-06
FORMULA_NAME FireWire-PT-02-UpperBounds-07
FORMULA_NAME FireWire-PT-02-UpperBounds-08
FORMULA_NAME FireWire-PT-02-UpperBounds-09
FORMULA_NAME FireWire-PT-02-UpperBounds-10
FORMULA_NAME FireWire-PT-02-UpperBounds-11
FORMULA_NAME FireWire-PT-02-UpperBounds-12
FORMULA_NAME FireWire-PT-02-UpperBounds-13
FORMULA_NAME FireWire-PT-02-UpperBounds-14
FORMULA_NAME FireWire-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779625019143

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:17:01] [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-24 12:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:17:02] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2026-05-24 12:17:02] [INFO ] Transformed 108 places.
[2026-05-24 12:17:02] [INFO ] Transformed 355 transitions.
[2026-05-24 12:17:02] [INFO ] Found NUPN structural information;
[2026-05-24 12:17:02] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
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]
[2026-05-24 12:17:02] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
// Phase 1: matrix 269 rows 108 cols
[2026-05-24 12:17:02] [INFO ] Computed 8 invariants in 14 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 (570 resets) in 96 ms. (103 steps per ms)
FORMULA FireWire-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (629 resets) in 195 ms. (255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-24 12:17:02] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
[2026-05-24 12:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:03] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-24 12:17:03] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-24 12:17:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:17:03] [INFO ] [Real]Added 40 Read/Feed constraints in 47 ms returned sat
[2026-05-24 12:17:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-24 12:17:04] [INFO ] [Nat]Absence check using state equation in 898 ms returned sat
[2026-05-24 12:17:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 40 ms returned sat
[2026-05-24 12:17:04] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 95 ms.
[2026-05-24 12:17:05] [INFO ] Added : 25 causal constraints over 6 iterations in 445 ms. Result :sat
Minimization took 126 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:05] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:17:05] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2026-05-24 12:17:05] [INFO ] [Real]Added 40 Read/Feed constraints in 22 ms returned sat
[2026-05-24 12:17:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:17:05] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2026-05-24 12:17:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:06] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 21 ms to minimize.
[2026-05-24 12:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2026-05-24 12:17:06] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 65 ms.
[2026-05-24 12:17:06] [INFO ] Added : 18 causal constraints over 5 iterations in 268 ms. Result :sat
Minimization took 179 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:06] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:17:06] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-24 12:17:06] [INFO ] [Real]Added 40 Read/Feed constraints in 19 ms returned sat
[2026-05-24 12:17:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:17:07] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2026-05-24 12:17:07] [INFO ] [Nat]Added 40 Read/Feed constraints in 45 ms returned sat
[2026-05-24 12:17:07] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 71 ms.
[2026-05-24 12:17:07] [INFO ] Added : 22 causal constraints over 5 iterations in 265 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:17:07] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:17:07] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2026-05-24 12:17:07] [INFO ] [Real]Added 40 Read/Feed constraints in 16 ms returned sat
[2026-05-24 12:17: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-24 12:17:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:17:08] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2026-05-24 12:17:08] [INFO ] [Nat]Added 40 Read/Feed constraints in 35 ms returned sat
[2026-05-24 12:17:08] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 67 ms.
[2026-05-24 12:17:08] [INFO ] Added : 23 causal constraints over 6 iterations in 320 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 4 place count 108 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 107 transition count 296
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 106 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 11 place count 102 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 102 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 102 transition count 284
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 100 transition count 280
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 100 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 97 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 33 place count 97 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 42 place count 97 transition count 271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 97 transition count 273
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 96 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 48 place count 96 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 95 transition count 268
Applied a total of 49 rules in 315 ms. Remains 95 /108 variables (removed 13) and now considering 268/301 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 95/108 places, 268/301 transitions.
[2026-05-24 12:17:09] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
// Phase 1: matrix 239 rows 95 cols
[2026-05-24 12:17:09] [INFO ] Computed 8 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (63956 resets) in 1906 ms. (524 steps per ms)
BEST_FIRST walk for 4000004 steps (65370 resets) in 2332 ms. (1714 steps per ms)
FORMULA FireWire-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:17:13] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:17:13] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-24 12:17:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 12:17:13] [INFO ] [Real]Added 38 Read/Feed constraints in 16 ms returned sat
[2026-05-24 12:17:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 12:17:13] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-24 12:17:13] [INFO ] [Nat]Added 38 Read/Feed constraints in 18 ms returned sat
[2026-05-24 12:17:13] [INFO ] Computed and/alt/rep : 98/354/98 causal constraints (skipped 139 transitions) in 33 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:14] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 10 ms to minimize.
[2026-05-24 12:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-24 12:17:14] [INFO ] Added : 47 causal constraints over 11 iterations in 409 ms. Result :sat
Minimization took 105 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:14] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:17:14] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2026-05-24 12:17:14] [INFO ] [Real]Added 38 Read/Feed constraints in 18 ms returned sat
[2026-05-24 12:17:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:17:14] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2026-05-24 12:17:14] [INFO ] [Nat]Added 38 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:14] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 8 ms to minimize.
[2026-05-24 12:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2026-05-24 12:17:15] [INFO ] Computed and/alt/rep : 98/354/98 causal constraints (skipped 139 transitions) in 47 ms.
[2026-05-24 12:17:15] [INFO ] Added : 10 causal constraints over 3 iterations in 152 ms. Result :sat
Minimization took 119 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:15] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:17:15] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-24 12:17:15] [INFO ] [Real]Added 38 Read/Feed constraints in 13 ms returned sat
[2026-05-24 12:17:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:17:15] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2026-05-24 12:17:15] [INFO ] [Nat]Added 38 Read/Feed constraints in 30 ms returned sat
[2026-05-24 12:17:15] [INFO ] Computed and/alt/rep : 98/354/98 causal constraints (skipped 139 transitions) in 37 ms.
[2026-05-24 12:17:15] [INFO ] Added : 21 causal constraints over 5 iterations in 209 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 268/268 transitions.
Applied a total of 0 rules in 14 ms. Remains 95 /95 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 95/95 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 268/268 transitions.
Applied a total of 0 rules in 13 ms. Remains 95 /95 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2026-05-24 12:17:16] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:17:16] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 12:17:16] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:17:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 12:17:16] [INFO ] Implicit Places using invariants and state equation in 607 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 786 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/95 places, 268/268 transitions.
Applied a total of 0 rules in 14 ms. Remains 94 /94 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 819 ms. Remains : 94/95 places, 268/268 transitions.
[2026-05-24 12:17:16] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
// Phase 1: matrix 239 rows 94 cols
[2026-05-24 12:17:16] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (64055 resets) in 1649 ms. (606 steps per ms)
BEST_FIRST walk for 3000002 steps (48866 resets) in 2269 ms. (1321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:17:20] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-24 12:17:21] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-24 12:17:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 12:17:21] [INFO ] [Real]Added 38 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:17:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-24 12:17:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 12:17:21] [INFO ] [Nat]Added 38 Read/Feed constraints in 29 ms returned sat
[2026-05-24 12:17:21] [INFO ] Computed and/alt/rep : 98/354/98 causal constraints (skipped 139 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:21] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:21] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 9 ms to minimize.
[2026-05-24 12:17:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2026-05-24 12:17:21] [INFO ] Added : 46 causal constraints over 11 iterations in 694 ms. Result :sat
Minimization took 129 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:22] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:17:22] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-24 12:17:22] [INFO ] [Real]Added 38 Read/Feed constraints in 11 ms returned sat
[2026-05-24 12:17:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-24 12:17:22] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-24 12:17:22] [INFO ] [Nat]Added 38 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:22] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 9 ms to minimize.
[2026-05-24 12:17:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2026-05-24 12:17:22] [INFO ] Computed and/alt/rep : 98/354/98 causal constraints (skipped 139 transitions) in 42 ms.
[2026-05-24 12:17:22] [INFO ] Added : 10 causal constraints over 3 iterations in 151 ms. Result :sat
Minimization took 110 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:22] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-24 12:17:23] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-24 12:17:23] [INFO ] [Real]Added 38 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:17:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:17:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:17:23] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-24 12:17:23] [INFO ] [Nat]Added 38 Read/Feed constraints in 36 ms returned sat
[2026-05-24 12:17:23] [INFO ] Computed and/alt/rep : 98/354/98 causal constraints (skipped 139 transitions) in 32 ms.
[2026-05-24 12:17:23] [INFO ] Added : 12 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 268/268 transitions.
Applied a total of 0 rules in 8 ms. Remains 94 /94 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 94/94 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 268/268 transitions.
Applied a total of 0 rules in 8 ms. Remains 94 /94 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2026-05-24 12:17:23] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:17:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 12:17:23] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:17:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 12:17:23] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:17:23] [INFO ] Redundant transitions in 15 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-24 12:17:23] [INFO ] Flow matrix only has 239 transitions (discarded 29 similar events)
[2026-05-24 12:17:23] [INFO ] Invariant cache hit.
[2026-05-24 12:17:23] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:25] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:25] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:25] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:26] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:26] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:26] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:28] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 239/332 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 38/145 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:34] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:38] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:17:40] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 1/333 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/333 variables, and 149 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 239/332 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 266/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 415 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60776 ms. Remains : 94/94 places, 268/268 transitions.
RANDOM walk for 40000 steps (2588 resets) in 1900 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (610 resets) in 356 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (659 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (611 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (689 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
[2026-05-24 12:18:25] [INFO ] Flatten gal took : 223 ms
BEST_FIRST walk for 40003 steps (643 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
[2026-05-24 12:18:25] [INFO ] Flatten gal took : 57 ms
BEST_FIRST walk for 40004 steps (710 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
[2026-05-24 12:18:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10852490979483555199.gal : 35 ms
[2026-05-24 12:18:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality626281974163658274.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10852490979483555199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality626281974163658274.prop' '--nowitness' '--gen-order' 'FOLLOW'

Finished probabilistic random walk after 1822 steps, run visited all 6 properties in 64 ms. (steps per millisecond=28 )
Probabilistic random walk after 1822 steps, saw 1025 distinct states, run finished after 70 ms. (steps per millisecond=26 ) properties seen :6
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 ...328
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-02-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-02-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-02-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 83751 ms.

BK_STOP 1779625105606

--------------------
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="FireWire-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 FireWire-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 r143-smll-177955812400020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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