Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824700025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is NoC3x3-PT-3B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824700025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 581K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841363074

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:16:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:16:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:16:04] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2025-06-02 05:16:04] [INFO ] Transformed 2117 places.
[2025-06-02 05:16:04] [INFO ] Transformed 2435 transitions.
[2025-06-02 05:16:04] [INFO ] Found NUPN structural information;
[2025-06-02 05:16:04] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 277 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 2435 rows 2117 cols
[2025-06-02 05:16:04] [INFO ] Computed 66 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 (16 resets) in 66 ms. (149 steps per ms)
FORMULA NoC3x3-PT-3B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 56 ms. (701 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 05:16:04] [INFO ] Invariant cache hit.
[2025-06-02 05:16:05] [INFO ] [Real]Absence check using 66 positive place invariants in 70 ms returned sat
[2025-06-02 05:16:06] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2025-06-02 05:16:06] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 52 ms to minimize.
[2025-06-02 05:16:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 60 ms returned sat
[2025-06-02 05:16:08] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2025-06-02 05:16:08] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 6 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 5 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:16:09] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 4 ms to minimize.
[2025-06-02 05:16:10] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:16:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1915 ms
[2025-06-02 05:16:10] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 141 ms.
[2025-06-02 05:16:12] [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 0
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:16:12] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2025-06-02 05:16:13] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2025-06-02 05:16:13] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 6 ms to minimize.
[2025-06-02 05:16:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:14] [INFO ] [Nat]Absence check using 66 positive place invariants in 59 ms returned sat
[2025-06-02 05:16:14] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2025-06-02 05:16:15] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 6 ms to minimize.
[2025-06-02 05:16:15] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 6 ms to minimize.
[2025-06-02 05:16:15] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 4 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 3 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:16:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2003 ms
[2025-06-02 05:16:17] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 126 ms.
[2025-06-02 05:16:18] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:16:19] [INFO ] [Real]Absence check using 66 positive place invariants in 56 ms returned sat
[2025-06-02 05:16:19] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2025-06-02 05:16:20] [INFO ] Deduced a trap composed of 85 places in 505 ms of which 8 ms to minimize.
[2025-06-02 05:16:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 59 ms returned sat
[2025-06-02 05:16:21] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2025-06-02 05:16:22] [INFO ] Deduced a trap composed of 85 places in 503 ms of which 8 ms to minimize.
[2025-06-02 05:16:22] [INFO ] Deduced a trap composed of 61 places in 449 ms of which 8 ms to minimize.
[2025-06-02 05:16:23] [INFO ] Deduced a trap composed of 109 places in 454 ms of which 8 ms to minimize.
[2025-06-02 05:16:23] [INFO ] Deduced a trap composed of 102 places in 460 ms of which 8 ms to minimize.
[2025-06-02 05:16:24] [INFO ] Deduced a trap composed of 97 places in 278 ms of which 6 ms to minimize.
[2025-06-02 05:16:24] [INFO ] Deduced a trap composed of 135 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:16:24] [INFO ] Deduced a trap composed of 148 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:16:25] [INFO ] Deduced a trap composed of 100 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:16:25] [INFO ] Deduced a trap composed of 95 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:16:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3706 ms
[2025-06-02 05:16:25] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 128 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-02 05:16:26] [INFO ] [Real]Absence check using 66 positive place invariants in 62 ms returned sat
[2025-06-02 05:16:26] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2025-06-02 05:16:27] [INFO ] Deduced a trap composed of 35 places in 393 ms of which 7 ms to minimize.
[2025-06-02 05:16:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:27] [INFO ] [Nat]Absence check using 66 positive place invariants in 61 ms returned sat
[2025-06-02 05:16:28] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2025-06-02 05:16:29] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 7 ms to minimize.
[2025-06-02 05:16:29] [INFO ] Deduced a trap composed of 70 places in 371 ms of which 6 ms to minimize.
[2025-06-02 05:16:29] [INFO ] Deduced a trap composed of 123 places in 330 ms of which 6 ms to minimize.
[2025-06-02 05:16:30] [INFO ] Deduced a trap composed of 123 places in 306 ms of which 6 ms to minimize.
[2025-06-02 05:16:30] [INFO ] Deduced a trap composed of 84 places in 283 ms of which 5 ms to minimize.
[2025-06-02 05:16:31] [INFO ] Deduced a trap composed of 92 places in 253 ms of which 5 ms to minimize.
[2025-06-02 05:16:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2448 ms
[2025-06-02 05:16:31] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 114 ms.
[2025-06-02 05:16:32] [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 3
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1744 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 8 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 2049 transition count 1923
Reduce places removed 440 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 446 rules applied. Total rules applied 892 place count 1609 transition count 1917
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 895 place count 1606 transition count 1917
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 895 place count 1606 transition count 1893
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 943 place count 1582 transition count 1893
Discarding 362 places :
Symmetric choice reduction at 3 with 362 rule applications. Total rules 1305 place count 1220 transition count 1531
Iterating global reduction 3 with 362 rules applied. Total rules applied 1667 place count 1220 transition count 1531
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1667 place count 1220 transition count 1491
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1747 place count 1180 transition count 1491
Discarding 135 places :
Symmetric choice reduction at 3 with 135 rule applications. Total rules 1882 place count 1045 transition count 1318
Iterating global reduction 3 with 135 rules applied. Total rules applied 2017 place count 1045 transition count 1318
Discarding 138 places :
Symmetric choice reduction at 3 with 138 rule applications. Total rules 2155 place count 907 transition count 1165
Iterating global reduction 3 with 138 rules applied. Total rules applied 2293 place count 907 transition count 1165
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2349 place count 851 transition count 1066
Iterating global reduction 3 with 56 rules applied. Total rules applied 2405 place count 851 transition count 1066
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 2423 place count 849 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2424 place count 848 transition count 1050
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 2465 place count 807 transition count 1009
Iterating global reduction 5 with 41 rules applied. Total rules applied 2506 place count 807 transition count 1009
Discarding 4 places :
Implicit places reduction removed 4 places
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 5 with 8 rules applied. Total rules applied 2514 place count 803 transition count 1005
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2518 place count 799 transition count 1005
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 2548 place count 769 transition count 945
Iterating global reduction 7 with 30 rules applied. Total rules applied 2578 place count 769 transition count 945
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 2607 place count 740 transition count 916
Iterating global reduction 7 with 29 rules applied. Total rules applied 2636 place count 740 transition count 916
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 7 with 37 rules applied. Total rules applied 2673 place count 736 transition count 883
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2677 place count 732 transition count 883
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 0 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 9 with 614 rules applied. Total rules applied 3291 place count 425 transition count 576
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 3307 place count 409 transition count 558
Iterating global reduction 9 with 16 rules applied. Total rules applied 3323 place count 409 transition count 558
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 3334 place count 398 transition count 536
Iterating global reduction 9 with 11 rules applied. Total rules applied 3345 place count 398 transition count 536
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3347 place count 398 transition count 534
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3349 place count 396 transition count 530
Iterating global reduction 10 with 2 rules applied. Total rules applied 3351 place count 396 transition count 530
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 10 with 2 rules applied. Total rules applied 3353 place count 395 transition count 529
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 3385 place count 379 transition count 553
Free-agglomeration rule applied 25 times.
Iterating global reduction 10 with 25 rules applied. Total rules applied 3410 place count 379 transition count 528
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 32 rules applied. Total rules applied 3442 place count 354 transition count 521
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 3445 place count 354 transition count 518
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3448 place count 351 transition count 518
Applied a total of 3448 rules in 835 ms. Remains 351 /2117 variables (removed 1766) and now considering 518/2435 (removed 1917) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 846 ms. Remains : 351/2117 places, 518/2435 transitions.
// Phase 1: matrix 518 rows 351 cols
[2025-06-02 05:16:33] [INFO ] Computed 54 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (13688 resets) in 3853 ms. (259 steps per ms)
FORMULA NoC3x3-PT-3B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (770 resets) in 1224 ms. (816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 05:16:38] [INFO ] Flatten gal took : 152 ms
[2025-06-02 05:16:39] [INFO ] Flatten gal took : 111 ms
[2025-06-02 05:16:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15929561137937525344.gal : 46 ms
[2025-06-02 05:16:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3458414618619115385.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15929561137937525344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3458414618619115385.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 35033 ms.

BK_STOP 1748841399418

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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