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.r153-tall-174876824700023.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 NoC3x3-PT-2B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824700023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 548K 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 NoC3x3-PT-2B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841356196

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:15:57] [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-06-02 05:15:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:15:57] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-02 05:15:57] [INFO ] Transformed 2003 places.
[2025-06-02 05:15:57] [INFO ] Transformed 2292 transitions.
[2025-06-02 05:15:57] [INFO ] Found NUPN structural information;
[2025-06-02 05:15:57] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2292 rows 2003 cols
[2025-06-02 05:15:57] [INFO ] Computed 66 invariants in 44 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (15 resets) in 67 ms. (147 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 05:15:58] [INFO ] Invariant cache hit.
[2025-06-02 05:15:58] [INFO ] [Real]Absence check using 66 positive place invariants in 56 ms returned sat
[2025-06-02 05:15:59] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2025-06-02 05:16:00] [INFO ] Deduced a trap composed of 58 places in 487 ms of which 61 ms to minimize.
[2025-06-02 05:16:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:00] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2025-06-02 05:16:01] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2025-06-02 05:16:01] [INFO ] Deduced a trap composed of 58 places in 398 ms of which 7 ms to minimize.
[2025-06-02 05:16:02] [INFO ] Deduced a trap composed of 52 places in 369 ms of which 7 ms to minimize.
[2025-06-02 05:16:02] [INFO ] Deduced a trap composed of 94 places in 253 ms of which 5 ms to minimize.
[2025-06-02 05:16:02] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:16:03] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 5 ms to minimize.
[2025-06-02 05:16:03] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 4 ms to minimize.
[2025-06-02 05:16:03] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 4 ms to minimize.
[2025-06-02 05:16:03] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 6 ms to minimize.
[2025-06-02 05:16:04] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 4 ms to minimize.
[2025-06-02 05:16:04] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 4 ms to minimize.
[2025-06-02 05:16:04] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:16:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3386 ms
[2025-06-02 05:16:04] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 131 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-02 05:16:05] [INFO ] [Real]Absence check using 66 positive place invariants in 51 ms returned sat
[2025-06-02 05:16:06] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2025-06-02 05:16:06] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 6 ms to minimize.
[2025-06-02 05:16:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2025-06-02 05:16:07] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2025-06-02 05:16:08] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 7 ms to minimize.
[2025-06-02 05:16:08] [INFO ] Deduced a trap composed of 86 places in 282 ms of which 8 ms to minimize.
[2025-06-02 05:16:08] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 5 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 106 places in 260 ms of which 5 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 5 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 112 places in 260 ms of which 5 ms to minimize.
[2025-06-02 05:16:10] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:16:10] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:16:10] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 4 ms to minimize.
[2025-06-02 05:16:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2849 ms
[2025-06-02 05:16:10] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 120 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2025-06-02 05:16:12] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned sat
[2025-06-02 05:16:12] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2025-06-02 05:16:13] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 7 ms to minimize.
[2025-06-02 05:16:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 56 ms returned sat
[2025-06-02 05:16:14] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2025-06-02 05:16:14] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 6 ms to minimize.
[2025-06-02 05:16:15] [INFO ] Deduced a trap composed of 81 places in 301 ms of which 6 ms to minimize.
[2025-06-02 05:16:15] [INFO ] Deduced a trap composed of 84 places in 289 ms of which 5 ms to minimize.
[2025-06-02 05:16:15] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 6 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 6 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 4 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 4 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2558 ms
[2025-06-02 05:16:17] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 120 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-02 05:16:18] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2025-06-02 05:16:19] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2025-06-02 05:16:20] [INFO ] Deduced a trap composed of 53 places in 470 ms of which 10 ms to minimize.
[2025-06-02 05:16:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:20] [INFO ] [Nat]Absence check using 66 positive place invariants in 54 ms returned sat
[2025-06-02 05:16:21] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2025-06-02 05:16:21] [INFO ] Deduced a trap composed of 53 places in 479 ms of which 8 ms to minimize.
[2025-06-02 05:16:22] [INFO ] Deduced a trap composed of 34 places in 449 ms of which 9 ms to minimize.
[2025-06-02 05:16:22] [INFO ] Deduced a trap composed of 66 places in 361 ms of which 11 ms to minimize.
[2025-06-02 05:16:23] [INFO ] Deduced a trap composed of 71 places in 375 ms of which 7 ms to minimize.
[2025-06-02 05:16:23] [INFO ] Deduced a trap composed of 144 places in 312 ms of which 8 ms to minimize.
[2025-06-02 05:16:23] [INFO ] Deduced a trap composed of 106 places in 288 ms of which 6 ms to minimize.
[2025-06-02 05:16:24] [INFO ] Deduced a trap composed of 110 places in 209 ms of which 5 ms to minimize.
[2025-06-02 05:16:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2959 ms
[2025-06-02 05:16:24] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 107 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1629 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 10 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 413 rules applied. Total rules applied 414 place count 1931 transition count 1816
Reduce places removed 404 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 405 rules applied. Total rules applied 819 place count 1527 transition count 1815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 820 place count 1526 transition count 1815
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 820 place count 1526 transition count 1791
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 868 place count 1502 transition count 1791
Discarding 348 places :
Symmetric choice reduction at 3 with 348 rule applications. Total rules 1216 place count 1154 transition count 1443
Iterating global reduction 3 with 348 rules applied. Total rules applied 1564 place count 1154 transition count 1443
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1564 place count 1154 transition count 1402
Deduced a syphon composed of 41 places in 9 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1646 place count 1113 transition count 1402
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 1777 place count 982 transition count 1231
Iterating global reduction 3 with 131 rules applied. Total rules applied 1908 place count 982 transition count 1231
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 2033 place count 857 transition count 1092
Iterating global reduction 3 with 125 rules applied. Total rules applied 2158 place count 857 transition count 1092
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2207 place count 808 transition count 1006
Iterating global reduction 3 with 49 rules applied. Total rules applied 2256 place count 808 transition count 1006
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 3 with 18 rules applied. Total rules applied 2274 place count 806 transition count 990
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2276 place count 804 transition count 990
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 2311 place count 769 transition count 955
Iterating global reduction 5 with 35 rules applied. Total rules applied 2346 place count 769 transition count 955
Discarding 2 places :
Implicit places reduction removed 2 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 5 with 4 rules applied. Total rules applied 2350 place count 767 transition count 953
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2352 place count 765 transition count 953
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 2375 place count 742 transition count 907
Iterating global reduction 7 with 23 rules applied. Total rules applied 2398 place count 742 transition count 907
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 2421 place count 719 transition count 884
Iterating global reduction 7 with 23 rules applied. Total rules applied 2444 place count 719 transition count 884
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
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 7 with 29 rules applied. Total rules applied 2473 place count 716 transition count 858
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2476 place count 713 transition count 858
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 0 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 9 with 600 rules applied. Total rules applied 3076 place count 413 transition count 558
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 3088 place count 401 transition count 546
Iterating global reduction 9 with 12 rules applied. Total rules applied 3100 place count 401 transition count 546
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3109 place count 392 transition count 528
Iterating global reduction 9 with 9 rules applied. Total rules applied 3118 place count 392 transition count 528
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3120 place count 390 transition count 524
Iterating global reduction 9 with 2 rules applied. Total rules applied 3122 place count 390 transition count 524
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 3152 place count 375 transition count 547
Free-agglomeration rule applied 24 times.
Iterating global reduction 9 with 24 rules applied. Total rules applied 3176 place count 375 transition count 523
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 3207 place count 351 transition count 516
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3208 place count 351 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3209 place count 350 transition count 515
Applied a total of 3209 rules in 704 ms. Remains 350 /2003 variables (removed 1653) and now considering 515/2292 (removed 1777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 715 ms. Remains : 350/2003 places, 515/2292 transitions.
// Phase 1: matrix 515 rows 350 cols
[2025-06-02 05:16:25] [INFO ] Computed 53 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (13889 resets) in 3846 ms. (259 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (793 resets) in 1111 ms. (899 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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-06-02 05:16:31] [INFO ] Flatten gal took : 99 ms
[2025-06-02 05:16:31] [INFO ] Flatten gal took : 53 ms
[2025-06-02 05:16:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4742175471448553393.gal : 25 ms
[2025-06-02 05:16:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11895233631596277895.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/ReachabilityCardinality4742175471448553393.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11895233631596277895.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 34170 ms.

BK_STOP 1748841391632

--------------------
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="NoC3x3-PT-2B"
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 NoC3x3-PT-2B, 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 r153-tall-174876824700023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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