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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 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 160K 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-11-UpperBounds-00
FORMULA_NAME MedleyA-PT-11-UpperBounds-01
FORMULA_NAME MedleyA-PT-11-UpperBounds-02
FORMULA_NAME MedleyA-PT-11-UpperBounds-03
FORMULA_NAME MedleyA-PT-11-UpperBounds-04
FORMULA_NAME MedleyA-PT-11-UpperBounds-05
FORMULA_NAME MedleyA-PT-11-UpperBounds-06
FORMULA_NAME MedleyA-PT-11-UpperBounds-07
FORMULA_NAME MedleyA-PT-11-UpperBounds-08
FORMULA_NAME MedleyA-PT-11-UpperBounds-09
FORMULA_NAME MedleyA-PT-11-UpperBounds-10
FORMULA_NAME MedleyA-PT-11-UpperBounds-11
FORMULA_NAME MedleyA-PT-11-UpperBounds-12
FORMULA_NAME MedleyA-PT-11-UpperBounds-13
FORMULA_NAME MedleyA-PT-11-UpperBounds-14
FORMULA_NAME MedleyA-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942857191

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 04:34:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:18] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-05-28 04:34:18] [INFO ] Transformed 150 places.
[2026-05-28 04:34:18] [INFO ] Transformed 478 transitions.
[2026-05-28 04:34:18] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:18] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 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-28 04:34:18] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2026-05-28 04:34:18] [INFO ] Computed 23 invariants in 10 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 (789 resets) in 86 ms. (114 steps per ms)
FORMULA MedleyA-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (821 resets) in 98 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-28 04:34:19] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
[2026-05-28 04:34:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:19] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-28 04:34:19] [INFO ] State equation strengthened by 171 read => feed constraints.
[2026-05-28 04:34:19] [INFO ] [Real]Added 171 Read/Feed constraints in 22 ms returned sat
[2026-05-28 04:34:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-28 04:34:19] [INFO ] [Nat]Added 171 Read/Feed constraints in 86 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:19] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 14 ms to minimize.
[2026-05-28 04:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2026-05-28 04:34:19] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 69 ms.
[2026-05-28 04:34:20] [INFO ] Added : 16 causal constraints over 4 iterations in 571 ms. Result :sat
Minimization took 154 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Real]Added 171 Read/Feed constraints in 15 ms returned sat
[2026-05-28 04:34:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:21] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-28 04:34:21] [INFO ] [Nat]Added 171 Read/Feed constraints in 39 ms returned sat
[2026-05-28 04:34:21] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 32 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 6 ms to minimize.
[2026-05-28 04:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2026-05-28 04:34:21] [INFO ] Added : 29 causal constraints over 6 iterations in 624 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:21] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2026-05-28 04:34:21] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:21] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-28 04:34:21] [INFO ] [Real]Added 171 Read/Feed constraints in 16 ms returned sat
[2026-05-28 04:34:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Nat]Added 171 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:22] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:22] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 6 ms to minimize.
[2026-05-28 04:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2026-05-28 04:34:22] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 39 ms.
[2026-05-28 04:34:22] [INFO ] Added : 25 causal constraints over 5 iterations in 375 ms. Result :sat
Minimization took 114 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Real]Added 171 Read/Feed constraints in 20 ms returned sat
[2026-05-28 04:34:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Added 171 Read/Feed constraints in 39 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:23] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
[2026-05-28 04:34:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2026-05-28 04:34:23] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 41 ms.
[2026-05-28 04:34:23] [INFO ] Added : 18 causal constraints over 4 iterations in 315 ms. Result :sat
Minimization took 137 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:24] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Real]Added 171 Read/Feed constraints in 18 ms returned sat
[2026-05-28 04:34:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-28 04:34:24] [INFO ] [Nat]Added 171 Read/Feed constraints in 37 ms returned sat
[2026-05-28 04:34:24] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:25] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
[2026-05-28 04:34:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2026-05-28 04:34:25] [INFO ] Added : 24 causal constraints over 6 iterations in 714 ms. Result :sat
Minimization took 108 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:25] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Real]Added 171 Read/Feed constraints in 25 ms returned sat
[2026-05-28 04:34:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-28 04:34:25] [INFO ] [Nat]Added 171 Read/Feed constraints in 32 ms returned sat
[2026-05-28 04:34:25] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 21 ms.
[2026-05-28 04:34:25] [INFO ] Added : 17 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 112 transition count 414
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 112 transition count 414
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 82 place count 101 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 93 place count 101 transition count 354
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 99 place count 95 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 105 place count 95 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 94 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 117 place count 89 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 139 place count 89 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 141 place count 88 transition count 348
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 156 place count 88 transition count 449
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 180 place count 73 transition count 440
Applied a total of 180 rules in 163 ms. Remains 73 /150 variables (removed 77) and now considering 440/469 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 73/150 places, 440/469 transitions.
[2026-05-28 04:34:26] [INFO ] Flow matrix only has 368 transitions (discarded 72 similar events)
// Phase 1: matrix 368 rows 73 cols
[2026-05-28 04:34:26] [INFO ] Computed 23 invariants in 7 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 (191396 resets) in 5177 ms. (193 steps per ms)
FORMULA MedleyA-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (36230 resets) in 1170 ms. (853 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-28 04:34:32] [INFO ] Flatten gal took : 91 ms
[2026-05-28 04:34:33] [INFO ] Flatten gal took : 39 ms
[2026-05-28 04:34:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1772531897882756730.gal : 24 ms
[2026-05-28 04:34:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15239285763285669556.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/ReachabilityCardinality1772531897882756730.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15239285763285669556.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 14557 ms.

BK_STOP 1779942873146

--------------------
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="MedleyA-PT-11"
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-11, 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-177969025600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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