Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600063.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is BusinessProcesses-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:22 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 BusinessProcesses-PT-07-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678933624793

Running Version 202205111006
[2023-03-16 02:27:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 02:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:27:06] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-16 02:27:06] [INFO ] Transformed 386 places.
[2023-03-16 02:27:06] [INFO ] Transformed 360 transitions.
[2023-03-16 02:27:06] [INFO ] Found NUPN structural information;
[2023-03-16 02:27:06] [INFO ] Parsed PT model containing 386 places and 360 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 360 rows 386 cols
[2023-03-16 02:27:06] [INFO ] Computed 62 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 109 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :13
FORMULA BusinessProcesses-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
// Phase 1: matrix 360 rows 386 cols
[2023-03-16 02:27:06] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-16 02:27:06] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-16 02:27:06] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-16 02:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:06] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-16 02:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-16 02:27:06] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-16 02:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:06] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-16 02:27:07] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2023-03-16 02:27:07] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-16 02:27:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-16 02:27:07] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 23 ms.
[2023-03-16 02:27:07] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-03-16 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-16 02:27:08] [INFO ] Added : 163 causal constraints over 33 iterations in 910 ms. Result :sat
Minimization took 82 ms.
[2023-03-16 02:27:08] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2023-03-16 02:27:08] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-16 02:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:08] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-16 02:27:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-16 02:27:08] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-16 02:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:08] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-16 02:27:08] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2023-03-16 02:27:08] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-16 02:27:08] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 1 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 1 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 1 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 1 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2023-03-16 02:27:09] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 1 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 0 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 0 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 0 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 1 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 0 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 0 ms to minimize.
[2023-03-16 02:27:10] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 0 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 0 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 0 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 0 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 0 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3057 ms
[2023-03-16 02:27:11] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 17 ms.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 0 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 101 places in 72 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 0 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA BusinessProcesses-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 386 places. Attempting structural reductions.
Application raised an uncaught exception Index 385 out of bounds for length 360
java.lang.IndexOutOfBoundsException: Index 385 out of bounds for length 360
at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64)
at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70)
at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248)
at java.base/java.util.Objects.checkIndex(Objects.java:372)
at java.base/java.util.ArrayList.get(ArrayList.java:459)
at fr.lip6.move.gal.util.IntMatrixCol.getColumn(IntMatrixCol.java:161)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:264)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Total runtime 7518 ms.

BK_STOP 1678933633567

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BusinessProcesses-PT-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is BusinessProcesses-PT-07, 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 r063-tajo-167813711600063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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