Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r287-smll-167863553800034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r287-smll-167863553800034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 581K Mar 5 18:23 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

here is the order used to build the result vector(from text 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 1678917693971

Running Version 202205111006
[2023-03-15 22:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:01:37] [INFO ] Load time of PNML (sax parser for PT used): 513 ms
[2023-03-15 22:01:37] [INFO ] Transformed 2117 places.
[2023-03-15 22:01:37] [INFO ] Transformed 2435 transitions.
[2023-03-15 22:01:37] [INFO ] Found NUPN structural information;
[2023-03-15 22:01:37] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 806 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 2435 rows 2117 cols
[2023-03-15 22:01:37] [INFO ] Computed 66 place invariants in 83 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :12
FORMULA NoC3x3-PT-3B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
// Phase 1: matrix 2435 rows 2117 cols
[2023-03-15 22:01:38] [INFO ] Computed 66 place invariants in 24 ms
[2023-03-15 22:01:39] [INFO ] [Real]Absence check using 66 positive place invariants in 132 ms returned sat
[2023-03-15 22:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:01:41] [INFO ] [Real]Absence check using state equation in 1958 ms returned sat
[2023-03-15 22:01:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:01:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 158 ms returned sat
[2023-03-15 22:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:01:44] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2023-03-15 22:01:45] [INFO ] Deduced a trap composed of 73 places in 1085 ms of which 9 ms to minimize.
[2023-03-15 22:01:46] [INFO ] Deduced a trap composed of 74 places in 890 ms of which 5 ms to minimize.
[2023-03-15 22:01:49] [INFO ] Deduced a trap composed of 7 places in 2462 ms of which 4 ms to minimize.
[2023-03-15 22:01:49] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:01:49] [INFO ] [Real]Absence check using 66 positive place invariants in 98 ms returned sat
[2023-03-15 22:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:01:50] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2023-03-15 22:01:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:01:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 126 ms returned sat
[2023-03-15 22:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:01:53] [INFO ] [Nat]Absence check using state equation in 1925 ms returned sat
[2023-03-15 22:01:55] [INFO ] Deduced a trap composed of 35 places in 1056 ms of which 3 ms to minimize.
[2023-03-15 22:01:56] [INFO ] Deduced a trap composed of 72 places in 1111 ms of which 3 ms to minimize.
[2023-03-15 22:01:56] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:01:57] [INFO ] [Real]Absence check using 66 positive place invariants in 137 ms returned sat
[2023-03-15 22:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:01:58] [INFO ] [Real]Absence check using state equation in 1829 ms returned sat
[2023-03-15 22:01:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:01:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 141 ms returned sat
[2023-03-15 22:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:01] [INFO ] [Nat]Absence check using state equation in 1489 ms returned sat
[2023-03-15 22:02:02] [INFO ] Deduced a trap composed of 104 places in 998 ms of which 2 ms to minimize.
[2023-03-15 22:02:03] [INFO ] Deduced a trap composed of 60 places in 693 ms of which 1 ms to minimize.
[2023-03-15 22:02:04] [INFO ] Deduced a trap composed of 85 places in 744 ms of which 3 ms to minimize.
[2023-03-15 22:02:04] [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 2
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:02:04] [INFO ] [Real]Absence check using 66 positive place invariants in 120 ms returned sat
[2023-03-15 22:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:06] [INFO ] [Real]Absence check using state equation in 1712 ms returned sat
[2023-03-15 22:02:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 92 ms returned sat
[2023-03-15 22:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:09] [INFO ] [Nat]Absence check using state equation in 1646 ms returned sat
[2023-03-15 22:02:10] [INFO ] Deduced a trap composed of 58 places in 1171 ms of which 2 ms to minimize.
[2023-03-15 22:02:11] [INFO ] Deduced a trap composed of 72 places in 1120 ms of which 3 ms to minimize.
[2023-03-15 22:02:12] [INFO ] Deduced a trap composed of 45 places in 1012 ms of which 2 ms to minimize.
[2023-03-15 22:02: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1740 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 20 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 444 rules applied. Total rules applied 445 place count 2050 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 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 891 place count 1610 transition count 1917
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 894 place count 1607 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 894 place count 1607 transition count 1893
Deduced a syphon composed of 24 places in 10 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 942 place count 1583 transition count 1893
Discarding 364 places :
Symmetric choice reduction at 3 with 364 rule applications. Total rules 1306 place count 1219 transition count 1529
Iterating global reduction 3 with 364 rules applied. Total rules applied 1670 place count 1219 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1670 place count 1219 transition count 1488
Deduced a syphon composed of 41 places in 17 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1752 place count 1178 transition count 1488
Discarding 135 places :
Symmetric choice reduction at 3 with 135 rule applications. Total rules 1887 place count 1043 transition count 1313
Iterating global reduction 3 with 135 rules applied. Total rules applied 2022 place count 1043 transition count 1313
Discarding 138 places :
Symmetric choice reduction at 3 with 138 rule applications. Total rules 2160 place count 905 transition count 1159
Iterating global reduction 3 with 138 rules applied. Total rules applied 2298 place count 905 transition count 1159
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2355 place count 848 transition count 1059
Iterating global reduction 3 with 57 rules applied. Total rules applied 2412 place count 848 transition count 1059
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 2432 place count 846 transition count 1041
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2434 place count 844 transition count 1041
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 2475 place count 803 transition count 1000
Iterating global reduction 5 with 41 rules applied. Total rules applied 2516 place count 803 transition count 1000
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 2524 place count 799 transition count 996
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2528 place count 795 transition count 996
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 2558 place count 765 transition count 936
Iterating global reduction 7 with 30 rules applied. Total rules applied 2588 place count 765 transition count 936
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 2618 place count 735 transition count 906
Iterating global reduction 7 with 30 rules applied. Total rules applied 2648 place count 735 transition count 906
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 40 rules applied. Total rules applied 2688 place count 730 transition count 871
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2693 place count 725 transition count 871
Performed 305 Post agglomeration using F-continuation condition.Transition count delta: 305
Deduced a syphon composed of 305 places in 1 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 9 with 610 rules applied. Total rules applied 3303 place count 420 transition count 566
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 3316 place count 407 transition count 553
Iterating global reduction 9 with 13 rules applied. Total rules applied 3329 place count 407 transition count 553
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 3339 place count 397 transition count 533
Iterating global reduction 9 with 10 rules applied. Total rules applied 3349 place count 397 transition count 533
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3351 place count 397 transition count 531
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3353 place count 395 transition count 527
Iterating global reduction 10 with 2 rules applied. Total rules applied 3355 place count 395 transition count 527
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -23
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 3387 place count 379 transition count 550
Free-agglomeration rule applied 23 times.
Iterating global reduction 10 with 23 rules applied. Total rules applied 3410 place count 379 transition count 527
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 3440 place count 356 transition count 520
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3444 place count 356 transition count 516
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3448 place count 352 transition count 516
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3449 place count 352 transition count 516
Applied a total of 3449 rules in 1319 ms. Remains 352 /2117 variables (removed 1765) and now considering 516/2435 (removed 1919) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/2117 places, 516/2435 transitions.
// Phase 1: matrix 516 rows 352 cols
[2023-03-15 22:02:14] [INFO ] Computed 55 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 13797 resets, run finished after 4973 ms. (steps per millisecond=201 ) properties (out of 4) seen :4
FORMULA NoC3x3-PT-3B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 42293 ms.

BK_STOP 1678917739082

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r287-smll-167863553800034"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;