Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824700033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r153-tall-174876824700033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.0M May 29 14:32 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

echo here is the order used to build the result vector(from xml 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 1748841402245

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:16:43] [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]
[2025-06-02 05:16:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:16:43] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2025-06-02 05:16:43] [INFO ] Transformed 7014 places.
[2025-06-02 05:16:43] [INFO ] Transformed 8833 transitions.
[2025-06-02 05:16:43] [INFO ] Found NUPN structural information;
[2025-06-02 05:16:43] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 8833 rows 7014 cols
[2025-06-02 05:16:44] [INFO ] Computed 66 invariants in 90 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (4 resets) in 90 ms. (109 steps per ms)
FORMULA NoC3x3-PT-7B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (20 resets) in 135 ms. (735 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 05:16:44] [INFO ] Invariant cache hit.
[2025-06-02 05:16:46] [INFO ] [Real]Absence check using 66 positive place invariants in 247 ms returned sat
[2025-06-02 05:16:49] [INFO ] [Real]Absence check using state equation in 3467 ms returned unknown
[2025-06-02 05:16:50] [INFO ] [Real]Absence check using 66 positive place invariants in 243 ms returned sat
[2025-06-02 05:16:54] [INFO ] [Real]Absence check using state equation in 3627 ms returned unknown
[2025-06-02 05:16:55] [INFO ] [Real]Absence check using 66 positive place invariants in 230 ms returned sat
[2025-06-02 05:16:59] [INFO ] [Real]Absence check using state equation in 3664 ms returned unknown
[2025-06-02 05:17:01] [INFO ] [Real]Absence check using 66 positive place invariants in 228 ms returned sat
[2025-06-02 05:17:04] [INFO ] [Real]Absence check using state equation in 3662 ms returned unknown
[2025-06-02 05:17:05] [INFO ] [Real]Absence check using 66 positive place invariants in 226 ms returned sat
[2025-06-02 05:17:09] [INFO ] [Real]Absence check using state equation in 3794 ms returned unknown
[2025-06-02 05:17:11] [INFO ] [Real]Absence check using 66 positive place invariants in 227 ms returned sat
[2025-06-02 05:17:14] [INFO ] [Real]Absence check using state equation in 3679 ms returned unknown
[2025-06-02 05:17:16] [INFO ] [Real]Absence check using 66 positive place invariants in 220 ms returned sat
[2025-06-02 05:17:19] [INFO ] [Real]Absence check using state equation in 3711 ms returned unknown
[2025-06-02 05:17:21] [INFO ] [Real]Absence check using 66 positive place invariants in 227 ms returned sat
[2025-06-02 05:17:24] [INFO ] [Real]Absence check using state equation in 3645 ms returned unknown
[2025-06-02 05:17:26] [INFO ] [Real]Absence check using 66 positive place invariants in 223 ms returned sat
[2025-06-02 05:17:29] [INFO ] [Real]Absence check using state equation in 3647 ms returned unknown
[2025-06-02 05:17:31] [INFO ] [Real]Absence check using 66 positive place invariants in 219 ms returned sat
[2025-06-02 05:17:34] [INFO ] [Real]Absence check using state equation in 3673 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7800 edges and 7014 vertex of which 4855 / 7014 are part of one of the 33 SCC in 26 ms
Free SCC test removed 4822 places
Drop transitions (Empty/Sink Transition effects.) removed 5912 transitions
Reduce isomorphic transitions removed 5912 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 358 place count 2192 transition count 2564
Reduce places removed 357 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 360 rules applied. Total rules applied 718 place count 1835 transition count 2561
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 722 place count 1832 transition count 2560
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 722 place count 1832 transition count 2559
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 724 place count 1831 transition count 2559
Discarding 763 places :
Symmetric choice reduction at 3 with 763 rule applications. Total rules 1487 place count 1068 transition count 1796
Iterating global reduction 3 with 763 rules applied. Total rules applied 2250 place count 1068 transition count 1796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 2252 place count 1068 transition count 1794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2253 place count 1067 transition count 1794
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 61 Pre rules applied. Total rules applied 2253 place count 1067 transition count 1733
Deduced a syphon composed of 61 places in 5 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 2375 place count 1006 transition count 1733
Discarding 490 places :
Symmetric choice reduction at 5 with 490 rule applications. Total rules 2865 place count 516 transition count 1019
Iterating global reduction 5 with 490 rules applied. Total rules applied 3355 place count 516 transition count 1019
Ensure Unique test removed 431 transitions
Reduce isomorphic transitions removed 431 transitions.
Iterating post reduction 5 with 431 rules applied. Total rules applied 3786 place count 516 transition count 588
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 6 with 224 rules applied. Total rules applied 4010 place count 404 transition count 476
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 4016 place count 401 transition count 491
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4019 place count 401 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 4031 place count 401 transition count 476
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4033 place count 399 transition count 473
Iterating global reduction 7 with 2 rules applied. Total rules applied 4035 place count 399 transition count 473
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 7 with 2 rules applied. Total rules applied 4037 place count 398 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 4039 place count 398 transition count 482
Free-agglomeration rule applied 207 times.
Iterating global reduction 7 with 207 rules applied. Total rules applied 4246 place count 398 transition count 275
Reduce places removed 207 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 515 edges and 191 vertex of which 67 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.8 ms
Discarding 124 places :
Also discarding 67 output transitions
Drop transitions (Output transitions of discarded places.) removed 67 transitions
Iterating post reduction 7 with 244 rules applied. Total rules applied 4490 place count 67 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 8 with 95 rules applied. Total rules applied 4585 place count 67 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 4588 place count 67 transition count 74
Graph (complete) has 153 edges and 67 vertex of which 49 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 4589 place count 49 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 4594 place count 49 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 4594 place count 49 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4596 place count 48 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4597 place count 48 transition count 46
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 91 edges and 47 vertex of which 37 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Iterating post reduction 11 with 2 rules applied. Total rules applied 4599 place count 37 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 4601 place count 37 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4602 place count 36 transition count 36
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 31 vertex of which 4 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 13 with 8 rules applied. Total rules applied 4610 place count 28 transition count 34
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 4618 place count 26 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 4619 place count 26 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 4620 place count 26 transition count 27
Applied a total of 4620 rules in 622 ms. Remains 26 /7014 variables (removed 6988) and now considering 27/8833 (removed 8806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 26/7014 places, 27/8833 transitions.
// Phase 1: matrix 27 rows 26 cols
[2025-06-02 05:17:35] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1000 ms. (999 steps per ms)
FORMULA NoC3x3-PT-7B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 312 ms. (3194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 05:17:36] [INFO ] Flatten gal took : 20 ms
[2025-06-02 05:17:36] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:17:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5606193940948269086.gal : 4 ms
[2025-06-02 05:17:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5994195767032852429.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5606193940948269086.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5994195767032852429.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 53639 ms.

BK_STOP 1748841457105

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r153-tall-174876824700033"
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.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 ;