Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926500076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-16-UpperBounds-00
FORMULA_NAME MedleyA-PT-16-UpperBounds-01
FORMULA_NAME MedleyA-PT-16-UpperBounds-02
FORMULA_NAME MedleyA-PT-16-UpperBounds-03
FORMULA_NAME MedleyA-PT-16-UpperBounds-04
FORMULA_NAME MedleyA-PT-16-UpperBounds-05
FORMULA_NAME MedleyA-PT-16-UpperBounds-06
FORMULA_NAME MedleyA-PT-16-UpperBounds-07
FORMULA_NAME MedleyA-PT-16-UpperBounds-08
FORMULA_NAME MedleyA-PT-16-UpperBounds-09
FORMULA_NAME MedleyA-PT-16-UpperBounds-10
FORMULA_NAME MedleyA-PT-16-UpperBounds-11
FORMULA_NAME MedleyA-PT-16-UpperBounds-12
FORMULA_NAME MedleyA-PT-16-UpperBounds-13
FORMULA_NAME MedleyA-PT-16-UpperBounds-14
FORMULA_NAME MedleyA-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717362861747

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:14:24] [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]
[2024-06-02 21:14:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:14:24] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-02 21:14:24] [INFO ] Transformed 196 places.
[2024-06-02 21:14:24] [INFO ] Transformed 392 transitions.
[2024-06-02 21:14:24] [INFO ] Found NUPN structural information;
[2024-06-02 21:14:24] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
// Phase 1: matrix 390 rows 196 cols
[2024-06-02 21:14:24] [INFO ] Computed 7 invariants in 33 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :6
FORMULA MedleyA-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :2
FORMULA MedleyA-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
[2024-06-02 21:14:25] [INFO ] Invariant cache hit.
[2024-06-02 21:14:25] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-02 21:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:25] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-06-02 21:14:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:26] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-02 21:14:26] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 6 ms to minimize.
[2024-06-02 21:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-06-02 21:14:26] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 61 ms.
[2024-06-02 21:14:29] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-06-02 21:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-06-02 21:14:29] [INFO ] Added : 306 causal constraints over 62 iterations in 3333 ms. Result :sat
Minimization took 348 ms.
[2024-06-02 21:14:30] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:30] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-02 21:14:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:30] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:14:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:14:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 447 ms
[2024-06-02 21:14:31] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 42 ms.
[2024-06-02 21:14:33] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2024-06-02 21:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-06-02 21:14:34] [INFO ] Added : 302 causal constraints over 61 iterations in 3065 ms. Result :sat
Minimization took 484 ms.
[2024-06-02 21:14:34] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:34] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-06-02 21:14:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:35] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-02 21:14:35] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 1 ms to minimize.
[2024-06-02 21:14:35] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-06-02 21:14:35] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:14:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 543 ms
[2024-06-02 21:14:35] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 42 ms.
[2024-06-02 21:14:38] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2024-06-02 21:14:38] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-06-02 21:14:38] [INFO ] Deduced a trap composed of 121 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:14:39] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:14:39] [INFO ] Deduced a trap composed of 141 places in 101 ms of which 0 ms to minimize.
[2024-06-02 21:14:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 838 ms
[2024-06-02 21:14:39] [INFO ] Added : 323 causal constraints over 65 iterations in 3659 ms. Result :sat
Minimization took 275 ms.
[2024-06-02 21:14:39] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:39] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-02 21:14:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:40] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-06-02 21:14:40] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:14:40] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:14:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2024-06-02 21:14:40] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 34 ms.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-06-02 21:14:43] [INFO ] Added : 312 causal constraints over 63 iterations in 3321 ms. Result :sat
Minimization took 333 ms.
[2024-06-02 21:14:44] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:44] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-02 21:14:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:44] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2024-06-02 21:14:44] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 27 ms.
[2024-06-02 21:14:47] [INFO ] Added : 313 causal constraints over 63 iterations in 2871 ms. Result :sat
Minimization took 1531 ms.
[2024-06-02 21:14:49] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:49] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-06-02 21:14:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:49] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 21:14:49] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:14:49] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-06-02 21:14:49] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-06-02 21:14:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 204 ms
[2024-06-02 21:14:49] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 24 ms.
[2024-06-02 21:14:52] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:14:52] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:14:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2024-06-02 21:14:53] [INFO ] Added : 311 causal constraints over 65 iterations in 3208 ms. Result :sat
Minimization took 334 ms.
[2024-06-02 21:14:53] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:53] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-06-02 21:14:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:53] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 0 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
[2024-06-02 21:14:54] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 31 ms.
[2024-06-02 21:14:56] [INFO ] Added : 308 causal constraints over 62 iterations in 2405 ms. Result :sat
Minimization took 1284 ms.
[2024-06-02 21:14:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:58] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-06-02 21:14:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:14:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:14:58] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 21:14:58] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2024-06-02 21:14:58] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2024-06-02 21:14:58] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-06-02 21:14:58] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2024-06-02 21:14:58] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2024-06-02 21:14:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 571 ms
[2024-06-02 21:14:58] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 27 ms.
[2024-06-02 21:15:01] [INFO ] Added : 288 causal constraints over 59 iterations in 2694 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 221 edges and 196 vertex of which 13 / 196 are part of one of the 3 SCC in 5 ms
Free SCC test removed 10 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 186 transition count 340
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 149 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 148 transition count 338
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 78 place count 148 transition count 334
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 86 place count 144 transition count 334
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 124 place count 106 transition count 271
Iterating global reduction 3 with 38 rules applied. Total rules applied 162 place count 106 transition count 271
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 179 place count 106 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 105 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 180 place count 105 transition count 246
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 196 place count 97 transition count 246
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 197 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 200 place count 94 transition count 236
Iterating global reduction 6 with 3 rules applied. Total rules applied 203 place count 94 transition count 236
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 231 place count 80 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 236 place count 80 transition count 217
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 238 place count 78 transition count 213
Iterating global reduction 7 with 2 rules applied. Total rules applied 240 place count 78 transition count 213
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 280 place count 58 transition count 332
Drop transitions removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 293 place count 58 transition count 319
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 330 place count 58 transition count 282
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 334 place count 56 transition count 308
Free-agglomeration rule applied 15 times with reduction of 4 identical transitions.
Iterating global reduction 8 with 15 rules applied. Total rules applied 349 place count 56 transition count 289
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 35 rules applied. Total rules applied 384 place count 41 transition count 269
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 9 with 39 rules applied. Total rules applied 423 place count 41 transition count 230
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 424 place count 41 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 425 place count 40 transition count 229
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 38 vertex of which 2 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 428 place count 37 transition count 229
Drop transitions removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 438 place count 37 transition count 219
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 11 with 47 rules applied. Total rules applied 485 place count 37 transition count 172
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 486 place count 36 transition count 171
Iterating global reduction 11 with 1 rules applied. Total rules applied 487 place count 36 transition count 171
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 11 with 4 rules applied. Total rules applied 491 place count 34 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 493 place count 33 transition count 175
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 505 place count 33 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 506 place count 33 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 508 place count 32 transition count 161
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 509 place count 32 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 510 place count 32 transition count 160
Applied a total of 510 rules in 184 ms. Remains 32 /196 variables (removed 164) and now considering 160/390 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 32/196 places, 160/390 transitions.
Normalized transition count is 144 out of 160 initially.
// Phase 1: matrix 144 rows 32 cols
[2024-06-02 21:15:03] [INFO ] Computed 5 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 27 resets, run finished after 1389 ms. (steps per millisecond=719 ) properties (out of 2) seen :1
FORMULA MedleyA-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 1) seen :1
FORMULA MedleyA-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 41222 ms.

BK_STOP 1717362906835

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-16, 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 r597-smll-171734926500076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;