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.r265-tall-174931349700064.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 MedleyB-PT-B11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 12:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 6 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 6 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 09:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 6 09:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 36M Jun 5 20:08 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 MedleyB-PT-B11-UpperBounds-00
FORMULA_NAME MedleyB-PT-B11-UpperBounds-01
FORMULA_NAME MedleyB-PT-B11-UpperBounds-02
FORMULA_NAME MedleyB-PT-B11-UpperBounds-03
FORMULA_NAME MedleyB-PT-B11-UpperBounds-04
FORMULA_NAME MedleyB-PT-B11-UpperBounds-05
FORMULA_NAME MedleyB-PT-B11-UpperBounds-06
FORMULA_NAME MedleyB-PT-B11-UpperBounds-07
FORMULA_NAME MedleyB-PT-B11-UpperBounds-08
FORMULA_NAME MedleyB-PT-B11-UpperBounds-09
FORMULA_NAME MedleyB-PT-B11-UpperBounds-10
FORMULA_NAME MedleyB-PT-B11-UpperBounds-11
FORMULA_NAME MedleyB-PT-B11-UpperBounds-12
FORMULA_NAME MedleyB-PT-B11-UpperBounds-13
FORMULA_NAME MedleyB-PT-B11-UpperBounds-14
FORMULA_NAME MedleyB-PT-B11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749319110357

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:58:31] [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-07 17:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:58:33] [INFO ] Load time of PNML (sax parser for PT used): 1477 ms
[2025-06-07 17:58:33] [INFO ] Transformed 2737 places.
[2025-06-07 17:58:33] [INFO ] Transformed 42767 transitions.
[2025-06-07 17:58:33] [INFO ] Found NUPN structural information;
[2025-06-07 17:58:33] [INFO ] Parsed PT model containing 2737 places and 42767 transitions and 723915 arcs in 1840 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 42767 rows 2737 cols
[2025-06-07 17:58:35] [INFO ] Computed 10 invariants in 1296 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 (60 resets) in 297 ms. (33 steps per ms)
FORMULA MedleyB-PT-B11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (71 resets) in 440 ms. (226 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-07 17:58:36] [INFO ] Invariant cache hit.
[2025-06-07 17:58:36] [INFO ] [Real]Absence check using 10 positive place invariants in 82 ms returned sat
[2025-06-07 17:58:41] [INFO ] [Real]Absence check using state equation in 4237 ms returned unknown
[2025-06-07 17:58:41] [INFO ] [Real]Absence check using 10 positive place invariants in 62 ms returned sat
[2025-06-07 17:58:46] [INFO ] [Real]Absence check using state equation in 4585 ms returned unknown
[2025-06-07 17:58:46] [INFO ] [Real]Absence check using 10 positive place invariants in 55 ms returned sat
[2025-06-07 17:58:51] [INFO ] [Real]Absence check using state equation in 4592 ms returned unknown
[2025-06-07 17:58:51] [INFO ] [Real]Absence check using 10 positive place invariants in 52 ms returned sat
[2025-06-07 17:58:56] [INFO ] [Real]Absence check using state equation in 4590 ms returned unknown
[2025-06-07 17:58:56] [INFO ] [Real]Absence check using 10 positive place invariants in 56 ms returned sat
[2025-06-07 17:59:01] [INFO ] [Real]Absence check using state equation in 4574 ms returned unknown
[2025-06-07 17:59:01] [INFO ] [Real]Absence check using 10 positive place invariants in 52 ms returned sat
[2025-06-07 17:59:06] [INFO ] [Real]Absence check using state equation in 4596 ms returned unknown
[2025-06-07 17:59:06] [INFO ] [Real]Absence check using 10 positive place invariants in 51 ms returned sat
[2025-06-07 17:59:11] [INFO ] [Real]Absence check using state equation in 4604 ms returned unknown
[2025-06-07 17:59:11] [INFO ] [Real]Absence check using 10 positive place invariants in 55 ms returned sat
[2025-06-07 17:59:16] [INFO ] [Real]Absence check using state equation in 4590 ms returned unknown
[2025-06-07 17:59:16] [INFO ] [Real]Absence check using 10 positive place invariants in 55 ms returned sat
[2025-06-07 17:59:21] [INFO ] [Real]Absence check using state equation in 4599 ms returned unknown
[2025-06-07 17:59:21] [INFO ] [Real]Absence check using 10 positive place invariants in 61 ms returned sat
[2025-06-07 17:59:26] [INFO ] [Real]Absence check using state equation in 4615 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 2737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2737/2737 places, 42767/42767 transitions.
Graph (trivial) has 2701 edges and 2737 vertex of which 177 / 2737 are part of one of the 27 SCC in 18 ms
Free SCC test removed 150 places
Drop transitions (Empty/Sink Transition effects.) removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Graph (complete) has 4669 edges and 2587 vertex of which 2569 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.134 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2055 transitions
Trivial Post-agglo rules discarded 2055 transitions
Performed 2055 trivial Post agglomeration. Transition count delta: 2055
Iterating post reduction 0 with 2064 rules applied. Total rules applied 2066 place count 2569 transition count 40500
Reduce places removed 2055 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 2120 rules applied. Total rules applied 4186 place count 514 transition count 40435
Reduce places removed 24 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 31 rules applied. Total rules applied 4217 place count 490 transition count 40428
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 4224 place count 483 transition count 40428
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 4224 place count 483 transition count 40337
Deduced a syphon composed of 91 places in 18 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 4406 place count 392 transition count 40337
Discarding 108 places :
Symmetric choice reduction at 4 with 108 rule applications. Total rules 4514 place count 284 transition count 40229
Iterating global reduction 4 with 108 rules applied. Total rules applied 4622 place count 284 transition count 40229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4622 place count 284 transition count 40228
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4624 place count 283 transition count 40228
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 4684 place count 223 transition count 2082
Iterating global reduction 4 with 60 rules applied. Total rules applied 4744 place count 223 transition count 2082
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 4769 place count 223 transition count 2057
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 4786 place count 206 transition count 2040
Iterating global reduction 5 with 17 rules applied. Total rules applied 4803 place count 206 transition count 2040
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 4820 place count 189 transition count 2023
Iterating global reduction 5 with 17 rules applied. Total rules applied 4837 place count 189 transition count 2023
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 4854 place count 189 transition count 2006
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 4912 place count 160 transition count 1977
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4913 place count 160 transition count 1976
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4922 place count 151 transition count 1967
Iterating global reduction 7 with 9 rules applied. Total rules applied 4931 place count 151 transition count 1967
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4940 place count 142 transition count 1958
Iterating global reduction 7 with 9 rules applied. Total rules applied 4949 place count 142 transition count 1958
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4958 place count 133 transition count 1949
Iterating global reduction 7 with 9 rules applied. Total rules applied 4967 place count 133 transition count 1949
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 4975 place count 129 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4976 place count 129 transition count 1956
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4977 place count 129 transition count 1955
Free-agglomeration rule applied 51 times.
Iterating global reduction 8 with 51 rules applied. Total rules applied 5028 place count 129 transition count 1904
Reduce places removed 51 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 116 rules applied. Total rules applied 5144 place count 78 transition count 1839
Renaming transitions due to excessive name length > 1024 char.
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 5153 place count 69 transition count 1830
Iterating global reduction 9 with 9 rules applied. Total rules applied 5162 place count 69 transition count 1830
Drop transitions (Redundant composition of simpler transitions.) removed 770 transitions
Redundant transition composition rules discarded 770 transitions
Iterating global reduction 9 with 770 rules applied. Total rules applied 5932 place count 69 transition count 1060
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5934 place count 68 transition count 1059
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 5938 place count 66 transition count 1077
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 5943 place count 66 transition count 1072
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 5948 place count 61 transition count 1072
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 5953 place count 61 transition count 1072
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 5957 place count 61 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 5959 place count 59 transition count 1064
Iterating global reduction 10 with 2 rules applied. Total rules applied 5961 place count 59 transition count 1064
Applied a total of 5961 rules in 7506 ms. Remains 59 /2737 variables (removed 2678) and now considering 1064/42767 (removed 41703) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7517 ms. Remains : 59/2737 places, 1064/42767 transitions.
// Phase 1: matrix 1064 rows 59 cols
[2025-06-07 17:59:33] [INFO ] Computed 10 invariants in 2 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 509950 steps (1 resets) in 30001 ms. (16 steps per ms)
FORMULA MedleyB-PT-B11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 734 ms. (1360 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-07 18:00:05] [INFO ] Flatten gal took : 297 ms
[2025-06-07 18:00:05] [INFO ] Flatten gal took : 116 ms
[2025-06-07 18:00:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16386199340862586572.gal : 111 ms
[2025-06-07 18:00:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11952728806036348507.prop : 0 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/ReachabilityCardinality16386199340862586572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11952728806036348507.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 93847 ms.

BK_STOP 1749319205446

--------------------
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="MedleyB-PT-B11"
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 MedleyB-PT-B11, 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 r265-tall-174931349700064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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