Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r207-tall-177969919700036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
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 r207-tall-177969919700036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.7K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 8 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 8 06:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 548K Mar 3 18:30 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 1779719357957

Invoking MCC driver with
GOLD_TOOL=
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 202505121319
[2026-05-25 14:29:19] [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]
[2026-05-25 14:29:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:29:19] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2026-05-25 14:29:19] [INFO ] Transformed 2003 places.
[2026-05-25 14:29:19] [INFO ] Transformed 2292 transitions.
[2026-05-25 14:29:19] [INFO ] Found NUPN structural information;
[2026-05-25 14:29:19] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 249 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
[2026-05-25 14:29:19] [INFO ] Computed 66 invariants in 47 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 68 ms. (144 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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-08 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-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-25 14:29:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:29:20] [INFO ] [Real]Absence check using 66 positive place invariants in 82 ms returned sat
[2026-05-25 14:29:21] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:21] [INFO ] Deduced a trap composed of 45 places in 448 ms of which 69 ms to minimize.
[2026-05-25 14:29:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:29:22] [INFO ] [Nat]Absence check using 66 positive place invariants in 109 ms returned sat
[2026-05-25 14:29:23] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:23] [INFO ] Deduced a trap composed of 42 places in 423 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:24] [INFO ] Deduced a trap composed of 42 places in 405 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:24] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:24] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:25] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:25] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:25] [INFO ] Deduced a trap composed of 77 places in 247 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:26] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:26] [INFO ] Deduced a trap composed of 93 places in 224 ms of which 40 ms to minimize.
[2026-05-25 14:29:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3436 ms
[2026-05-25 14:29:26] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 123 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:29:27] [INFO ] [Real]Absence check using 66 positive place invariants in 75 ms returned sat
[2026-05-25 14:29:28] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:28] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 37 ms to minimize.
[2026-05-25 14:29:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:29:29] [INFO ] [Nat]Absence check using 66 positive place invariants in 77 ms returned sat
[2026-05-25 14:29:29] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:30] [INFO ] Deduced a trap composed of 28 places in 373 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:30] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:31] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:31] [INFO ] Deduced a trap composed of 66 places in 303 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:31] [INFO ] Deduced a trap composed of 71 places in 262 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:32] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 40 ms to minimize.
[2026-05-25 14:29:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2265 ms
[2026-05-25 14:29:32] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 117 ms.
[2026-05-25 14:29:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:29:34] [INFO ] [Real]Absence check using 66 positive place invariants in 79 ms returned sat
[2026-05-25 14:29:34] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:35] [INFO ] Deduced a trap composed of 28 places in 387 ms of which 35 ms to minimize.
[2026-05-25 14:29:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:29:35] [INFO ] [Nat]Absence check using 66 positive place invariants in 79 ms returned sat
[2026-05-25 14:29:36] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:37] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:37] [INFO ] Deduced a trap composed of 66 places in 358 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:37] [INFO ] Deduced a trap composed of 71 places in 352 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:29:38] [INFO ] Deduced a trap composed of 78 places in 330 ms of which 80 ms to minimize.
[2026-05-25 14:29:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1717 ms
[2026-05-25 14:29:38] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 111 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1631 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 7 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 405 transitions
Trivial Post-agglo rules discarded 405 transitions
Performed 405 trivial Post agglomeration. Transition count delta: 405
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 1931 transition count 1815
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 1 with 405 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 2 with 24 Pre rules applied. Total rules applied 820 place count 1526 transition count 1791
Deduced a syphon composed of 24 places in 9 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 868 place count 1502 transition count 1791
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 1218 place count 1152 transition count 1441
Iterating global reduction 2 with 350 rules applied. Total rules applied 1568 place count 1152 transition count 1441
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 1568 place count 1152 transition count 1400
Deduced a syphon composed of 41 places in 8 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1650 place count 1111 transition count 1400
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 1781 place count 980 transition count 1229
Iterating global reduction 2 with 131 rules applied. Total rules applied 1912 place count 980 transition count 1229
Discarding 125 places :
Symmetric choice reduction at 2 with 125 rule applications. Total rules 2037 place count 855 transition count 1090
Iterating global reduction 2 with 125 rules applied. Total rules applied 2162 place count 855 transition count 1090
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2212 place count 805 transition count 1002
Iterating global reduction 2 with 50 rules applied. Total rules applied 2262 place count 805 transition count 1002
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 2 with 18 rules applied. Total rules applied 2280 place count 803 transition count 986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2282 place count 801 transition count 986
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 2317 place count 766 transition count 951
Iterating global reduction 4 with 35 rules applied. Total rules applied 2352 place count 766 transition count 951
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 4 with 4 rules applied. Total rules applied 2356 place count 764 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2358 place count 762 transition count 949
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2381 place count 739 transition count 903
Iterating global reduction 6 with 23 rules applied. Total rules applied 2404 place count 739 transition count 903
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2427 place count 716 transition count 880
Iterating global reduction 6 with 23 rules applied. Total rules applied 2450 place count 716 transition count 880
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 6 with 29 rules applied. Total rules applied 2479 place count 713 transition count 854
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2482 place count 710 transition count 854
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 8 with 592 rules applied. Total rules applied 3074 place count 414 transition count 558
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 3086 place count 402 transition count 546
Iterating global reduction 8 with 12 rules applied. Total rules applied 3098 place count 402 transition count 546
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3107 place count 393 transition count 528
Iterating global reduction 8 with 9 rules applied. Total rules applied 3116 place count 393 transition count 528
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3118 place count 391 transition count 524
Iterating global reduction 8 with 2 rules applied. Total rules applied 3120 place count 391 transition count 524
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 3154 place count 374 transition count 547
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 3177 place count 374 transition count 524
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 3207 place count 351 transition count 517
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3208 place count 351 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3209 place count 350 transition count 516
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3211 place count 350 transition count 516
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3212 place count 350 transition count 516
Applied a total of 3212 rules in 731 ms. Remains 350 /2003 variables (removed 1653) and now considering 516/2292 (removed 1776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 738 ms. Remains : 350/2003 places, 516/2292 transitions.
// Phase 1: matrix 516 rows 350 cols
[2026-05-25 14:29:41] [INFO ] Computed 53 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (13943 resets) in 4072 ms. (245 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (780 resets) in 1289 ms. (775 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 7 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 )
[2026-05-25 14:29:46] [INFO ] Flatten gal took : 99 ms
[2026-05-25 14:29:46] [INFO ] Flatten gal took : 55 ms
[2026-05-25 14:29:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7378433318701300909.gal : 26 ms
[2026-05-25 14:29:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11750120280942411569.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7378433318701300909.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11750120280942411569.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 27775 ms.

BK_STOP 1779719387059

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="gold2025"
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-5973"
echo " Executing tool gold2025"
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 r207-tall-177969919700036"
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 ;