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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 332K 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-19-UpperBounds-00
FORMULA_NAME CO4-PT-19-UpperBounds-01
FORMULA_NAME CO4-PT-19-UpperBounds-02
FORMULA_NAME CO4-PT-19-UpperBounds-03
FORMULA_NAME CO4-PT-19-UpperBounds-04
FORMULA_NAME CO4-PT-19-UpperBounds-05
FORMULA_NAME CO4-PT-19-UpperBounds-06
FORMULA_NAME CO4-PT-19-UpperBounds-07
FORMULA_NAME CO4-PT-19-UpperBounds-08
FORMULA_NAME CO4-PT-19-UpperBounds-09
FORMULA_NAME CO4-PT-19-UpperBounds-10
FORMULA_NAME CO4-PT-19-UpperBounds-11
FORMULA_NAME CO4-PT-19-UpperBounds-12
FORMULA_NAME CO4-PT-19-UpperBounds-13
FORMULA_NAME CO4-PT-19-UpperBounds-14
FORMULA_NAME CO4-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602024136

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:47:05] [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:47:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:47:05] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-05-30 10:47:05] [INFO ] Transformed 1174 places.
[2025-05-30 10:47:05] [INFO ] Transformed 1447 transitions.
[2025-05-30 10:47:05] [INFO ] Found NUPN structural information;
[2025-05-30 10:47:05] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-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, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1173 rows 973 cols
[2025-05-30 10:47:05] [INFO ] Computed 12 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (209 resets) in 43 ms. (227 steps per ms)
FORMULA CO4-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (319 resets) in 84 ms. (1058 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:47:05] [INFO ] Invariant cache hit.
[2025-05-30 10:47:06] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2025-05-30 10:47:06] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:06] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-05-30 10:47:06] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 82 ms.
[2025-05-30 10:47:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:07] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-30 10:47:07] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-05-30 10:47:07] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 68 ms.
[2025-05-30 10:47:09] [INFO ] Added : 116 causal constraints over 24 iterations in 1513 ms. Result :sat
Minimization took 608 ms.
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2025-05-30 10:47:10] [INFO ] Deduced a trap composed of 223 places in 160 ms of which 26 ms to minimize.
[2025-05-30 10:47:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-05-30 10:47:11] [INFO ] Deduced a trap composed of 223 places in 162 ms of which 3 ms to minimize.
[2025-05-30 10:47:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2025-05-30 10:47:11] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 58 ms.
[2025-05-30 10:47:13] [INFO ] Added : 186 causal constraints over 38 iterations in 2176 ms. Result :sat
Minimization took 679 ms.
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-05-30 10:47:14] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 65 ms.
[2025-05-30 10:47:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-05-30 10:47:15] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 55 ms.
[2025-05-30 10:47:17] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
[2025-05-30 10:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-05-30 10:47:17] [INFO ] Added : 161 causal constraints over 33 iterations in 2155 ms. Result :sat
Minimization took 615 ms.
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:18] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-05-30 10:47:18] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 63 ms.
[2025-05-30 10:47:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:19] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-05-30 10:47:19] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 58 ms.
[2025-05-30 10:47:21] [INFO ] Added : 165 causal constraints over 33 iterations in 1922 ms. Result :sat
Minimization took 596 ms.
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:22] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-05-30 10:47:22] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 60 ms.
[2025-05-30 10:47:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2025-05-30 10:47:22] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:23] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2025-05-30 10:47:23] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 62 ms.
[2025-05-30 10:47:24] [INFO ] Added : 140 causal constraints over 28 iterations in 1657 ms. Result :sat
Minimization took 672 ms.
[2025-05-30 10:47:25] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:25] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:26] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-05-30 10:47:26] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 61 ms.
[2025-05-30 10:47:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:26] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:26] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-05-30 10:47:26] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 55 ms.
[2025-05-30 10:47:28] [INFO ] Added : 147 causal constraints over 30 iterations in 1630 ms. Result :sat
Minimization took 664 ms.
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2025-05-30 10:47:29] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 57 ms.
[2025-05-30 10:47:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2025-05-30 10:47:30] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 61 ms.
[2025-05-30 10:47:32] [INFO ] Added : 161 causal constraints over 33 iterations in 1895 ms. Result :sat
Minimization took 686 ms.
[2025-05-30 10:47:33] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:33] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:33] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-05-30 10:47:33] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 55 ms.
[2025-05-30 10:47:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:33] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:34] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-05-30 10:47:34] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 69 ms.
[2025-05-30 10:47:35] [INFO ] Added : 119 causal constraints over 24 iterations in 1429 ms. Result :sat
Minimization took 686 ms.
[2025-05-30 10:47:36] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2025-05-30 10:47:36] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:36] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-05-30 10:47:37] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 13 ms to minimize.
[2025-05-30 10:47:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2025-05-30 10:47:37] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:47:37] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-05-30 10:47:37] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 3 ms to minimize.
[2025-05-30 10:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2025-05-30 10:47:37] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 60 ms.
[2025-05-30 10:47:39] [INFO ] Added : 123 causal constraints over 25 iterations in 1438 ms. Result :sat
Minimization took 665 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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Graph (trivial) has 990 edges and 973 vertex of which 3 / 973 are part of one of the 1 SCC in 11 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 1567 edges and 971 vertex of which 913 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.3 ms
Discarding 58 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 622 rules applied. Total rules applied 624 place count 913 transition count 523
Reduce places removed 588 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 617 rules applied. Total rules applied 1241 place count 325 transition count 494
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 33 rules applied. Total rules applied 1274 place count 311 transition count 475
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 12 rules applied. Total rules applied 1286 place count 305 transition count 469
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 1295 place count 302 transition count 463
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 10 rules applied. Total rules applied 1305 place count 299 transition count 456
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1309 place count 295 transition count 456
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1309 place count 295 transition count 454
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1313 place count 293 transition count 454
Discarding 46 places :
Symmetric choice reduction at 7 with 46 rule applications. Total rules 1359 place count 247 transition count 408
Iterating global reduction 7 with 46 rules applied. Total rules applied 1405 place count 247 transition count 408
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1405 place count 247 transition count 394
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1433 place count 233 transition count 394
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 1460 place count 206 transition count 351
Iterating global reduction 7 with 27 rules applied. Total rules applied 1487 place count 206 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1492 place count 206 transition count 346
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1496 place count 202 transition count 341
Iterating global reduction 8 with 4 rules applied. Total rules applied 1500 place count 202 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1504 place count 202 transition count 337
Performed 73 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 9 with 146 rules applied. Total rules applied 1650 place count 129 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1653 place count 129 transition count 251
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 1731 place count 90 transition count 293
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 10 with 59 rules applied. Total rules applied 1790 place count 90 transition count 234
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1813 place count 67 transition count 168
Iterating global reduction 11 with 23 rules applied. Total rules applied 1836 place count 67 transition count 168
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1853 place count 67 transition count 151
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1857 place count 63 transition count 129
Iterating global reduction 12 with 4 rules applied. Total rules applied 1861 place count 63 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1863 place count 63 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1865 place count 62 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1868 place count 62 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 14 with 10 rules applied. Total rules applied 1878 place count 62 transition count 122
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1879 place count 61 transition count 120
Iterating global reduction 14 with 1 rules applied. Total rules applied 1880 place count 61 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1881 place count 61 transition count 119
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 1890 place count 61 transition count 110
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1900 place count 52 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1902 place count 52 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1904 place count 51 transition count 124
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1907 place count 51 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 1914 place count 51 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1915 place count 51 transition count 114
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1918 place count 51 transition count 114
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1919 place count 51 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1920 place count 50 transition count 112
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 t731.t732.t1159.t639.t640.t641 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.
Graph (trivial) has 26 edges and 46 vertex of which 4 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 1923 place count 43 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1930 place count 43 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 1930 place count 43 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1932 place count 42 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 20 with 14 rules applied. Total rules applied 1946 place count 42 transition count 88
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 1948 place count 40 transition count 82
Iterating global reduction 20 with 2 rules applied. Total rules applied 1950 place count 40 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1952 place count 40 transition count 80
Free-agglomeration rule applied 10 times.
Iterating global reduction 21 with 10 rules applied. Total rules applied 1962 place count 40 transition count 70
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 12 rules applied. Total rules applied 1974 place count 30 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 22 with 10 rules applied. Total rules applied 1984 place count 30 transition count 58
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 1986 place count 30 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 1988 place count 28 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 1990 place count 28 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1991 place count 28 transition count 53
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1994 place count 27 transition count 51
Applied a total of 1994 rules in 237 ms. Remains 27 /973 variables (removed 946) and now considering 51/1173 (removed 1122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 27/973 places, 51/1173 transitions.
[2025-05-30 10:47:40] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
// Phase 1: matrix 41 rows 27 cols
[2025-05-30 10:47:40] [INFO ] Computed 6 invariants in 1 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 1000000 steps (2 resets) in 961 ms. (1039 steps per ms)
FORMULA CO4-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 307 ms. (3246 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:47:41] [INFO ] Flatten gal took : 24 ms
[2025-05-30 10:47:41] [INFO ] Flatten gal took : 7 ms
[2025-05-30 10:47:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13359998037047541914.gal : 5 ms
[2025-05-30 10:47:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8827947757147084897.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/ReachabilityCardinality13359998037047541914.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8827947757147084897.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 36341 ms.

BK_STOP 1748602061789

--------------------
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-19"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is CO4-PT-19, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r055-tall-174854041300066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-19.tgz
mv CO4-PT-19 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;