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.r597-smll-171734926400046.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 MedleyA-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 107K Jun 2 16:33 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 MedleyA-PT-10-UpperBounds-00
FORMULA_NAME MedleyA-PT-10-UpperBounds-01
FORMULA_NAME MedleyA-PT-10-UpperBounds-02
FORMULA_NAME MedleyA-PT-10-UpperBounds-03
FORMULA_NAME MedleyA-PT-10-UpperBounds-04
FORMULA_NAME MedleyA-PT-10-UpperBounds-05
FORMULA_NAME MedleyA-PT-10-UpperBounds-06
FORMULA_NAME MedleyA-PT-10-UpperBounds-07
FORMULA_NAME MedleyA-PT-10-UpperBounds-08
FORMULA_NAME MedleyA-PT-10-UpperBounds-09
FORMULA_NAME MedleyA-PT-10-UpperBounds-10
FORMULA_NAME MedleyA-PT-10-UpperBounds-11
FORMULA_NAME MedleyA-PT-10-UpperBounds-12
FORMULA_NAME MedleyA-PT-10-UpperBounds-13
FORMULA_NAME MedleyA-PT-10-UpperBounds-14
FORMULA_NAME MedleyA-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717362198575

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=MedleyA-PT-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:03:21] [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-06-02 21:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:03:21] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-02 21:03:21] [INFO ] Transformed 149 places.
[2024-06-02 21:03:21] [INFO ] Transformed 340 transitions.
[2024-06-02 21:03:21] [INFO ] Found NUPN structural information;
[2024-06-02 21:03:21] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 340 rows 149 cols
[2024-06-02 21:03:21] [INFO ] Computed 12 invariants in 32 ms
Incomplete random walk after 10000 steps, including 444 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :11
FORMULA MedleyA-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :2
FORMULA MedleyA-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
[2024-06-02 21:03:21] [INFO ] Invariant cache hit.
[2024-06-02 21:03:22] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-02 21:03:22] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 21:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:03:22] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-06-02 21:03:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:03:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2024-06-02 21:03:22] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:03:22] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-02 21:03:22] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 77 ms.
[2024-06-02 21:03:23] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 8 ms to minimize.
[2024-06-02 21:03:23] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2024-06-02 21:03:23] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:03:24] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:03:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 707 ms
[2024-06-02 21:03:24] [INFO ] Added : 59 causal constraints over 14 iterations in 1264 ms. Result :sat
Minimization took 76 ms.
[2024-06-02 21:03:24] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:03:24] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:03:24] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-02 21:03:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:03:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:03:24] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 10 ms returned sat
[2024-06-02 21:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:03:24] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-06-02 21:03:24] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-06-02 21:03:24] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 58 ms.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2024-06-02 21:03:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2024-06-02 21:03:25] [INFO ] Added : 58 causal constraints over 13 iterations in 776 ms. Result :sat
Minimization took 87 ms.
[2024-06-02 21:03:25] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:03:25] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:03:25] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-02 21:03:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:03:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:03:25] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:03:26] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-02 21:03:26] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 39 ms.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-06-02 21:03:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 479 ms
[2024-06-02 21:03:26] [INFO ] Added : 59 causal constraints over 13 iterations in 919 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA MedleyA-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 149 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 338/338 transitions.
Graph (complete) has 541 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 144 transition count 311
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 120 transition count 305
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 120 transition count 302
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 117 transition count 302
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 92 place count 87 transition count 265
Iterating global reduction 2 with 30 rules applied. Total rules applied 122 place count 87 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 122 place count 87 transition count 263
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 85 transition count 263
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 135 place count 76 transition count 244
Iterating global reduction 2 with 9 rules applied. Total rules applied 144 place count 76 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 73 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 73 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 72 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 72 transition count 233
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 184 place count 56 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 56 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 54 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 54 transition count 213
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 198 place count 50 transition count 225
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 50 transition count 215
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 48 transition count 238
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 219 place count 48 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 226 place count 41 transition count 231
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 41 transition count 227
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 41 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 39 transition count 225
Applied a total of 234 rules in 255 ms. Remains 39 /149 variables (removed 110) and now considering 225/338 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 39/149 places, 225/338 transitions.
Successfully produced net in file /tmp/petri1000_11678217027689750580.dot
Successfully produced net in file /tmp/petri1001_14182778180175474605.dot
Successfully produced net in file /tmp/petri1002_1829107102992996112.dot
Successfully produced net in file /tmp/petri1003_4864919564207132489.dot
Successfully produced net in file /tmp/petri1004_2874250726958900296.dot
Successfully produced net in file /tmp/petri1005_5488601773737101626.dot
Successfully produced net in file /tmp/petri1006_10989039944505847777.dot
Successfully produced net in file /tmp/petri1007_13925212349879451205.dot
Successfully produced net in file /tmp/petri1008_16013973273003728239.dot
Successfully produced net in file /tmp/petri1009_6220383535459390252.dot
Successfully produced net in file /tmp/petri1010_10302965325206407778.dot
Successfully produced net in file /tmp/petri1011_6618277838878783422.dot
Successfully produced net in file /tmp/petri1012_1627161705598120651.dot
Successfully produced net in file /tmp/petri1013_9823062760102346911.dot
Successfully produced net in file /tmp/petri1014_12862204142884926962.dot
Successfully produced net in file /tmp/petri1015_4263619204343284627.dot
Successfully produced net in file /tmp/petri1016_18320026464374948359.dot
Successfully produced net in file /tmp/petri1017_898749342209108426.dot
Successfully produced net in file /tmp/petri1018_6455272942438435740.dot
Successfully produced net in file /tmp/petri1019_12052120677635285390.dot
Successfully produced net in file /tmp/petri1020_2342419300444300847.dot
Successfully produced net in file /tmp/petri1021_17922552601733243654.dot
Successfully produced net in file /tmp/petri1022_2715098020083415600.dot
Successfully produced net in file /tmp/petri1023_18359900978264287987.dot
Successfully produced net in file /tmp/petri1024_7577178954277038744.dot
Successfully produced net in file /tmp/petri1025_10316018104555572773.dot
Successfully produced net in file /tmp/petri1026_12248100328656112406.dot
Successfully produced net in file /tmp/petri1027_2969095375036958851.dot
Successfully produced net in file /tmp/petri1028_15716142614257442526.dot
Successfully produced net in file /tmp/petri1029_17806374950404266904.dot
Successfully produced net in file /tmp/petri1030_8511263129766959486.dot
Successfully produced net in file /tmp/petri1031_3550330325996155735.dot
Successfully produced net in file /tmp/petri1032_1203294753641387598.dot
Successfully produced net in file /tmp/petri1033_3493844272744991150.dot
Successfully produced net in file /tmp/petri1034_18068057423261351954.dot
Successfully produced net in file /tmp/petri1035_5065955773266572627.dot
Drop transitions removed 36 transitions
Dominated transitions for bounds rules discarded 36 transitions
Normalized transition count is 155 out of 189 initially.
// Phase 1: matrix 155 rows 39 cols
[2024-06-02 21:03:27] [INFO ] Computed 11 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 255391 resets, run finished after 4563 ms. (steps per millisecond=219 ) properties (out of 1) seen :1
FORMULA MedleyA-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10851 ms.

BK_STOP 1717362213323

--------------------
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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r597-smll-171734926400046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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