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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.2K Mar 8 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 8 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 8 06:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 8 06:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 8 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:17 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 3.0M 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-8B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779719475011

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:31:16] [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:31:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:31:16] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2026-05-25 14:31:16] [INFO ] Transformed 9140 places.
[2026-05-25 14:31:16] [INFO ] Transformed 14577 transitions.
[2026-05-25 14:31:16] [INFO ] Found NUPN structural information;
[2026-05-25 14:31:16] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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 14577 rows 9140 cols
[2026-05-25 14:31:17] [INFO ] Computed 99 invariants in 205 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 (4 resets) in 171 ms. (58 steps per ms)
FORMULA NoC3x3-PT-8B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 160 ms. (559 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]
[2026-05-25 14:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:20] [INFO ] [Real]Absence check using 99 positive place invariants in 480 ms returned sat
[2026-05-25 14:31:22] [INFO ] [Real]Absence check using state equation in 2724 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:24] [INFO ] [Real]Absence check using 99 positive place invariants in 455 ms returned sat
[2026-05-25 14:31:27] [INFO ] [Real]Absence check using state equation in 2991 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:29] [INFO ] [Real]Absence check using 99 positive place invariants in 479 ms returned sat
[2026-05-25 14:31:32] [INFO ] [Real]Absence check using state equation in 2937 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:34] [INFO ] [Real]Absence check using 99 positive place invariants in 487 ms returned sat
[2026-05-25 14:31:37] [INFO ] [Real]Absence check using state equation in 3006 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:39] [INFO ] [Real]Absence check using 99 positive place invariants in 493 ms returned sat
[2026-05-25 14:31:42] [INFO ] [Real]Absence check using state equation in 3100 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:44] [INFO ] [Real]Absence check using 99 positive place invariants in 463 ms returned sat
[2026-05-25 14:31:47] [INFO ] [Real]Absence check using state equation in 3050 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:49] [INFO ] [Real]Absence check using 99 positive place invariants in 481 ms returned sat
[2026-05-25 14:31:52] [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: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
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:31:54] [INFO ] [Real]Absence check using 99 positive place invariants in 454 ms returned sat
[2026-05-25 14:31:57] [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: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
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:31:59] [INFO ] [Real]Absence check using 99 positive place invariants in 431 ms returned sat
[2026-05-25 14:32:02] [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: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
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)
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 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13726 edges and 9140 vertex of which 2395 / 9140 are part of one of the 33 SCC in 34 ms
Free SCC test removed 2362 places
Drop transitions (Empty/Sink Transition effects.) removed 3752 transitions
Reduce isomorphic transitions removed 3752 transitions.
Graph (complete) has 12302 edges and 6778 vertex of which 6665 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.16 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4196 transitions
Trivial Post-agglo rules discarded 4196 transitions
Performed 4196 trivial Post agglomeration. Transition count delta: 4196
Iterating post reduction 0 with 4300 rules applied. Total rules applied 4302 place count 6665 transition count 6445
Reduce places removed 4196 places and 0 transitions.
Ensure Unique test removed 2371 transitions
Reduce isomorphic transitions removed 2371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 1 with 7762 rules applied. Total rules applied 12064 place count 2469 transition count 2879
Reduce places removed 1195 places and 0 transitions.
Ensure Unique test removed 1195 transitions
Reduce isomorphic transitions removed 1195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 2428 rules applied. Total rules applied 14492 place count 1274 transition count 1646
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 40 rules applied. Total rules applied 14532 place count 1236 transition count 1644
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 14535 place count 1234 transition count 1643
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 38 Pre rules applied. Total rules applied 14535 place count 1234 transition count 1605
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 14611 place count 1196 transition count 1605
Discarding 359 places :
Symmetric choice reduction at 5 with 359 rule applications. Total rules 14970 place count 837 transition count 1246
Iterating global reduction 5 with 359 rules applied. Total rules applied 15329 place count 837 transition count 1246
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 15385 place count 837 transition count 1190
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 61 Pre rules applied. Total rules applied 15385 place count 837 transition count 1129
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 15507 place count 776 transition count 1129
Discarding 79 places :
Symmetric choice reduction at 6 with 79 rule applications. Total rules 15586 place count 697 transition count 958
Iterating global reduction 6 with 79 rules applied. Total rules applied 15665 place count 697 transition count 958
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 15689 place count 697 transition count 934
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 7 with 478 rules applied. Total rules applied 16167 place count 458 transition count 695
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 16191 place count 458 transition count 671
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 16195 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 16204 place count 456 transition count 684
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 16206 place count 455 transition count 703
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16207 place count 455 transition count 702
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 16213 place count 455 transition count 696
Free-agglomeration rule applied 205 times.
Iterating global reduction 9 with 205 rules applied. Total rules applied 16418 place count 455 transition count 491
Reduce places removed 205 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 803 edges and 250 vertex of which 243 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 218 rules applied. Total rules applied 16636 place count 243 transition count 479
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 16643 place count 243 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 11 with 167 rules applied. Total rules applied 16810 place count 243 transition count 305
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 621 edges and 235 vertex of which 212 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 9 rules applied. Total rules applied 16819 place count 212 transition count 305
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 16842 place count 212 transition count 282
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 13 with 26 rules applied. Total rules applied 16868 place count 212 transition count 282
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 16869 place count 212 transition count 282
Applied a total of 16869 rules in 652 ms. Remains 212 /9140 variables (removed 8928) and now considering 282/14577 (removed 14295) transitions.
Running 273 sub problems to find dead transitions.
// Phase 1: matrix 282 rows 212 cols
[2026-05-25 14:32:03] [INFO ] Computed 58 invariants in 3 ms
[2026-05-25 14:32:03] [INFO ] State equation strengthened by 187 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Problem TDEAD281 is UNSAT
At refinement iteration 3 (OVERLAPS) 282/494 variables, 212/270 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 187/457 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/494 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 457 constraints, problems are : Problem set: 1 solved, 272 unsolved in 14121 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 272 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 282/494 variables, 212/270 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 187/457 constraints. Problems are: Problem set: 1 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 272/729 constraints. Problems are: Problem set: 1 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:32:28] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:32:28] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:32:30] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 3/732 constraints. Problems are: Problem set: 1 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 732 constraints, problems are : Problem set: 1 solved, 272 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 272/273 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 34335ms problems are : Problem set: 1 solved, 272 unsolved
Search for dead transitions found 1 dead transitions in 34345ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 212/9140 places, 281/14577 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35019 ms. Remains : 212/9140 places, 281/14577 transitions.
// Phase 1: matrix 281 rows 212 cols
[2026-05-25 14:32:37] [INFO ] Computed 58 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 3108 ms. (321 steps per ms)
FORMULA NoC3x3-PT-8B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 996 ms. (1003 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 )
[2026-05-25 14:32:42] [INFO ] Flatten gal took : 74 ms
[2026-05-25 14:32:42] [INFO ] Flatten gal took : 32 ms
[2026-05-25 14:32:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8483351542928662125.gal : 15 ms
[2026-05-25 14:32:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6979820799241020790.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/ReachabilityCardinality8483351542928662125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6979820799241020790.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 86101 ms.

BK_STOP 1779719562438

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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-8B"
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-8B, 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-177969919700048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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