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-174876533100027.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-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 110K 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-15-UpperBounds-00
FORMULA_NAME MedleyA-PT-15-UpperBounds-01
FORMULA_NAME MedleyA-PT-15-UpperBounds-02
FORMULA_NAME MedleyA-PT-15-UpperBounds-03
FORMULA_NAME MedleyA-PT-15-UpperBounds-04
FORMULA_NAME MedleyA-PT-15-UpperBounds-05
FORMULA_NAME MedleyA-PT-15-UpperBounds-06
FORMULA_NAME MedleyA-PT-15-UpperBounds-07
FORMULA_NAME MedleyA-PT-15-UpperBounds-08
FORMULA_NAME MedleyA-PT-15-UpperBounds-09
FORMULA_NAME MedleyA-PT-15-UpperBounds-10
FORMULA_NAME MedleyA-PT-15-UpperBounds-11
FORMULA_NAME MedleyA-PT-15-UpperBounds-12
FORMULA_NAME MedleyA-PT-15-UpperBounds-13
FORMULA_NAME MedleyA-PT-15-UpperBounds-14
FORMULA_NAME MedleyA-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895941979

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:25:44] [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:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:25:44] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2025-06-02 20:25:44] [INFO ] Transformed 192 places.
[2025-06-02 20:25:44] [INFO ] Transformed 475 transitions.
[2025-06-02 20:25:44] [INFO ] Found NUPN structural information;
[2025-06-02 20:25:44] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 27 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 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]
// Phase 1: matrix 473 rows 192 cols
[2025-06-02 20:25:44] [INFO ] Computed 7 invariants in 43 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 (2 resets) in 71 ms. (138 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130007 steps (26 resets) in 233 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-06-02 20:25:45] [INFO ] Invariant cache hit.
[2025-06-02 20:25:45] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:25:45] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 20:25:46] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 17 ms to minimize.
[2025-06-02 20:25:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:25:46] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-06-02 20:25:46] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 4 ms to minimize.
[2025-06-02 20:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2025-06-02 20:25:46] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 66 ms.
[2025-06-02 20:25:49] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2025-06-02 20:25:49] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 4 ms to minimize.
[2025-06-02 20:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2025-06-02 20:25:49] [INFO ] Added : 250 causal constraints over 50 iterations in 2954 ms. Result :sat
Minimization took 264 ms.
[2025-06-02 20:25:50] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:25:50] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-06-02 20:25:50] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2025-06-02 20:25:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:25:50] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-06-02 20:25:51] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 3 ms to minimize.
[2025-06-02 20:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2025-06-02 20:25:51] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 76 ms.
[2025-06-02 20:25:53] [INFO ] Added : 214 causal constraints over 43 iterations in 1915 ms. Result :sat
Minimization took 165 ms.
[2025-06-02 20:25:53] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:25:53] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-06-02 20:25:53] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 15 ms to minimize.
[2025-06-02 20:25:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:25:54] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-06-02 20:25:54] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 4 ms to minimize.
[2025-06-02 20:25:54] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2025-06-02 20:25:54] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2025-06-02 20:25:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
[2025-06-02 20:25:54] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 51 ms.
[2025-06-02 20:25:57] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 9 ms to minimize.
[2025-06-02 20:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2025-06-02 20:25:57] [INFO ] Added : 221 causal constraints over 46 iterations in 2925 ms. Result :sat
Minimization took 367 ms.
[2025-06-02 20:25:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:25:58] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-02 20:25:58] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 5 ms to minimize.
[2025-06-02 20:25:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:25:58] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-02 20:25:58] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2025-06-02 20:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-06-02 20:25:59] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 56 ms.
[2025-06-02 20:26:01] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:26:01] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:26:01] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:26:01] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2025-06-02 20:26:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 747 ms
[2025-06-02 20:26:02] [INFO ] Added : 248 causal constraints over 50 iterations in 3110 ms. Result :sat
Minimization took 502 ms.
[2025-06-02 20:26:02] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:26:02] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-06-02 20:26:02] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:26:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:26:03] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-02 20:26:03] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2025-06-02 20:26:03] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2025-06-02 20:26:03] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 6 ms to minimize.
[2025-06-02 20:26:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2025-06-02 20:26:03] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 103 ms.
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 4 ms to minimize.
[2025-06-02 20:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2025-06-02 20:26:06] [INFO ] Added : 267 causal constraints over 54 iterations in 2292 ms. Result :sat
Minimization took 204 ms.
[2025-06-02 20:26:06] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:06] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-06-02 20:26:06] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 3 ms to minimize.
[2025-06-02 20:26:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:07] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-06-02 20:26:07] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:26:07] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2025-06-02 20:26:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2025-06-02 20:26:07] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 32 ms.
[2025-06-02 20:26:09] [INFO ] Added : 237 causal constraints over 48 iterations in 2239 ms. Result :sat
Minimization took 222 ms.
[2025-06-02 20:26:10] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:26:10] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2025-06-02 20:26:10] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 2 ms to minimize.
[2025-06-02 20:26:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:26:10] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-06-02 20:26:11] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2025-06-02 20:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2025-06-02 20:26:11] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 51 ms.
[2025-06-02 20:26:13] [INFO ] Added : 251 causal constraints over 51 iterations in 2565 ms. Result :sat
Minimization took 227 ms.
[2025-06-02 20:26:13] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 20:26:14] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-06-02 20:26:14] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 3 ms to minimize.
[2025-06-02 20:26:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:26:14] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-02 20:26:14] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 4 ms to minimize.
[2025-06-02 20:26:15] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2025-06-02 20:26:15] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
[2025-06-02 20:26:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 596 ms
[2025-06-02 20:26:15] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 43 ms.
[2025-06-02 20:26:16] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2025-06-02 20:26:17] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2025-06-02 20:26:17] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2025-06-02 20:26:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-06-02 20:26:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 647 ms
[2025-06-02 20:26:17] [INFO ] Added : 230 causal constraints over 48 iterations in 2412 ms. Result :sat
Minimization took 362 ms.
[2025-06-02 20:26:18] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:26:18] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-06-02 20:26:18] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 3 ms to minimize.
[2025-06-02 20:26:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:18] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-06-02 20:26:18] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2025-06-02 20:26:19] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2025-06-02 20:26:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2025-06-02 20:26:19] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 51 ms.
[2025-06-02 20:26:21] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 3 ms to minimize.
[2025-06-02 20:26:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-02 20:26:21] [INFO ] Added : 243 causal constraints over 50 iterations in 2619 ms. Result :sat
Minimization took 303 ms.
[2025-06-02 20:26:22] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:22] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-06-02 20:26:22] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2025-06-02 20:26:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:22] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-06-02 20:26:22] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2025-06-02 20:26:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1197 ms
[2025-06-02 20:26:23] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 49 ms.
[2025-06-02 20:26:26] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2025-06-02 20:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-06-02 20:26:26] [INFO ] Added : 224 causal constraints over 47 iterations in 2478 ms. Result :sat
Minimization took 200 ms.
[2025-06-02 20:26:26] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:26] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-02 20:26:27] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2025-06-02 20:26:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:26:27] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-06-02 20:26:27] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2025-06-02 20:26:27] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2025-06-02 20:26:27] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2025-06-02 20:26:28] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 3 ms to minimize.
[2025-06-02 20:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 791 ms
[2025-06-02 20:26:28] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 56 ms.
[2025-06-02 20:26:30] [INFO ] Added : 219 causal constraints over 44 iterations in 2441 ms. Result :sat
Minimization took 289 ms.
[2025-06-02 20:26:31] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:31] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-02 20:26:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:31] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-06-02 20:26:31] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2025-06-02 20:26:31] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2025-06-02 20:26:32] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:26:32] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 4 ms to minimize.
[2025-06-02 20:26:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 832 ms
[2025-06-02 20:26:32] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 54 ms.
[2025-06-02 20:26:34] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2025-06-02 20:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-06-02 20:26:34] [INFO ] Added : 226 causal constraints over 47 iterations in 2663 ms. Result :sat
Minimization took 311 ms.
[2025-06-02 20:26:35] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:26:35] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-02 20:26:35] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2025-06-02 20:26:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:26:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:26:36] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2025-06-02 20:26:36] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:26:36] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2025-06-02 20:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2025-06-02 20:26:36] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 30 ms.
[2025-06-02 20:26:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-06-02 20:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-02 20:26:38] [INFO ] Added : 272 causal constraints over 55 iterations in 2288 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA MedleyA-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 205 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 186 transition count 437
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 159 transition count 435
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 57 place count 159 transition count 429
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 153 transition count 429
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 109 place count 113 transition count 360
Iterating global reduction 2 with 40 rules applied. Total rules applied 149 place count 113 transition count 360
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 166 place count 113 transition count 343
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 166 place count 113 transition count 335
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 182 place count 105 transition count 335
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 105 transition count 334
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 103 transition count 327
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 103 transition count 327
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 205 place count 94 transition count 318
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -118
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 239 place count 77 transition count 436
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 77 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 292 place count 77 transition count 383
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 296 place count 75 transition count 406
Free-agglomeration rule applied 20 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 316 place count 75 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 353 place count 55 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 355 place count 54 transition count 375
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 360 place count 54 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 7 with 39 rules applied. Total rules applied 399 place count 54 transition count 331
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 54 transition count 346
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 406 place count 53 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 409 place count 53 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 410 place count 52 transition count 337
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 32 edges and 50 vertex of which 8 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 413 place count 46 transition count 337
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 456 place count 46 transition count 294
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 457 place count 45 transition count 284
Iterating global reduction 10 with 1 rules applied. Total rules applied 458 place count 45 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 10 with 78 rules applied. Total rules applied 536 place count 45 transition count 206
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 537 place count 44 transition count 205
Iterating global reduction 10 with 1 rules applied. Total rules applied 538 place count 44 transition count 205
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 542 place count 42 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 546 place count 40 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 574 place count 40 transition count 187
Applied a total of 574 rules in 230 ms. Remains 40 /192 variables (removed 152) and now considering 187/473 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 40/192 places, 187/473 transitions.
[2025-06-02 20:26:40] [INFO ] Flow matrix only has 168 transitions (discarded 19 similar events)
// Phase 1: matrix 168 rows 40 cols
[2025-06-02 20:26:40] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (45 resets) in 1448 ms. (690 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (56 resets) in 1509 ms. (662 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:26:44] [INFO ] Flatten gal took : 95 ms
[2025-06-02 20:26:44] [INFO ] Flatten gal took : 26 ms
[2025-06-02 20:26:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18197485771550910441.gal : 17 ms
[2025-06-02 20:26:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3168173204677637060.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/ReachabilityCardinality18197485771550910441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3168173204677637060.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 59936 ms.

BK_STOP 1748896004261

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

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