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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.1K Mar 8 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 8 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 8 06:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 8 06:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 16 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 8 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 8 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 8 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:16 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 2.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-7B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779719468045

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:31:09] [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:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:31:09] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2026-05-25 14:31:09] [INFO ] Transformed 7014 places.
[2026-05-25 14:31:09] [INFO ] Transformed 8833 transitions.
[2026-05-25 14:31:09] [INFO ] Found NUPN structural information;
[2026-05-25 14:31:09] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 8833 rows 7014 cols
[2026-05-25 14:31:10] [INFO ] Computed 66 invariants in 102 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 121 ms. (81 steps per ms)
FORMULA NoC3x3-PT-7B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 174 ms. (514 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:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:12] [INFO ] [Real]Absence check using 66 positive place invariants in 286 ms returned sat
[2026-05-25 14:31:15] [INFO ] [Real]Absence check using state equation in 3457 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:16] [INFO ] [Real]Absence check using 66 positive place invariants in 298 ms returned sat
[2026-05-25 14:31:20] [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 1
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:21] [INFO ] [Real]Absence check using 66 positive place invariants in 268 ms returned sat
[2026-05-25 14:31:25] [INFO ] [Real]Absence check using state equation in 3782 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:26] [INFO ] [Real]Absence check using 66 positive place invariants in 299 ms returned sat
[2026-05-25 14:31:30] [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 3
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:31] [INFO ] [Real]Absence check using 66 positive place invariants in 274 ms returned sat
[2026-05-25 14:31:35] [INFO ] [Real]Absence check using state equation in 3768 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:36] [INFO ] [Real]Absence check using 66 positive place invariants in 270 ms returned sat
[2026-05-25 14:31:40] [INFO ] [Real]Absence check using state equation in 3795 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:41] [INFO ] [Real]Absence check using 66 positive place invariants in 272 ms returned sat
[2026-05-25 14:31:45] [INFO ] [Real]Absence check using state equation in 3803 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:46] [INFO ] [Real]Absence check using 66 positive place invariants in 298 ms returned sat
[2026-05-25 14:31:50] [INFO ] [Real]Absence check using state equation in 3787 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:31:51] [INFO ] [Real]Absence check using 66 positive place invariants in 276 ms returned sat
[2026-05-25 14:31:55] [INFO ] [Real]Absence check using state equation in 3780 ms returned unknown
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 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7799 edges and 7014 vertex of which 4812 / 7014 are part of one of the 33 SCC in 21 ms
Free SCC test removed 4779 places
Drop transitions (Empty/Sink Transition effects.) removed 5856 transitions
Reduce isomorphic transitions removed 5856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 384 transitions
Trivial Post-agglo rules discarded 384 transitions
Performed 384 trivial Post agglomeration. Transition count delta: 384
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 2235 transition count 2593
Reduce places removed 384 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 393 rules applied. Total rules applied 778 place count 1851 transition count 2584
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 10 rules applied. Total rules applied 788 place count 1847 transition count 2578
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 794 place count 1842 transition count 2577
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 794 place count 1842 transition count 2575
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 798 place count 1840 transition count 2575
Discarding 766 places :
Symmetric choice reduction at 4 with 766 rule applications. Total rules 1564 place count 1074 transition count 1809
Iterating global reduction 4 with 766 rules applied. Total rules applied 2330 place count 1074 transition count 1809
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2334 place count 1074 transition count 1805
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 66 Pre rules applied. Total rules applied 2334 place count 1074 transition count 1739
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 2466 place count 1008 transition count 1739
Discarding 486 places :
Symmetric choice reduction at 5 with 486 rule applications. Total rules 2952 place count 522 transition count 1028
Iterating global reduction 5 with 486 rules applied. Total rules applied 3438 place count 522 transition count 1028
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 423 transitions.
Iterating post reduction 5 with 423 rules applied. Total rules applied 3861 place count 522 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3862 place count 521 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 3863 place count 521 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3864 place count 520 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 3865 place count 520 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3866 place count 519 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 3867 place count 519 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3868 place count 518 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 3869 place count 518 transition count 599
Performed 114 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 6 with 228 rules applied. Total rules applied 4097 place count 404 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4099 place count 404 transition count 481
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4100 place count 403 transition count 480
Iterating global reduction 7 with 1 rules applied. Total rules applied 4101 place count 403 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4103 place count 402 transition count 479
Performed 6 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 4115 place count 396 transition count 494
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 4117 place count 396 transition count 492
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 4136 place count 396 transition count 473
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4137 place count 395 transition count 472
Iterating global reduction 8 with 1 rules applied. Total rules applied 4138 place count 395 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4140 place count 394 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 4143 place count 394 transition count 480
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4144 place count 393 transition count 479
Iterating global reduction 8 with 1 rules applied. Total rules applied 4145 place count 393 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4147 place count 393 transition count 477
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4148 place count 392 transition count 476
Iterating global reduction 8 with 1 rules applied. Total rules applied 4149 place count 392 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4150 place count 392 transition count 475
Free-agglomeration rule applied 203 times.
Iterating global reduction 8 with 203 rules applied. Total rules applied 4353 place count 392 transition count 272
Reduce places removed 203 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 517 edges and 189 vertex of which 57 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.0 ms
Discarding 132 places :
Also discarding 108 output transitions
Drop transitions (Output transitions of discarded places.) removed 108 transitions
Iterating post reduction 8 with 240 rules applied. Total rules applied 4593 place count 57 transition count 128
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 9 with 66 rules applied. Total rules applied 4659 place count 57 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 4661 place count 57 transition count 60
Graph (complete) has 128 edges and 57 vertex of which 45 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 4662 place count 45 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 4673 place count 45 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4673 place count 45 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4675 place count 44 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4676 place count 44 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 4677 place count 43 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4678 place count 42 transition count 43
Reduce places removed 10 places and 0 transitions.
Graph (trivial) has 16 edges and 32 vertex of which 12 / 32 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 4689 place count 23 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 14 with 15 rules applied. Total rules applied 4704 place count 23 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 4705 place count 23 transition count 27
Applied a total of 4705 rules in 1083 ms. Remains 23 /7014 variables (removed 6991) and now considering 27/8833 (removed 8806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 23/7014 places, 27/8833 transitions.
// Phase 1: matrix 27 rows 23 cols
[2026-05-25 14:31:56] [INFO ] Computed 9 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 627 ms. (1592 steps per ms)
FORMULA NoC3x3-PT-7B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 315 ms. (3164 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:31:57] [INFO ] Flatten gal took : 18 ms
[2026-05-25 14:31:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 14:31:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4187903274322923416.gal : 3 ms
[2026-05-25 14:31:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8913931087808643144.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4187903274322923416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8913931087808643144.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 48620 ms.

BK_STOP 1779719518002

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

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