Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.0M May 18 16:43 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-7B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716694590838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 03:36:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:36:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:36:32] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-26 03:36:32] [INFO ] Transformed 7014 places.
[2024-05-26 03:36:32] [INFO ] Transformed 8833 transitions.
[2024-05-26 03:36:32] [INFO ] Found NUPN structural information;
[2024-05-26 03:36:32] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 8833 rows 7014 cols
[2024-05-26 03:36:33] [INFO ] Computed 66 invariants in 79 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :4
FORMULA NoC3x3-PT-7B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
[2024-05-26 03:36:33] [INFO ] Invariant cache hit.
[2024-05-26 03:36:35] [INFO ] [Real]Absence check using 66 positive place invariants in 241 ms returned sat
[2024-05-26 03:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:36:38] [INFO ] [Real]Absence check using state equation in 3565 ms returned unknown
[2024-05-26 03:36:39] [INFO ] [Real]Absence check using 66 positive place invariants in 227 ms returned sat
[2024-05-26 03:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:36:43] [INFO ] [Real]Absence check using state equation in 3768 ms returned unknown
[2024-05-26 03:36:44] [INFO ] [Real]Absence check using 66 positive place invariants in 201 ms returned sat
[2024-05-26 03:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:36:48] [INFO ] [Real]Absence check using state equation in 3852 ms returned unknown
[2024-05-26 03:36:49] [INFO ] [Real]Absence check using 66 positive place invariants in 199 ms returned sat
[2024-05-26 03:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:36:53] [INFO ] [Real]Absence check using state equation in 3894 ms returned unknown
[2024-05-26 03:36:54] [INFO ] [Real]Absence check using 66 positive place invariants in 209 ms returned sat
[2024-05-26 03:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:36:58] [INFO ] [Real]Absence check using state equation in 3926 ms returned unknown
[2024-05-26 03:36:59] [INFO ] [Real]Absence check using 66 positive place invariants in 208 ms returned sat
[2024-05-26 03:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:03] [INFO ] [Real]Absence check using state equation in 3851 ms returned unknown
[2024-05-26 03:37:04] [INFO ] [Real]Absence check using 66 positive place invariants in 222 ms returned sat
[2024-05-26 03:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:08] [INFO ] [Real]Absence check using state equation in 3824 ms returned unknown
[2024-05-26 03:37:09] [INFO ] [Real]Absence check using 66 positive place invariants in 212 ms returned sat
[2024-05-26 03:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:13] [INFO ] [Real]Absence check using state equation in 3822 ms returned unknown
[2024-05-26 03:37:14] [INFO ] [Real]Absence check using 66 positive place invariants in 196 ms returned sat
[2024-05-26 03:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:18] [INFO ] [Real]Absence check using state equation in 3856 ms returned unknown
[2024-05-26 03:37:19] [INFO ] [Real]Absence check using 66 positive place invariants in 195 ms returned sat
[2024-05-26 03:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:23] [INFO ] [Real]Absence check using state equation in 3871 ms returned unknown
[2024-05-26 03:37:24] [INFO ] [Real]Absence check using 66 positive place invariants in 208 ms returned sat
[2024-05-26 03:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:28] [INFO ] [Real]Absence check using state equation in 3921 ms returned unknown
[2024-05-26 03:37:30] [INFO ] [Real]Absence check using 66 positive place invariants in 218 ms returned sat
[2024-05-26 03:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:37:33] [INFO ] [Real]Absence check using state equation in 3870 ms returned unknown
Current structural bounds on expressions (after SMT) : [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]
Support contains 12 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7799 edges and 7014 vertex of which 4844 / 7014 are part of one of the 33 SCC in 22 ms
Free SCC test removed 4811 places
Drop transitions removed 5899 transitions
Reduce isomorphic transitions removed 5899 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 363 place count 2203 transition count 2572
Reduce places removed 362 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 368 rules applied. Total rules applied 731 place count 1841 transition count 2566
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 736 place count 1836 transition count 2566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 736 place count 1836 transition count 2565
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 738 place count 1835 transition count 2565
Discarding 758 places :
Symmetric choice reduction at 3 with 758 rule applications. Total rules 1496 place count 1077 transition count 1807
Iterating global reduction 3 with 758 rules applied. Total rules applied 2254 place count 1077 transition count 1807
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 2254 place count 1077 transition count 1748
Deduced a syphon composed of 59 places in 3 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 2372 place count 1018 transition count 1748
Discarding 486 places :
Symmetric choice reduction at 3 with 486 rule applications. Total rules 2858 place count 532 transition count 1039
Iterating global reduction 3 with 486 rules applied. Total rules applied 3344 place count 532 transition count 1039
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 423 transitions.
Iterating post reduction 3 with 423 rules applied. Total rules applied 3767 place count 532 transition count 616
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 4007 place count 412 transition count 496
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4017 place count 407 transition count 512
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 4025 place count 407 transition count 504
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 4036 place count 407 transition count 493
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4037 place count 406 transition count 492
Iterating global reduction 5 with 1 rules applied. Total rules applied 4038 place count 406 transition count 492
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 5 with 2 rules applied. Total rules applied 4040 place count 405 transition count 503
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4041 place count 405 transition count 502
Free-agglomeration rule applied 206 times.
Iterating global reduction 5 with 206 rules applied. Total rules applied 4247 place count 405 transition count 296
Reduce places removed 206 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 548 edges and 199 vertex of which 112 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Iterating post reduction 5 with 243 rules applied. Total rules applied 4490 place count 112 transition count 221
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 6 with 66 rules applied. Total rules applied 4556 place count 112 transition count 155
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 4571 place count 112 transition count 140
Graph (complete) has 297 edges and 112 vertex of which 106 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 4572 place count 106 transition count 138
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 4577 place count 106 transition count 133
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 4583 place count 106 transition count 127
Reduce places removed 6 places and 0 transitions.
Graph (complete) has 268 edges and 100 vertex of which 62 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Iterating post reduction 9 with 7 rules applied. Total rules applied 4590 place count 62 transition count 85
Drop transitions removed 17 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 4610 place count 62 transition count 65
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 4611 place count 62 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4612 place count 62 transition count 63
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 132 edges and 61 vertex of which 54 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 11 with 2 rules applied. Total rules applied 4614 place count 54 transition count 60
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 4618 place count 54 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4619 place count 53 transition count 55
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 14 edges and 47 vertex of which 5 / 47 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 10 rules applied. Total rules applied 4629 place count 43 transition count 52
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 4640 place count 40 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4642 place count 39 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 4644 place count 39 transition count 43
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 4646 place count 39 transition count 41
Applied a total of 4646 rules in 586 ms. Remains 39 /7014 variables (removed 6975) and now considering 41/8833 (removed 8792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 39/7014 places, 41/8833 transitions.
// Phase 1: matrix 41 rows 39 cols
[2024-05-26 03:37:34] [INFO ] Computed 15 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1195 ms. (steps per millisecond=836 ) properties (out of 12) seen :12
FORMULA NoC3x3-PT-7B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 63339 ms.

BK_STOP 1716694656584

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-7B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-7B, 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 r263-tall-171654372800411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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