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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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-11-UpperBounds-00
FORMULA_NAME CO4-PT-11-UpperBounds-01
FORMULA_NAME CO4-PT-11-UpperBounds-02
FORMULA_NAME CO4-PT-11-UpperBounds-03
FORMULA_NAME CO4-PT-11-UpperBounds-04
FORMULA_NAME CO4-PT-11-UpperBounds-05
FORMULA_NAME CO4-PT-11-UpperBounds-06
FORMULA_NAME CO4-PT-11-UpperBounds-07
FORMULA_NAME CO4-PT-11-UpperBounds-08
FORMULA_NAME CO4-PT-11-UpperBounds-09
FORMULA_NAME CO4-PT-11-UpperBounds-10
FORMULA_NAME CO4-PT-11-UpperBounds-11
FORMULA_NAME CO4-PT-11-UpperBounds-12
FORMULA_NAME CO4-PT-11-UpperBounds-13
FORMULA_NAME CO4-PT-11-UpperBounds-14
FORMULA_NAME CO4-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601983126

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46: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]
[2025-05-30 10:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:24] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-05-30 10:46:24] [INFO ] Transformed 545 places.
[2025-05-30 10:46:24] [INFO ] Transformed 617 transitions.
[2025-05-30 10:46:24] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:24] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-15 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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 440 rows 388 cols
[2025-05-30 10:46:24] [INFO ] Computed 6 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (15 resets) in 27 ms. (357 steps per ms)
FORMULA CO4-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (83 resets) in 83 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-30 10:46:24] [INFO ] Invariant cache hit.
[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:25] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-05-30 10:46:25] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 32 ms.
[2025-05-30 10:46:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:25] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-30 10:46:25] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 27 ms.
[2025-05-30 10:46:26] [INFO ] Added : 79 causal constraints over 16 iterations in 454 ms. Result :sat
Minimization took 271 ms.
[2025-05-30 10:46:26] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-05-30 10:46:26] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 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 7 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-05-30 10:46:26] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 ms.
[2025-05-30 10:46:27] [INFO ] Added : 62 causal constraints over 13 iterations in 360 ms. Result :sat
Minimization took 123 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 101 ms returned sat
[2025-05-30 10:46:27] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 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 104 ms returned sat
[2025-05-30 10:46:27] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 28 ms.
[2025-05-30 10:46:28] [INFO ] Deduced a trap composed of 251 places in 135 ms of which 23 ms to minimize.
[2025-05-30 10:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-05-30 10:46:28] [INFO ] Added : 71 causal constraints over 15 iterations in 600 ms. Result :sat
Minimization took 123 ms.
[2025-05-30 10:46:28] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:28] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-05-30 10:46:28] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 49 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 7 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-05-30 10:46:29] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 35 ms.
[2025-05-30 10:46:29] [INFO ] Added : 52 causal constraints over 11 iterations in 300 ms. Result :sat
Minimization took 116 ms.
[2025-05-30 10:46:29] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-05-30 10:46:29] [INFO ] Deduced a trap composed of 257 places in 104 ms of which 3 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:30] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-05-30 10:46:30] [INFO ] Deduced a trap composed of 257 places in 102 ms of which 5 ms to minimize.
[2025-05-30 10:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-05-30 10:46:30] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 24 ms.
[2025-05-30 10:46:30] [INFO ] Added : 66 causal constraints over 14 iterations in 380 ms. Result :sat
Minimization took 122 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 91 ms returned sat
[2025-05-30 10:46:30] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 22 ms.
[2025-05-30 10:46:30] [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:31] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-05-30 10:46:31] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 26 ms.
[2025-05-30 10:46:31] [INFO ] Added : 65 causal constraints over 13 iterations in 326 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 440/440 transitions.
Graph (trivial) has 389 edges and 388 vertex of which 3 / 388 are part of one of the 1 SCC in 4 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 533 edges and 386 vertex of which 352 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 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 352 transition count 175
Reduce places removed 224 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 233 rules applied. Total rules applied 478 place count 128 transition count 166
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 488 place count 124 transition count 160
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 492 place count 122 transition count 158
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 495 place count 121 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 499 place count 120 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 501 place count 118 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 501 place count 118 transition count 152
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 503 place count 117 transition count 152
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 520 place count 100 transition count 135
Iterating global reduction 7 with 17 rules applied. Total rules applied 537 place count 100 transition count 135
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 537 place count 100 transition count 130
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 547 place count 95 transition count 130
Graph (complete) has 171 edges and 95 vertex of which 93 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 7 with 1 rules applied. Total rules applied 548 place count 93 transition count 129
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 8 with 3 rules applied. Total rules applied 551 place count 93 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 552 place count 92 transition count 126
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 562 place count 82 transition count 116
Iterating global reduction 10 with 10 rules applied. Total rules applied 572 place count 82 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 573 place count 82 transition count 115
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 574 place count 81 transition count 114
Iterating global reduction 11 with 1 rules applied. Total rules applied 575 place count 81 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 576 place count 81 transition count 113
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 62 rules applied. Total rules applied 638 place count 50 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 641 place count 50 transition count 75
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 644 place count 47 transition count 72
Iterating global reduction 13 with 3 rules applied. Total rules applied 647 place count 47 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 648 place count 47 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 650 place count 46 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 651 place count 46 transition count 69
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 652 place count 45 transition count 68
Iterating global reduction 15 with 1 rules applied. Total rules applied 653 place count 45 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 654 place count 45 transition count 67
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 676 place count 34 transition count 69
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 693 place count 34 transition count 52
Discarding 8 places :
Symmetric choice reduction at 17 with 8 rule applications. Total rules 701 place count 26 transition count 44
Iterating global reduction 17 with 8 rules applied. Total rules applied 709 place count 26 transition count 44
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 716 place count 26 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 718 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 719 place count 25 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 720 place count 25 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 721 place count 25 transition count 33
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 725 place count 25 transition count 29
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 730 place count 21 transition count 28
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 732 place count 21 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 48 edges and 21 vertex of which 20 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 20 with 2 rules applied. Total rules applied 734 place count 20 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 735 place count 20 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 736 place count 20 transition count 26
Graph (complete) has 45 edges and 20 vertex of which 19 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 22 with 1 rules applied. Total rules applied 737 place count 19 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 738 place count 19 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 739 place count 19 transition count 25
Graph (complete) has 42 edges and 19 vertex of which 18 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 24 with 1 rules applied. Total rules applied 740 place count 18 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 741 place count 18 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 742 place count 17 transition count 23
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 t131.t132.t559 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 26 with 2 rules applied. Total rules applied 744 place count 14 transition count 21
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 4 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
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 27 with 4 rules applied. Total rules applied 748 place count 10 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 28 with 9 rules applied. Total rules applied 757 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 29 with 1 Pre rules applied. Total rules applied 757 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 759 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 29 with 2 rules applied. Total rules applied 761 place count 7 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 29 with 3 rules applied. Total rules applied 764 place count 7 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 767 place count 4 transition count 6
Applied a total of 767 rules in 130 ms. Remains 4 /388 variables (removed 384) and now considering 6/440 (removed 434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 4/388 places, 6/440 transitions.
// Phase 1: matrix 6 rows 4 cols
[2025-05-30 10:46:31] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 411 ms. (2427 steps per ms)
FORMULA CO4-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 235 ms. (4237 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:32] [INFO ] Flatten gal took : 122 ms
[2025-05-30 10:46:32] [INFO ] Flatten gal took : 2 ms
[2025-05-30 10:46:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9069656384735437355.gal : 4 ms
[2025-05-30 10:46:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6780473905346687176.prop : 0 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/ReachabilityCardinality9069656384735437355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6780473905346687176.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 ...328
Loading property file /tmp/ReachabilityCardinality6780473905346687176.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8505 ms.

BK_STOP 1748601992842

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

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