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.r571-tall-171734910100026.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 CO4-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 97K 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 CO4-PT-06-UpperBounds-00
FORMULA_NAME CO4-PT-06-UpperBounds-01
FORMULA_NAME CO4-PT-06-UpperBounds-02
FORMULA_NAME CO4-PT-06-UpperBounds-03
FORMULA_NAME CO4-PT-06-UpperBounds-04
FORMULA_NAME CO4-PT-06-UpperBounds-05
FORMULA_NAME CO4-PT-06-UpperBounds-06
FORMULA_NAME CO4-PT-06-UpperBounds-07
FORMULA_NAME CO4-PT-06-UpperBounds-08
FORMULA_NAME CO4-PT-06-UpperBounds-09
FORMULA_NAME CO4-PT-06-UpperBounds-10
FORMULA_NAME CO4-PT-06-UpperBounds-11
FORMULA_NAME CO4-PT-06-UpperBounds-12
FORMULA_NAME CO4-PT-06-UpperBounds-13
FORMULA_NAME CO4-PT-06-UpperBounds-14
FORMULA_NAME CO4-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368602993

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=CO4-PT-06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:50:04] [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 22:50:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:04] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-02 22:50:04] [INFO ] Transformed 383 places.
[2024-06-02 22:50:04] [INFO ] Transformed 454 transitions.
[2024-06-02 22:50:04] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:04] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 334 rows 283 cols
[2024-06-02 22:50:04] [INFO ] Computed 6 invariants in 23 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :2
FORMULA CO4-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
[2024-06-02 22:50:05] [INFO ] Invariant cache hit.
[2024-06-02 22:50:05] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:05] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-02 22:50:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:05] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 22:50:05] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 39 ms.
[2024-06-02 22:50:05] [INFO ] Added : 41 causal constraints over 9 iterations in 280 ms. Result :sat
Minimization took 32 ms.
[2024-06-02 22:50:05] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:06] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 22:50:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:06] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:50:06] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 22:50:06] [INFO ] Added : 53 causal constraints over 11 iterations in 234 ms. Result :sat
Minimization took 35 ms.
[2024-06-02 22:50:06] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 22:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:06] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 22:50:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:06] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-02 22:50:06] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 22:50:06] [INFO ] Added : 41 causal constraints over 9 iterations in 195 ms. Result :sat
Minimization took 29 ms.
[2024-06-02 22:50:07] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 22:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:07] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-02 22:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:07] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 22:50:07] [INFO ] Deduced a trap composed of 166 places in 87 ms of which 4 ms to minimize.
[2024-06-02 22:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-06-02 22:50:07] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 26 ms.
[2024-06-02 22:50:07] [INFO ] Added : 64 causal constraints over 13 iterations in 303 ms. Result :sat
Minimization took 39 ms.
[2024-06-02 22:50:07] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:07] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 22:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:08] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 22:50:08] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2024-06-02 22:50:08] [INFO ] Added : 57 causal constraints over 12 iterations in 227 ms. Result :sat
Minimization took 36 ms.
[2024-06-02 22:50:08] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:08] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-02 22:50:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:08] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 22:50:08] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2024-06-02 22:50:08] [INFO ] Added : 42 causal constraints over 9 iterations in 173 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 283 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 333/333 transitions.
Graph (trivial) has 287 edges and 283 vertex of which 2 / 283 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 425 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 251 transition count 169
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 137 rules applied. Total rules applied 284 place count 123 transition count 160
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 9 rules applied. Total rules applied 293 place count 119 transition count 155
Reduce places removed 1 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 3 with 3 rules applied. Total rules applied 296 place count 118 transition count 153
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 299 place count 117 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 116 transition count 150
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 301 place count 116 transition count 147
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 3 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 309 place count 111 transition count 144
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 327 place count 93 transition count 126
Iterating global reduction 6 with 18 rules applied. Total rules applied 345 place count 93 transition count 126
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 345 place count 93 transition count 120
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 357 place count 87 transition count 120
Graph (complete) has 157 edges and 87 vertex of which 85 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 358 place count 85 transition count 119
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 3 rules applied. Total rules applied 361 place count 85 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 362 place count 84 transition count 116
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 372 place count 74 transition count 106
Iterating global reduction 9 with 10 rules applied. Total rules applied 382 place count 74 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 383 place count 74 transition count 105
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 384 place count 73 transition count 104
Iterating global reduction 10 with 1 rules applied. Total rules applied 385 place count 73 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 386 place count 73 transition count 103
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 446 place count 43 transition count 69
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 449 place count 43 transition count 66
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 452 place count 40 transition count 63
Iterating global reduction 12 with 3 rules applied. Total rules applied 455 place count 40 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 456 place count 40 transition count 62
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 13 with 4 rules applied. Total rules applied 460 place count 38 transition count 60
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 462 place count 38 transition count 58
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 464 place count 36 transition count 56
Iterating global reduction 14 with 2 rules applied. Total rules applied 466 place count 36 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 467 place count 36 transition count 55
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 468 place count 35 transition count 54
Iterating global reduction 15 with 1 rules applied. Total rules applied 469 place count 35 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 470 place count 35 transition count 53
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 16 with 18 rules applied. Total rules applied 488 place count 26 transition count 54
Drop transitions removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 505 place count 26 transition count 37
Discarding 8 places :
Symmetric choice reduction at 17 with 8 rule applications. Total rules 513 place count 18 transition count 29
Iterating global reduction 17 with 8 rules applied. Total rules applied 521 place count 18 transition count 29
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 529 place count 18 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 530 place count 18 transition count 20
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 531 place count 17 transition count 19
Iterating global reduction 18 with 1 rules applied. Total rules applied 532 place count 17 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 533 place count 17 transition count 18
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 537 place count 17 transition count 14
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 26 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 6 rules applied. Total rules applied 543 place count 12 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 544 place count 12 transition count 12
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 546 place count 12 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 22 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 2 rules applied. Total rules applied 548 place count 11 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 549 place count 11 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 550 place count 10 transition count 9
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t86.t400 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 552 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 6 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 24 with 3 rules applied. Total rules applied 555 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 5 rules applied. Total rules applied 560 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 560 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 562 place count 2 transition count 1
Applied a total of 562 rules in 59 ms. Remains 2 /283 variables (removed 281) and now considering 1/333 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 2/283 places, 1/333 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-02 22:50:08] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 1) seen :1
FORMULA CO4-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4656 ms.

BK_STOP 1717368610562

--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r571-tall-171734910100026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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