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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 14K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 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 608K 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-4B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678917720237

Running Version 202205111006
[2023-03-15 22:02:02] [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:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:02:02] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2023-03-15 22:02:02] [INFO ] Transformed 2328 places.
[2023-03-15 22:02:02] [INFO ] Transformed 2701 transitions.
[2023-03-15 22:02:02] [INFO ] Found NUPN structural information;
[2023-03-15 22:02:02] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 549 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 2701 rows 2328 cols
[2023-03-15 22:02:03] [INFO ] Computed 66 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :11
FORMULA NoC3x3-PT-4B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-4B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
// Phase 1: matrix 2701 rows 2328 cols
[2023-03-15 22:02:03] [INFO ] Computed 66 place invariants in 21 ms
[2023-03-15 22:02:05] [INFO ] [Real]Absence check using 66 positive place invariants in 144 ms returned sat
[2023-03-15 22:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:06] [INFO ] [Real]Absence check using state equation in 1991 ms returned sat
[2023-03-15 22:02:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:08] [INFO ] [Nat]Absence check using 66 positive place invariants in 120 ms returned sat
[2023-03-15 22:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:10] [INFO ] [Nat]Absence check using state equation in 1912 ms returned sat
[2023-03-15 22:02:11] [INFO ] Deduced a trap composed of 106 places in 875 ms of which 32 ms to minimize.
[2023-03-15 22:02:11] [INFO ] Deduced a trap composed of 109 places in 548 ms of which 4 ms to minimize.
[2023-03-15 22:02:12] [INFO ] Deduced a trap composed of 120 places in 398 ms of which 3 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 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:02:13] [INFO ] [Real]Absence check using 66 positive place invariants in 156 ms returned sat
[2023-03-15 22:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:15] [INFO ] [Real]Absence check using state equation in 1689 ms returned sat
[2023-03-15 22:02:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:16] [INFO ] [Nat]Absence check using 66 positive place invariants in 102 ms returned sat
[2023-03-15 22:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:17] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2023-03-15 22:02:18] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 2 ms to minimize.
[2023-03-15 22:02:18] [INFO ] Deduced a trap composed of 120 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:02:18] [INFO ] Deduced a trap composed of 106 places in 303 ms of which 2 ms to minimize.
[2023-03-15 22:02:19] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 0 ms to minimize.
[2023-03-15 22:02:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1836 ms
[2023-03-15 22:02:19] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 259 ms.
[2023-03-15 22:02: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: 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.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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:21] [INFO ] [Real]Absence check using 66 positive place invariants in 100 ms returned sat
[2023-03-15 22:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:22] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2023-03-15 22:02:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 140 ms returned sat
[2023-03-15 22:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:25] [INFO ] [Nat]Absence check using state equation in 1554 ms returned sat
[2023-03-15 22:02:25] [INFO ] Deduced a trap composed of 85 places in 506 ms of which 2 ms to minimize.
[2023-03-15 22:02:26] [INFO ] Deduced a trap composed of 93 places in 346 ms of which 1 ms to minimize.
[2023-03-15 22:02:26] [INFO ] Deduced a trap composed of 101 places in 330 ms of which 1 ms to minimize.
[2023-03-15 22:02:27] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 1 ms to minimize.
[2023-03-15 22:02:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2211 ms
[2023-03-15 22:02:27] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 329 ms.
[2023-03-15 22:02:30] [INFO ] Deduced a trap composed of 7 places in 2397 ms of which 4 ms to minimize.
[2023-03-15 22:02: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: 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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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:31] [INFO ] [Real]Absence check using 66 positive place invariants in 105 ms returned sat
[2023-03-15 22:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:32] [INFO ] [Real]Absence check using state equation in 1901 ms returned sat
[2023-03-15 22:02:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 95 ms returned sat
[2023-03-15 22:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:35] [INFO ] [Nat]Absence check using state equation in 1610 ms returned sat
[2023-03-15 22:02:36] [INFO ] Deduced a trap composed of 88 places in 540 ms of which 1 ms to minimize.
[2023-03-15 22:02:36] [INFO ] Deduced a trap composed of 108 places in 520 ms of which 2 ms to minimize.
[2023-03-15 22:02:37] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 0 ms to minimize.
[2023-03-15 22:02:37] [INFO ] Deduced a trap composed of 121 places in 284 ms of which 1 ms to minimize.
[2023-03-15 22:02:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2319 ms
[2023-03-15 22:02:38] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 321 ms.
[2023-03-15 22:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 323 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA NoC3x3-PT-4B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 2328 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2320 edges and 2328 vertex of which 1394 / 2328 are part of one of the 33 SCC in 12 ms
Free SCC test removed 1361 places
Drop transitions removed 1646 transitions
Reduce isomorphic transitions removed 1646 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 967 transition count 1021
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 933 transition count 1020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 932 transition count 1020
Discarding 327 places :
Symmetric choice reduction at 3 with 327 rule applications. Total rules 398 place count 605 transition count 693
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 605 transition count 693
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 725 place count 605 transition count 625
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 861 place count 537 transition count 625
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 917 place count 481 transition count 535
Iterating global reduction 3 with 56 rules applied. Total rules applied 973 place count 481 transition count 535
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 1171 place count 382 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1173 place count 381 transition count 450
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1175 place count 381 transition count 448
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1181 place count 381 transition count 442
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 4 with 2 rules applied. Total rules applied 1183 place count 380 transition count 453
Free-agglomeration rule applied 201 times.
Iterating global reduction 4 with 201 rules applied. Total rules applied 1384 place count 380 transition count 252
Reduce places removed 201 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 488 edges and 179 vertex of which 33 are kept as prefixes of interest. Removing 146 places using SCC suffix rule.5 ms
Discarding 146 places :
Also discarding 139 output transitions
Drop transitions removed 139 transitions
Iterating post reduction 4 with 238 rules applied. Total rules applied 1622 place count 33 transition count 77
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 1648 place count 33 transition count 51
Applied a total of 1648 rules in 499 ms. Remains 33 /2328 variables (removed 2295) and now considering 51/2701 (removed 2650) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/2328 places, 51/2701 transitions.
// Phase 1: matrix 51 rows 33 cols
[2023-03-15 22:02:39] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1172 ms. (steps per millisecond=853 ) properties (out of 3) seen :3
FORMULA NoC3x3-PT-4B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 37926 ms.

BK_STOP 1678917760396

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

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