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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 132K 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 CO4-PT-10-UpperBounds-00
FORMULA_NAME CO4-PT-10-UpperBounds-01
FORMULA_NAME CO4-PT-10-UpperBounds-02
FORMULA_NAME CO4-PT-10-UpperBounds-03
FORMULA_NAME CO4-PT-10-UpperBounds-04
FORMULA_NAME CO4-PT-10-UpperBounds-05
FORMULA_NAME CO4-PT-10-UpperBounds-06
FORMULA_NAME CO4-PT-10-UpperBounds-07
FORMULA_NAME CO4-PT-10-UpperBounds-08
FORMULA_NAME CO4-PT-10-UpperBounds-09
FORMULA_NAME CO4-PT-10-UpperBounds-10
FORMULA_NAME CO4-PT-10-UpperBounds-11
FORMULA_NAME CO4-PT-10-UpperBounds-12
FORMULA_NAME CO4-PT-10-UpperBounds-13
FORMULA_NAME CO4-PT-10-UpperBounds-14
FORMULA_NAME CO4-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601980221

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:21] [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-05-30 10:46:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:21] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-05-30 10:46:21] [INFO ] Transformed 544 places.
[2025-05-30 10:46:21] [INFO ] Transformed 615 transitions.
[2025-05-30 10:46:21] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:21] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 438 rows 387 cols
[2025-05-30 10:46:21] [INFO ] Computed 6 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (28 resets) in 24 ms. (400 steps per ms)
FORMULA CO4-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (134 resets) in 107 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:46:21] [INFO ] Invariant cache hit.
[2025-05-30 10:46:22] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:22] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-05-30 10:46:22] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 33 ms.
[2025-05-30 10:46:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:22] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-05-30 10:46:22] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 25 ms.
[2025-05-30 10:46:23] [INFO ] Added : 57 causal constraints over 12 iterations in 328 ms. Result :sat
Minimization took 195 ms.
[2025-05-30 10:46:23] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:23] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-30 10:46:23] [INFO ] Deduced a trap composed of 233 places in 146 ms of which 25 ms to minimize.
[2025-05-30 10:46:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:23] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-30 10:46:24] [INFO ] Deduced a trap composed of 233 places in 115 ms of which 3 ms to minimize.
[2025-05-30 10:46:24] [INFO ] Deduced a trap composed of 315 places in 121 ms of which 4 ms to minimize.
[2025-05-30 10:46:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2025-05-30 10:46:24] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 28 ms.
[2025-05-30 10:46:24] [INFO ] Added : 26 causal constraints over 6 iterations in 194 ms. Result :sat
Minimization took 120 ms.
[2025-05-30 10:46:24] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2025-05-30 10:46:24] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-30 10:46:24] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2025-05-30 10:46:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:25] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-05-30 10:46:25] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2025-05-30 10:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-05-30 10:46:25] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 27 ms.
[2025-05-30 10:46:25] [INFO ] Added : 69 causal constraints over 14 iterations in 384 ms. Result :sat
Minimization took 125 ms.
[2025-05-30 10:46:25] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:25] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-05-30 10:46:26] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 10:46:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-30 10:46:26] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 26 ms.
[2025-05-30 10:46:26] [INFO ] Deduced a trap composed of 249 places in 107 ms of which 2 ms to minimize.
[2025-05-30 10:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-05-30 10:46:26] [INFO ] Added : 72 causal constraints over 15 iterations in 567 ms. Result :sat
Minimization took 125 ms.
[2025-05-30 10:46:27] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:27] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-05-30 10:46:27] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 10:46:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:27] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-05-30 10:46:27] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 10:46:27] [INFO ] Added : 63 causal constraints over 13 iterations in 356 ms. Result :sat
Minimization took 120 ms.
[2025-05-30 10:46:28] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:28] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-05-30 10:46:28] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 22 ms.
[2025-05-30 10:46:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:28] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-30 10:46:28] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 27 ms.
[2025-05-30 10:46:28] [INFO ] Added : 39 causal constraints over 8 iterations in 230 ms. Result :sat
Minimization took 120 ms.
[2025-05-30 10:46:28] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-05-30 10:46:29] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2025-05-30 10:46:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-05-30 10:46:29] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2025-05-30 10:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-05-30 10:46:29] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 10:46:30] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2025-05-30 10:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-05-30 10:46:30] [INFO ] Added : 86 causal constraints over 18 iterations in 607 ms. Result :sat
Minimization took 146 ms.
[2025-05-30 10:46:30] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:30] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-30 10:46:30] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2025-05-30 10:46:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:30] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-05-30 10:46:30] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2025-05-30 10:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2025-05-30 10:46:30] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 29 ms.
[2025-05-30 10:46:31] [INFO ] Added : 74 causal constraints over 15 iterations in 413 ms. Result :sat
Minimization took 129 ms.
[2025-05-30 10:46:31] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:31] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-05-30 10:46:31] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 24 ms.
[2025-05-30 10:46:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:32] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-05-30 10:46:32] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 30 ms.
[2025-05-30 10:46:32] [INFO ] Added : 46 causal constraints over 10 iterations in 306 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 438/438 transitions.
Graph (trivial) has 389 edges and 387 vertex of which 3 / 387 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 529 edges and 385 vertex of which 351 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.2 ms
Discarding 34 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 244 rules applied. Total rules applied 246 place count 351 transition count 172
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 235 rules applied. Total rules applied 481 place count 125 transition count 163
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 491 place count 121 transition count 157
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 495 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 (Trivial Post-Agglo cleanup.) 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 498 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.
Iterating post reduction 5 with 2 rules applied. Total rules applied 500 place count 117 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 500 place count 117 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 504 place count 115 transition count 150
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 521 place count 98 transition count 133
Iterating global reduction 6 with 17 rules applied. Total rules applied 538 place count 98 transition count 133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 538 place count 98 transition count 128
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 548 place count 93 transition count 128
Graph (complete) has 167 edges and 93 vertex of which 91 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 549 place count 91 transition count 127
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 552 place count 91 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 553 place count 90 transition count 124
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 562 place count 81 transition count 115
Iterating global reduction 9 with 9 rules applied. Total rules applied 571 place count 81 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 572 place count 81 transition count 114
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 573 place count 80 transition count 113
Iterating global reduction 10 with 1 rules applied. Total rules applied 574 place count 80 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 575 place count 80 transition count 112
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 11 with 64 rules applied. Total rules applied 639 place count 48 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 642 place count 48 transition count 73
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 645 place count 45 transition count 70
Iterating global reduction 12 with 3 rules applied. Total rules applied 648 place count 45 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 649 place count 45 transition count 69
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 653 place count 43 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 655 place count 43 transition count 65
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 657 place count 41 transition count 63
Iterating global reduction 14 with 2 rules applied. Total rules applied 659 place count 41 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 660 place count 41 transition count 62
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 661 place count 40 transition count 61
Iterating global reduction 15 with 1 rules applied. Total rules applied 662 place count 40 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 663 place count 40 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 683 place count 30 transition count 61
Drop transitions (Empty/Sink Transition effects.) 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 700 place count 30 transition count 44
Discarding 8 places :
Symmetric choice reduction at 17 with 8 rule applications. Total rules 708 place count 22 transition count 36
Iterating global reduction 17 with 8 rules applied. Total rules applied 716 place count 22 transition count 36
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 724 place count 22 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 725 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 726 place count 21 transition count 26
Iterating global reduction 18 with 1 rules applied. Total rules applied 727 place count 21 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 728 place count 21 transition count 25
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 732 place count 21 transition count 21
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 35 edges and 17 vertex of which 16 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 738 place count 16 transition count 20
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 739 place count 16 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 740 place count 16 transition count 19
Graph (complete) has 32 edges and 16 vertex of which 15 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 1 rules applied. Total rules applied 741 place count 15 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 742 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 743 place count 14 transition count 17
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t130.t131.t558 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 745 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 5 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 3 rules applied. Total rules applied 748 place count 6 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 25 with 8 rules applied. Total rules applied 756 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 756 place count 5 transition count 6
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 758 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 759 place count 4 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 760 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 761 place count 3 transition count 4
Applied a total of 761 rules in 77 ms. Remains 3 /387 variables (removed 384) and now considering 4/438 (removed 434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 3/387 places, 4/438 transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-05-30 10:46:32] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 369 ms. (2702 steps per ms)
FORMULA CO4-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 215 ms. (4629 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-05-30 10:46:33] [INFO ] Flatten gal took : 104 ms
[2025-05-30 10:46:33] [INFO ] Flatten gal took : 1 ms
[2025-05-30 10:46:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality175621456401622117.gal : 3 ms
[2025-05-30 10:46:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3967822878381607815.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/ReachabilityCardinality175621456401622117.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3967822878381607815.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality3967822878381607815.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3,0.010434,3352,2,6,5,20,6,0,19,12,0
Total reachable state count : 3
ITS tools runner thread asked to quit. Dying gracefully.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 12137 ms.

BK_STOP 1748601993651

--------------------
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="CO4-PT-10"
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 CO4-PT-10, 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 r055-tall-174854041300057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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