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-177969025600019.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-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 18:21 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 82K 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-07-UpperBounds-00
FORMULA_NAME MedleyA-PT-07-UpperBounds-01
FORMULA_NAME MedleyA-PT-07-UpperBounds-02
FORMULA_NAME MedleyA-PT-07-UpperBounds-03
FORMULA_NAME MedleyA-PT-07-UpperBounds-04
FORMULA_NAME MedleyA-PT-07-UpperBounds-05
FORMULA_NAME MedleyA-PT-07-UpperBounds-06
FORMULA_NAME MedleyA-PT-07-UpperBounds-07
FORMULA_NAME MedleyA-PT-07-UpperBounds-08
FORMULA_NAME MedleyA-PT-07-UpperBounds-09
FORMULA_NAME MedleyA-PT-07-UpperBounds-10
FORMULA_NAME MedleyA-PT-07-UpperBounds-11
FORMULA_NAME MedleyA-PT-07-UpperBounds-12
FORMULA_NAME MedleyA-PT-07-UpperBounds-13
FORMULA_NAME MedleyA-PT-07-UpperBounds-14
FORMULA_NAME MedleyA-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942832080

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:33:53] [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:33:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:33:53] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-28 04:33:53] [INFO ] Transformed 145 places.
[2026-05-28 04:33:53] [INFO ] Transformed 287 transitions.
[2026-05-28 04:33:53] [INFO ] Found NUPN structural information;
[2026-05-28 04:33:53] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 285 rows 143 cols
[2026-05-28 04:33:53] [INFO ] Computed 11 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (350 resets) in 62 ms. (158 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (313 resets) in 46 ms. (851 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-28 04:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:54] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 13 ms to minimize.
[2026-05-28 04:33:54] [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:33:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:54] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 13 ms to minimize.
[2026-05-28 04:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2026-05-28 04:33:54] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 25 ms.
[2026-05-28 04:33:55] [INFO ] Added : 93 causal constraints over 19 iterations in 713 ms. Result :sat
Minimization took 141 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 23 ms.
[2026-05-28 04:33:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 21 ms.
[2026-05-28 04:33:56] [INFO ] Added : 94 causal constraints over 19 iterations in 685 ms. Result :sat
Minimization took 128 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 15 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-28 04:33:57] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 21 ms.
[2026-05-28 04:33:57] [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:33:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-28 04:33:57] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:58] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:58] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 6 ms to minimize.
[2026-05-28 04:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2026-05-28 04:33:58] [INFO ] Added : 92 causal constraints over 19 iterations in 917 ms. Result :sat
Minimization took 110 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:58] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 18 ms returned sat
[2026-05-28 04:33:58] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:58] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 3 ms to minimize.
[2026-05-28 04:33:58] [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:33:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 04:33:58] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 12 ms returned sat
[2026-05-28 04:33:58] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:58] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 4 ms to minimize.
[2026-05-28 04:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2026-05-28 04:33:58] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 29 ms.
[2026-05-28 04:33:59] [INFO ] Added : 100 causal constraints over 20 iterations in 620 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA MedleyA-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 285/285 transitions.
Graph (complete) has 445 edges and 143 vertex of which 136 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 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 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 136 transition count 244
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 69 place count 110 transition count 240
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 108 transition count 238
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 73 place count 108 transition count 233
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 83 place count 103 transition count 233
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 113 place count 73 transition count 195
Iterating global reduction 3 with 30 rules applied. Total rules applied 143 place count 73 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 143 place count 73 transition count 193
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 71 transition count 193
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 187 place count 51 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 51 transition count 170
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 197 place count 47 transition count 178
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 206 place count 47 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 47 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 46 transition count 168
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 4 with 4 rules applied. Total rules applied 212 place count 44 transition count 191
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 217 place count 44 transition count 186
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 222 place count 39 transition count 186
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 224 place count 39 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 39 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 228 place count 37 transition count 182
Applied a total of 228 rules in 111 ms. Remains 37 /143 variables (removed 106) and now considering 182/285 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 37/143 places, 182/285 transitions.
[2026-05-28 04:34:00] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
// Phase 1: matrix 147 rows 37 cols
[2026-05-28 04:34:00] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (14 resets) in 805 ms. (1240 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (15 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:34:01] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
[2026-05-28 04:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 04:34:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-28 04:34:01] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-28 04:34:01] [INFO ] [Real]Added 81 Read/Feed constraints in 11 ms returned sat
[2026-05-28 04:34:01] [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:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-28 04:34:01] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-28 04:34:01] [INFO ] [Nat]Added 81 Read/Feed constraints in 8 ms returned sat
[2026-05-28 04:34:01] [INFO ] Computed and/alt/rep : 5/19/5 causal constraints (skipped 138 transitions) in 8 ms.
[2026-05-28 04:34:01] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Minimization took 72 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:[0] Max Struct:[1]
Support contains 1 out of 37 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p32) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 164/164 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 37 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 36 transition count 163
Applied a total of 2 rules in 19 ms. Remains 36 /37 variables (removed 1) and now considering 163/164 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 36/37 places, 163/164 transitions.
[2026-05-28 04:34:01] [INFO ] Flow matrix only has 134 transitions (discarded 29 similar events)
// Phase 1: matrix 134 rows 36 cols
[2026-05-28 04:34:01] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (15 resets) in 726 ms. (1375 steps per ms)
BEST_FIRST walk for 1000000 steps (15 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:34:02] [INFO ] Flow matrix only has 134 transitions (discarded 29 similar events)
[2026-05-28 04:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 04:34:02] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:02] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-28 04:34:02] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-28 04:34:02] [INFO ] [Real]Added 71 Read/Feed constraints in 15 ms returned sat
[2026-05-28 04:34:03] [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:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 04:34:03] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:03] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-28 04:34:03] [INFO ] [Nat]Added 71 Read/Feed constraints in 15 ms returned sat
[2026-05-28 04:34:03] [INFO ] Computed and/alt/rep : 8/50/8 causal constraints (skipped 122 transitions) in 26 ms.
[2026-05-28 04:34:03] [INFO ] Added : 3 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 38 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:[0] Max Struct:[1]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 163/163 transitions.
Applied a total of 0 rules in 15 ms. Remains 36 /36 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 36/36 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 163/163 transitions.
Applied a total of 0 rules in 8 ms. Remains 36 /36 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-28 04:34:03] [INFO ] Flow matrix only has 134 transitions (discarded 29 similar events)
[2026-05-28 04:34:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:03] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-28 04:34:03] [INFO ] Flow matrix only has 134 transitions (discarded 29 similar events)
[2026-05-28 04:34:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-28 04:34:03] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:34:03] [INFO ] Redundant transitions in 2 ms returned []
Running 159 sub problems to find dead transitions.
[2026-05-28 04:34:03] [INFO ] Flow matrix only has 134 transitions (discarded 29 similar events)
[2026-05-28 04:34:03] [INFO ] Invariant cache hit.
[2026-05-28 04:34:03] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
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 TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD137 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
At refinement iteration 2 (OVERLAPS) 1/35 variables, 6/10 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/11 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 134/170 variables, 36/47 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 71/118 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/118 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/118 constraints. Problems are: Problem set: 39 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 118 constraints, problems are : Problem set: 39 solved, 120 unsolved in 5000 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 6/10 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/11 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 134/170 variables, 36/47 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 71/118 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 120/238 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/238 constraints. Problems are: Problem set: 39 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/238 constraints. Problems are: Problem set: 39 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 238 constraints, problems are : Problem set: 39 solved, 120 unsolved in 12865 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 120/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18084ms problems are : Problem set: 39 solved, 120 unsolved
Search for dead transitions found 39 dead transitions in 18102ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 36/36 places, 124/163 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 124
Applied a total of 2 rules in 12 ms. Remains 34 /36 variables (removed 2) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 34 cols
[2026-05-28 04:34:21] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-28 04:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:21] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-28 04:34:21] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 34/36 places, 124/163 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18626 ms. Remains : 34/36 places, 124/163 transitions.
[2026-05-28 04:34:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (53 resets) in 631 ms. (1582 steps per ms)
BEST_FIRST walk for 1000000 steps (63 resets) in 381 ms. (2617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:34:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-28 04:34:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-28 04:34:23] [INFO ] [Real]Added 61 Read/Feed constraints in 18 ms returned sat
[2026-05-28 04:34: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-28 04:34:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Added 61 Read/Feed constraints in 39 ms returned sat
[2026-05-28 04:34:23] [INFO ] Computed and/alt/rep : 10/56/10 causal constraints (skipped 110 transitions) in 8 ms.
[2026-05-28 04:34:23] [INFO ] Added : 2 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 25 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:[0] Max Struct:[1]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 34/34 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2026-05-28 04:34:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-28 04:34:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-28 04:34:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:34:23] [INFO ] Redundant transitions in 2 ms returned []
Running 120 sub problems to find dead transitions.
[2026-05-28 04:34:23] [INFO ] Invariant cache hit.
[2026-05-28 04:34:23] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 124/158 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 61/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 104 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3201 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 124/158 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 61/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 120/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 224 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8261 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11555ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 11556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11731 ms. Remains : 34/34 places, 124/124 transitions.
RANDOM walk for 30134 steps (100 resets) in 398 ms. (75 steps per ms) remains 0/2 properties
[2026-05-28 04:34:35] [INFO ] Flatten gal took : 93 ms
[2026-05-28 04:34:35] [INFO ] Flatten gal took : 12 ms
[2026-05-28 04:34:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14155482661836674568.gal : 9 ms
[2026-05-28 04:34:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17141255422106264171.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/ReachabilityCardinality14155482661836674568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17141255422106264171.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
FORMULA MedleyA-PT-07-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 42110 ms.

BK_STOP 1779942875503

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

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