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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 184K 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-19-UpperBounds-00
FORMULA_NAME MedleyA-PT-19-UpperBounds-01
FORMULA_NAME MedleyA-PT-19-UpperBounds-02
FORMULA_NAME MedleyA-PT-19-UpperBounds-03
FORMULA_NAME MedleyA-PT-19-UpperBounds-04
FORMULA_NAME MedleyA-PT-19-UpperBounds-05
FORMULA_NAME MedleyA-PT-19-UpperBounds-06
FORMULA_NAME MedleyA-PT-19-UpperBounds-07
FORMULA_NAME MedleyA-PT-19-UpperBounds-08
FORMULA_NAME MedleyA-PT-19-UpperBounds-09
FORMULA_NAME MedleyA-PT-19-UpperBounds-10
FORMULA_NAME MedleyA-PT-19-UpperBounds-11
FORMULA_NAME MedleyA-PT-19-UpperBounds-12
FORMULA_NAME MedleyA-PT-19-UpperBounds-13
FORMULA_NAME MedleyA-PT-19-UpperBounds-14
FORMULA_NAME MedleyA-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896266085

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:31:08] [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:31:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:31:09] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2025-06-02 20:31:09] [INFO ] Transformed 272 places.
[2025-06-02 20:31:09] [INFO ] Transformed 586 transitions.
[2025-06-02 20:31:09] [INFO ] Found NUPN structural information;
[2025-06-02 20:31:09] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 651 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 3 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 583 rows 269 cols
[2025-06-02 20:31:09] [INFO ] Computed 24 invariants in 46 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 114 ms. (86 steps per ms)
FORMULA MedleyA-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100007 steps (52 resets) in 498 ms. (200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:31:10] [INFO ] Invariant cache hit.
[2025-06-02 20:31:10] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2025-06-02 20:31:10] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:31:11] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2025-06-02 20:31:11] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 169 ms.
[2025-06-02 20:31:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:11] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2025-06-02 20:31:12] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-06-02 20:31:12] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 113 ms.
[2025-06-02 20:31:13] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 23 ms to minimize.
[2025-06-02 20:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2025-06-02 20:31:14] [INFO ] Added : 155 causal constraints over 32 iterations in 2027 ms. Result :sat
Minimization took 522 ms.
[2025-06-02 20:31:14] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:14] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2025-06-02 20:31:15] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2025-06-02 20:31:15] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 72 ms.
[2025-06-02 20:31:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:15] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:31:15] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2025-06-02 20:31:15] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 56 ms.
[2025-06-02 20:31:16] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 3 ms to minimize.
[2025-06-02 20:31:17] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2025-06-02 20:31:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2025-06-02 20:31:17] [INFO ] Added : 145 causal constraints over 29 iterations in 1384 ms. Result :sat
Minimization took 507 ms.
[2025-06-02 20:31:17] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-02 20:31:17] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 5 ms returned sat
[2025-06-02 20:31:17] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-06-02 20:31:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:31:18] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 20:31:18] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-06-02 20:31:18] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 55 ms.
[2025-06-02 20:31:20] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2025-06-02 20:31:20] [INFO ] Added : 146 causal constraints over 30 iterations in 1962 ms. Result :sat
Minimization took 501 ms.
[2025-06-02 20:31:20] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:31:21] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2025-06-02 20:31:21] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 20:31:21] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2025-06-02 20:31:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:31:21] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:31:21] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2025-06-02 20:31:21] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2025-06-02 20:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2025-06-02 20:31:22] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 78 ms.
[2025-06-02 20:31:23] [INFO ] Deduced a trap composed of 61 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:31:23] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:31:23] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2025-06-02 20:31:24] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2025-06-02 20:31:24] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2025-06-02 20:31:24] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2025-06-02 20:31:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1230 ms
[2025-06-02 20:31:24] [INFO ] Added : 134 causal constraints over 28 iterations in 2573 ms. Result :sat
Minimization took 485 ms.
[2025-06-02 20:31:25] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:31:25] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:31:25] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2025-06-02 20:31:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:31:25] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:31:25] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-06-02 20:31:25] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 4 ms to minimize.
[2025-06-02 20:31:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-02 20:31:26] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 69 ms.
[2025-06-02 20:31:27] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2025-06-02 20:31:28] [INFO ] Added : 143 causal constraints over 30 iterations in 1995 ms. Result :sat
Minimization took 502 ms.
[2025-06-02 20:31:28] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:28] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2025-06-02 20:31:28] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-06-02 20:31:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:29] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:31:29] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 20:31:29] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 74 ms.
[2025-06-02 20:31:31] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2025-06-02 20:31:31] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2025-06-02 20:31:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2025-06-02 20:31:31] [INFO ] Added : 143 causal constraints over 29 iterations in 2177 ms. Result :sat
Minimization took 497 ms.
[2025-06-02 20:31:32] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 20:31:32] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:31:32] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2025-06-02 20:31:32] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 61 ms.
[2025-06-02 20:31:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:32] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2025-06-02 20:31:33] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2025-06-02 20:31:33] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 77 ms.
[2025-06-02 20:31:34] [INFO ] Added : 137 causal constraints over 28 iterations in 1374 ms. Result :sat
Minimization took 504 ms.
[2025-06-02 20:31:35] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-02 20:31:35] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:31:35] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-02 20:31:35] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 60 ms.
[2025-06-02 20:31:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-02 20:31:35] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:31:36] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-02 20:31:36] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 69 ms.
[2025-06-02 20:31:37] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:31:38] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:31:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 510 ms
[2025-06-02 20:31:38] [INFO ] Added : 146 causal constraints over 30 iterations in 2031 ms. Result :sat
Minimization took 502 ms.
[2025-06-02 20:31:38] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:31:38] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2025-06-02 20:31:38] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-06-02 20:31:39] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 63 ms.
[2025-06-02 20:31:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:31:39] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:31:39] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2025-06-02 20:31:39] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 78 ms.
[2025-06-02 20:31:41] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2025-06-02 20:31:41] [INFO ] Added : 139 causal constraints over 29 iterations in 1902 ms. Result :sat
Minimization took 487 ms.
[2025-06-02 20:31:42] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:31:42] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2025-06-02 20:31:42] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-02 20:31:42] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2025-06-02 20:31:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:31:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:31:42] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:31:43] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2025-06-02 20:31:43] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2025-06-02 20:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2025-06-02 20:31:43] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 54 ms.
[2025-06-02 20:31:44] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2025-06-02 20:31:45] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2025-06-02 20:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2025-06-02 20:31:45] [INFO ] Added : 150 causal constraints over 32 iterations in 2095 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 1, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 263 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 263 transition count 535
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 94 place count 220 transition count 529
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 217 transition count 527
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 215 transition count 527
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 101 place count 215 transition count 520
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 115 place count 208 transition count 520
Discarding 69 places :
Symmetric choice reduction at 4 with 69 rule applications. Total rules 184 place count 139 transition count 435
Iterating global reduction 4 with 69 rules applied. Total rules applied 253 place count 139 transition count 435
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 253 place count 139 transition count 432
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 259 place count 136 transition count 432
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 319 place count 106 transition count 402
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 323 place count 106 transition count 398
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 337 place count 99 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 5 with 38 rules applied. Total rules applied 375 place count 99 transition count 395
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 381 place count 99 transition count 389
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 387 place count 93 transition count 389
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 402 place count 93 transition count 474
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 433 place count 78 transition count 458
Applied a total of 433 rules in 282 ms. Remains 78 /269 variables (removed 191) and now considering 458/583 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 78/269 places, 458/583 transitions.
[2025-06-02 20:31:46] [INFO ] Flow matrix only has 370 transitions (discarded 88 similar events)
// Phase 1: matrix 370 rows 78 cols
[2025-06-02 20:31:46] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 1, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (146566 resets) in 6359 ms. (157 steps per ms)
FORMULA MedleyA-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (19626 resets) in 1125 ms. (888 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:31:54] [INFO ] Flatten gal took : 144 ms
[2025-06-02 20:31:54] [INFO ] Flatten gal took : 66 ms
[2025-06-02 20:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13564608790169702080.gal : 33 ms
[2025-06-02 20:31:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9502355131477105205.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/ReachabilityCardinality13564608790169702080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9502355131477105205.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 45900 ms.

BK_STOP 1748896314544

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

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