About the Execution of 2021-gold for NoC3x3-PT-3B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
317.548 | 63865.00 | 88233.00 | 429.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002700058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
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 r161-smll-165277002700058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 581K May 10 09:34 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 1652989601200
Running Version 0
[2022-05-19 19:46:44] [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]
[2022-05-19 19:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:46:45] [INFO ] Load time of PNML (sax parser for PT used): 396 ms
[2022-05-19 19:46:45] [INFO ] Transformed 2117 places.
[2022-05-19 19:46:45] [INFO ] Transformed 2435 transitions.
[2022-05-19 19:46:45] [INFO ] Found NUPN structural information;
[2022-05-19 19:46:45] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 534 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 2435 rows 2117 cols
[2022-05-19 19:46:45] [INFO ] Computed 66 place invariants in 59 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-3B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-01 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 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
// Phase 1: matrix 2435 rows 2117 cols
[2022-05-19 19:46:45] [INFO ] Computed 66 place invariants in 46 ms
[2022-05-19 19:46:46] [INFO ] [Real]Absence check using 66 positive place invariants in 160 ms returned sat
[2022-05-19 19:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:48] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2022-05-19 19:46:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:46:49] [INFO ] [Nat]Absence check using 66 positive place invariants in 134 ms returned sat
[2022-05-19 19:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:51] [INFO ] [Nat]Absence check using state equation in 1976 ms returned sat
[2022-05-19 19:46:52] [INFO ] Deduced a trap composed of 86 places in 1069 ms of which 21 ms to minimize.
[2022-05-19 19:46:53] [INFO ] Deduced a trap composed of 21 places in 873 ms of which 4 ms to minimize.
[2022-05-19 19:46:53] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:46:54] [INFO ] [Real]Absence check using 66 positive place invariants in 151 ms returned sat
[2022-05-19 19:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:56] [INFO ] [Real]Absence check using state equation in 1872 ms returned sat
[2022-05-19 19:46:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:46:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 133 ms returned sat
[2022-05-19 19:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:59] [INFO ] [Nat]Absence check using state equation in 1940 ms returned sat
[2022-05-19 19:47:00] [INFO ] Deduced a trap composed of 45 places in 768 ms of which 3 ms to minimize.
[2022-05-19 19:47:01] [INFO ] Deduced a trap composed of 73 places in 536 ms of which 4 ms to minimize.
[2022-05-19 19:47:01] [INFO ] Deduced a trap composed of 59 places in 481 ms of which 1 ms to minimize.
[2022-05-19 19:47:02] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 1 ms to minimize.
[2022-05-19 19:47:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:47:02] [INFO ] [Real]Absence check using 66 positive place invariants in 89 ms returned sat
[2022-05-19 19:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:04] [INFO ] [Real]Absence check using state equation in 1679 ms returned sat
[2022-05-19 19:47:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:47:05] [INFO ] [Nat]Absence check using 66 positive place invariants in 149 ms returned sat
[2022-05-19 19:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:06] [INFO ] [Nat]Absence check using state equation in 1519 ms returned sat
[2022-05-19 19:47:08] [INFO ] Deduced a trap composed of 65 places in 1235 ms of which 3 ms to minimize.
[2022-05-19 19:47:09] [INFO ] Deduced a trap composed of 80 places in 1194 ms of which 5 ms to minimize.
[2022-05-19 19:47:12] [INFO ] Deduced a trap composed of 7 places in 2640 ms of which 5 ms to minimize.
[2022-05-19 19:47: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:47:13] [INFO ] [Real]Absence check using 66 positive place invariants in 133 ms returned sat
[2022-05-19 19:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:14] [INFO ] [Real]Absence check using state equation in 1637 ms returned sat
[2022-05-19 19:47:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:47:15] [INFO ] [Nat]Absence check using 66 positive place invariants in 125 ms returned sat
[2022-05-19 19:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:16] [INFO ] [Nat]Absence check using state equation in 1497 ms returned sat
[2022-05-19 19:47:18] [INFO ] Deduced a trap composed of 28 places in 1194 ms of which 4 ms to minimize.
[2022-05-19 19:47:19] [INFO ] Deduced a trap composed of 207 places in 1187 ms of which 2 ms to minimize.
[2022-05-19 19:47:20] [INFO ] Deduced a trap composed of 73 places in 984 ms of which 1 ms to minimize.
[2022-05-19 19:47: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:47:21] [INFO ] [Real]Absence check using 66 positive place invariants in 88 ms returned sat
[2022-05-19 19:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:22] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2022-05-19 19:47:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:47:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 91 ms returned sat
[2022-05-19 19:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:24] [INFO ] [Nat]Absence check using state equation in 1627 ms returned sat
[2022-05-19 19:47:25] [INFO ] Deduced a trap composed of 28 places in 1084 ms of which 2 ms to minimize.
[2022-05-19 19:47:27] [INFO ] Deduced a trap composed of 59 places in 1095 ms of which 2 ms to minimize.
[2022-05-19 19:47:28] [INFO ] Deduced a trap composed of 48 places in 1036 ms of which 2 ms to minimize.
[2022-05-19 19:47:28] [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 4
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:47:29] [INFO ] [Real]Absence check using 66 positive place invariants in 165 ms returned sat
[2022-05-19 19:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:30] [INFO ] [Real]Absence check using state equation in 1709 ms returned sat
[2022-05-19 19:47:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:47:31] [INFO ] [Nat]Absence check using 66 positive place invariants in 144 ms returned sat
[2022-05-19 19:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:47:33] [INFO ] [Nat]Absence check using state equation in 1758 ms returned sat
[2022-05-19 19:47:34] [INFO ] Deduced a trap composed of 65 places in 854 ms of which 2 ms to minimize.
[2022-05-19 19:47:35] [INFO ] Deduced a trap composed of 50 places in 888 ms of which 2 ms to minimize.
[2022-05-19 19:47:36] [INFO ] Deduced a trap composed of 63 places in 833 ms of which 2 ms to minimize.
[2022-05-19 19:47:36] [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 5
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1737 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 29 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 2049 transition count 1927
Reduce places removed 436 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 880 place count 1613 transition count 1925
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 883 place count 1612 transition count 1923
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 885 place count 1610 transition count 1923
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 885 place count 1610 transition count 1899
Deduced a syphon composed of 24 places in 10 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 933 place count 1586 transition count 1899
Discarding 364 places :
Symmetric choice reduction at 4 with 364 rule applications. Total rules 1297 place count 1222 transition count 1535
Iterating global reduction 4 with 364 rules applied. Total rules applied 1661 place count 1222 transition count 1535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 1663 place count 1222 transition count 1533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1664 place count 1221 transition count 1533
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 1664 place count 1221 transition count 1492
Deduced a syphon composed of 41 places in 17 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1746 place count 1180 transition count 1492
Discarding 135 places :
Symmetric choice reduction at 6 with 135 rule applications. Total rules 1881 place count 1045 transition count 1317
Iterating global reduction 6 with 135 rules applied. Total rules applied 2016 place count 1045 transition count 1317
Discarding 138 places :
Symmetric choice reduction at 6 with 138 rule applications. Total rules 2154 place count 907 transition count 1164
Iterating global reduction 6 with 138 rules applied. Total rules applied 2292 place count 907 transition count 1164
Discarding 55 places :
Symmetric choice reduction at 6 with 55 rule applications. Total rules 2347 place count 852 transition count 1067
Iterating global reduction 6 with 55 rules applied. Total rules applied 2402 place count 852 transition count 1067
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 6 with 19 rules applied. Total rules applied 2421 place count 850 transition count 1050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2423 place count 848 transition count 1050
Discarding 40 places :
Symmetric choice reduction at 8 with 40 rule applications. Total rules 2463 place count 808 transition count 1010
Iterating global reduction 8 with 40 rules applied. Total rules applied 2503 place count 808 transition count 1010
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 8 with 8 rules applied. Total rules applied 2511 place count 804 transition count 1006
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2515 place count 800 transition count 1006
Discarding 29 places :
Symmetric choice reduction at 10 with 29 rule applications. Total rules 2544 place count 771 transition count 948
Iterating global reduction 10 with 29 rules applied. Total rules applied 2573 place count 771 transition count 948
Discarding 29 places :
Symmetric choice reduction at 10 with 29 rule applications. Total rules 2602 place count 742 transition count 919
Iterating global reduction 10 with 29 rules applied. Total rules applied 2631 place count 742 transition count 919
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 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 10 with 39 rules applied. Total rules applied 2670 place count 737 transition count 885
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2675 place count 732 transition count 885
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 0 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 12 with 616 rules applied. Total rules applied 3291 place count 424 transition count 577
Discarding 14 places :
Symmetric choice reduction at 12 with 14 rule applications. Total rules 3305 place count 410 transition count 563
Iterating global reduction 12 with 14 rules applied. Total rules applied 3319 place count 410 transition count 563
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3328 place count 401 transition count 545
Iterating global reduction 12 with 9 rules applied. Total rules applied 3337 place count 401 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3338 place count 401 transition count 544
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3339 place count 400 transition count 542
Iterating global reduction 13 with 1 rules applied. Total rules applied 3340 place count 400 transition count 542
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 3372 place count 384 transition count 566
Free-agglomeration rule applied 23 times.
Iterating global reduction 13 with 23 rules applied. Total rules applied 3395 place count 384 transition count 543
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 30 rules applied. Total rules applied 3425 place count 361 transition count 536
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3429 place count 361 transition count 532
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3433 place count 357 transition count 532
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 3434 place count 357 transition count 532
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 3435 place count 357 transition count 532
Applied a total of 3435 rules in 2218 ms. Remains 357 /2117 variables (removed 1760) and now considering 532/2435 (removed 1903) transitions.
Finished structural reductions, in 1 iterations. Remains : 357/2117 places, 532/2435 transitions.
// Phase 1: matrix 532 rows 357 cols
[2022-05-19 19:47:38] [INFO ] Computed 54 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 13815 resets, run finished after 5165 ms. (steps per millisecond=193 ) properties (out of 6) seen :6
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-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-05 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
All properties solved without resorting to model-checking.
BK_STOP 1652989665065
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="gold2021"
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-4028"
echo " Executing tool gold2021"
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 r161-smll-165277002700058"
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 '
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 ;