Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533100023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r139-smll-174876533100023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 160K May 29 14:32 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 1748895847044

Invoking MCC driver with
BK_TOOL=gold2024
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 202405141337
[2025-06-02 20:24:09] [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]
[2025-06-02 20:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:24:09] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-06-02 20:24:09] [INFO ] Transformed 150 places.
[2025-06-02 20:24:09] [INFO ] Transformed 478 transitions.
[2025-06-02 20:24:09] [INFO ] Found NUPN structural information;
[2025-06-02 20:24:09] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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, 1, 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]
FORMULA MedleyA-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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]
[2025-06-02 20:24:09] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2025-06-02 20:24:09] [INFO ] Computed 23 invariants in 19 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 (778 resets) in 97 ms. (102 steps per ms)
FORMULA MedleyA-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-10 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-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (1101 resets) in 208 ms. (382 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:24:10] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
[2025-06-02 20:24:10] [INFO ] Invariant cache hit.
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 17 ms returned sat
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-06-02 20:24:11] [INFO ] State equation strengthened by 171 read => feed constraints.
[2025-06-02 20:24:11] [INFO ] [Real]Added 171 Read/Feed constraints in 55 ms returned sat
[2025-06-02 20:24:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-06-02 20:24:11] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:24:11] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2025-06-02 20:24:11] [INFO ] [Nat]Added 171 Read/Feed constraints in 73 ms returned sat
[2025-06-02 20:24:11] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 112 ms.
[2025-06-02 20:24:12] [INFO ] Added : 14 causal constraints over 3 iterations in 473 ms. Result :sat
Minimization took 245 ms.
[2025-06-02 20:24:12] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-06-02 20:24:12] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:24:12] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2025-06-02 20:24:12] [INFO ] [Real]Added 171 Read/Feed constraints in 42 ms returned sat
[2025-06-02 20:24:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-02 20:24:12] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Nat]Added 171 Read/Feed constraints in 75 ms returned sat
[2025-06-02 20:24:13] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 86 ms.
[2025-06-02 20:24:13] [INFO ] Added : 16 causal constraints over 4 iterations in 335 ms. Result :sat
Minimization took 238 ms.
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:24:14] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-06-02 20:24:14] [INFO ] [Real]Added 171 Read/Feed constraints in 35 ms returned sat
[2025-06-02 20:24:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 20:24:14] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:24:14] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-02 20:24:14] [INFO ] [Nat]Added 171 Read/Feed constraints in 82 ms returned sat
[2025-06-02 20:24:14] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 19 ms to minimize.
[2025-06-02 20:24:14] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 3 ms to minimize.
[2025-06-02 20:24:14] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2025-06-02 20:24:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 427 ms
[2025-06-02 20:24:14] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 59 ms.
[2025-06-02 20:24:15] [INFO ] Added : 15 causal constraints over 3 iterations in 240 ms. Result :sat
Minimization took 157 ms.
[2025-06-02 20:24:15] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Real]Added 171 Read/Feed constraints in 28 ms returned sat
[2025-06-02 20:24:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 9 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Nat]Added 171 Read/Feed constraints in 55 ms returned sat
[2025-06-02 20:24:16] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2025-06-02 20:24:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-02 20:24:16] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 67 ms.
[2025-06-02 20:24:16] [INFO ] Added : 24 causal constraints over 5 iterations in 355 ms. Result :sat
Minimization took 248 ms.
[2025-06-02 20:24:16] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-02 20:24:16] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 15 ms returned sat
[2025-06-02 20:24:16] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-02 20:24:16] [INFO ] [Real]Added 171 Read/Feed constraints in 32 ms returned sat
[2025-06-02 20:24:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-06-02 20:24:17] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 20:24:17] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-02 20:24:17] [INFO ] [Nat]Added 171 Read/Feed constraints in 38 ms returned sat
[2025-06-02 20:24:17] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 39 ms.
[2025-06-02 20:24:17] [INFO ] Added : 35 causal constraints over 7 iterations in 383 ms. Result :sat
Minimization took 150 ms.
[2025-06-02 20:24:17] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-02 20:24:17] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:24:18] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-02 20:24:18] [INFO ] [Real]Added 171 Read/Feed constraints in 37 ms returned sat
[2025-06-02 20:24:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 20:24:18] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 17 ms returned sat
[2025-06-02 20:24:18] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-06-02 20:24:18] [INFO ] [Nat]Added 171 Read/Feed constraints in 144 ms returned sat
[2025-06-02 20:24:18] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2025-06-02 20:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-02 20:24:18] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 46 ms.
[2025-06-02 20:24:19] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2025-06-02 20:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-02 20:24:19] [INFO ] Added : 20 causal constraints over 5 iterations in 477 ms. Result :sat
Minimization took 232 ms.
[2025-06-02 20:24:19] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-02 20:24:19] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 20:24:19] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-02 20:24:19] [INFO ] [Real]Added 171 Read/Feed constraints in 33 ms returned sat
[2025-06-02 20:24:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 20:24:19] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 20:24:19] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-02 20:24:19] [INFO ] [Nat]Added 171 Read/Feed constraints in 46 ms returned sat
[2025-06-02 20:24:19] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 38 ms.
[2025-06-02 20:24:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2025-06-02 20:24:20] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 4 ms to minimize.
[2025-06-02 20:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2025-06-02 20:24:20] [INFO ] Added : 45 causal constraints over 10 iterations in 816 ms. Result :sat
Minimization took 256 ms.
[2025-06-02 20:24:21] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 20:24:21] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 12 ms returned sat
[2025-06-02 20:24:21] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2025-06-02 20:24:21] [INFO ] [Real]Added 171 Read/Feed constraints in 35 ms returned sat
[2025-06-02 20:24:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 20:24:21] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 20:24:21] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-06-02 20:24:21] [INFO ] [Nat]Added 171 Read/Feed constraints in 47 ms returned sat
[2025-06-02 20:24:21] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2025-06-02 20:24:21] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2025-06-02 20:24:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2025-06-02 20:24:21] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 48 ms.
[2025-06-02 20:24:22] [INFO ] Added : 16 causal constraints over 4 iterations in 332 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-11-UpperBounds-08 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.7 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 114 transition count 417
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 114 transition count 417
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 76 place count 105 transition count 369
Iterating global reduction 0 with 9 rules applied. Total rules applied 85 place count 105 transition count 369
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 91 place count 99 transition count 345
Iterating global reduction 0 with 6 rules applied. Total rules applied 97 place count 99 transition count 345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 98 transition count 344
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
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 109 place count 93 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 135 place count 93 transition count 353
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 153 place count 93 transition count 558
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 201 place count 75 transition count 528
Applied a total of 201 rules in 286 ms. Remains 75 /150 variables (removed 75) and now considering 528/469 (removed -59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 75/150 places, 528/469 transitions.
[2025-06-02 20:24:23] [INFO ] Flow matrix only has 456 transitions (discarded 72 similar events)
// Phase 1: matrix 456 rows 75 cols
[2025-06-02 20:24:23] [INFO ] Computed 23 invariants in 15 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 (160360 resets) in 6265 ms. (159 steps per ms)
FORMULA MedleyA-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (34231 resets) in 1500 ms. (666 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 )
[2025-06-02 20:24:31] [INFO ] Flatten gal took : 144 ms
[2025-06-02 20:24:31] [INFO ] Flatten gal took : 80 ms
[2025-06-02 20:24:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8886115742999741587.gal : 37 ms
[2025-06-02 20:24:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5689765412948449940.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8886115742999741587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5689765412948449940.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 22449 ms.

BK_STOP 1748895871848

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r139-smll-174876533100023"
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 ;