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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 29 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:22 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 3.0M 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-8B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652989951587

Running Version 0
[2022-05-19 19:52:34] [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:52:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:52:35] [INFO ] Load time of PNML (sax parser for PT used): 792 ms
[2022-05-19 19:52:35] [INFO ] Transformed 9140 places.
[2022-05-19 19:52:35] [INFO ] Transformed 14577 transitions.
[2022-05-19 19:52:35] [INFO ] Found NUPN structural information;
[2022-05-19 19:52:35] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 1016 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 14577 rows 9140 cols
[2022-05-19 19:52:36] [INFO ] Computed 99 place invariants in 361 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 16) seen :3
FORMULA NoC3x3-PT-8B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
// Phase 1: matrix 14577 rows 9140 cols
[2022-05-19 19:52:37] [INFO ] Computed 99 place invariants in 184 ms
[2022-05-19 19:52:40] [INFO ] [Real]Absence check using 99 positive place invariants in 705 ms returned sat
[2022-05-19 19:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:52:45] [INFO ] [Real]Absence check using 99 positive place invariants in 733 ms returned sat
[2022-05-19 19:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:47] [INFO ] [Real]Absence check using state equation in 1718 ms returned unknown
[2022-05-19 19:52:50] [INFO ] [Real]Absence check using 99 positive place invariants in 543 ms returned sat
[2022-05-19 19:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:52] [INFO ] [Real]Absence check using state equation in 2186 ms returned unknown
[2022-05-19 19:52:55] [INFO ] [Real]Absence check using 99 positive place invariants in 579 ms returned sat
[2022-05-19 19:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:57] [INFO ] [Real]Absence check using state equation in 2326 ms returned unknown
[2022-05-19 19:53:00] [INFO ] [Real]Absence check using 99 positive place invariants in 562 ms returned sat
[2022-05-19 19:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:02] [INFO ] [Real]Absence check using state equation in 2176 ms returned unknown
[2022-05-19 19:53:05] [INFO ] [Real]Absence check using 99 positive place invariants in 603 ms returned sat
[2022-05-19 19:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:07] [INFO ] [Real]Absence check using state equation in 2300 ms returned unknown
[2022-05-19 19:53:10] [INFO ] [Real]Absence check using 99 positive place invariants in 543 ms returned sat
[2022-05-19 19:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:12] [INFO ] [Real]Absence check using state equation in 2403 ms returned unknown
[2022-05-19 19:53:15] [INFO ] [Real]Absence check using 99 positive place invariants in 540 ms returned sat
[2022-05-19 19:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:17] [INFO ] [Real]Absence check using state equation in 2349 ms returned unknown
[2022-05-19 19:53:20] [INFO ] [Real]Absence check using 99 positive place invariants in 618 ms returned sat
[2022-05-19 19:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:22] [INFO ] [Real]Absence check using state equation in 2310 ms returned unknown
[2022-05-19 19:53:25] [INFO ] [Real]Absence check using 99 positive place invariants in 536 ms returned sat
[2022-05-19 19:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:27] [INFO ] [Real]Absence check using state equation in 2575 ms returned unknown
[2022-05-19 19:53:30] [INFO ] [Real]Absence check using 99 positive place invariants in 542 ms returned sat
[2022-05-19 19:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:32] [INFO ] [Real]Absence check using state equation in 2562 ms returned unknown
[2022-05-19 19:53:35] [INFO ] [Real]Absence check using 99 positive place invariants in 534 ms returned sat
[2022-05-19 19:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:37] [INFO ] [Real]Absence check using state equation in 2361 ms returned unknown
[2022-05-19 19:53:40] [INFO ] [Real]Absence check using 99 positive place invariants in 543 ms returned sat
[2022-05-19 19:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:53:42] [INFO ] [Real]Absence check using state equation in 2575 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13716 edges and 9140 vertex of which 2395 / 9140 are part of one of the 33 SCC in 48 ms
Free SCC test removed 2362 places
Drop transitions removed 3752 transitions
Reduce isomorphic transitions removed 3752 transitions.
Graph (complete) has 12302 edges and 6778 vertex of which 6665 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.25 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions removed 4190 transitions
Trivial Post-agglo rules discarded 4190 transitions
Performed 4190 trivial Post agglomeration. Transition count delta: 4190
Iterating post reduction 0 with 4294 rules applied. Total rules applied 4296 place count 6665 transition count 6451
Reduce places removed 4190 places and 0 transitions.
Ensure Unique test removed 2367 transitions
Reduce isomorphic transitions removed 2367 transitions.
Drop transitions removed 1191 transitions
Trivial Post-agglo rules discarded 1191 transitions
Performed 1191 trivial Post agglomeration. Transition count delta: 1191
Iterating post reduction 1 with 7748 rules applied. Total rules applied 12044 place count 2475 transition count 2893
Reduce places removed 1191 places and 0 transitions.
Ensure Unique test removed 1191 transitions
Reduce isomorphic transitions removed 1191 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 2420 rules applied. Total rules applied 14464 place count 1284 transition count 1664
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 40 rules applied. Total rules applied 14504 place count 1246 transition count 1662
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 14507 place count 1244 transition count 1661
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 38 Pre rules applied. Total rules applied 14507 place count 1244 transition count 1623
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 14583 place count 1206 transition count 1623
Discarding 358 places :
Symmetric choice reduction at 5 with 358 rule applications. Total rules 14941 place count 848 transition count 1265
Iterating global reduction 5 with 358 rules applied. Total rules applied 15299 place count 848 transition count 1265
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 15355 place count 848 transition count 1209
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 61 Pre rules applied. Total rules applied 15355 place count 848 transition count 1148
Deduced a syphon composed of 61 places in 23 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 15477 place count 787 transition count 1148
Discarding 80 places :
Symmetric choice reduction at 6 with 80 rule applications. Total rules 15557 place count 707 transition count 976
Iterating global reduction 6 with 80 rules applied. Total rules applied 15637 place count 707 transition count 976
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 15661 place count 707 transition count 952
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 7 with 478 rules applied. Total rules applied 16139 place count 468 transition count 713
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 16162 place count 468 transition count 690
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 16168 place count 465 transition count 731
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16169 place count 465 transition count 730
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 16188 place count 465 transition count 711
Free-agglomeration rule applied 208 times.
Iterating global reduction 9 with 208 rules applied. Total rules applied 16396 place count 465 transition count 503
Reduce places removed 208 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 817 edges and 257 vertex of which 250 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 222 rules applied. Total rules applied 16618 place count 250 transition count 490
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 16625 place count 250 transition count 483
Drop transitions removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 11 with 168 rules applied. Total rules applied 16793 place count 250 transition count 315
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 634 edges and 242 vertex of which 219 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 9 rules applied. Total rules applied 16802 place count 219 transition count 315
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 16825 place count 219 transition count 292
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 13 with 22 rules applied. Total rules applied 16847 place count 219 transition count 292
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 16848 place count 219 transition count 291
Applied a total of 16848 rules in 962 ms. Remains 219 /9140 variables (removed 8921) and now considering 291/14577 (removed 14286) transitions.
// Phase 1: matrix 291 rows 219 cols
[2022-05-19 19:53:43] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-19 19:53:43] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Finished structural reductions, in 1 iterations. Remains : 219/9140 places, 291/14577 transitions.
Successfully produced net in file /tmp/petri1000_18328932236967035892.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 290 rows 219 cols
[2022-05-19 19:53:43] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4714 ms. (steps per millisecond=212 ) properties (out of 13) seen :13
FORMULA NoC3x3-PT-8B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652990029521

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

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