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.r351-tall-171679102300406.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 ServersAndClients-PT-200040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102300406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.1M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-00
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-01
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-02
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-03
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-04
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-05
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-06
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-07
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-08
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-09
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-10
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-11
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-12
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-13
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-14
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716894668845

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=ServersAndClients-PT-200040
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 11:11:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 11:11:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:11:10] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-28 11:11:10] [INFO ] Transformed 8841 places.
[2024-05-28 11:11:11] [INFO ] Transformed 16400 transitions.
[2024-05-28 11:11:11] [INFO ] Found NUPN structural information;
[2024-05-28 11:11:11] [INFO ] Parsed PT model containing 8841 places and 16400 transitions and 49600 arcs in 623 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 16400 rows 8841 cols
[2024-05-28 11:11:11] [INFO ] Computed 441 invariants in 327 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 16) seen :3
FORMULA ServersAndClients-PT-200040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :1
FORMULA ServersAndClients-PT-200040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :1
FORMULA ServersAndClients-PT-200040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
[2024-05-28 11:11:12] [INFO ] Invariant cache hit.
[2024-05-28 11:11:15] [INFO ] [Real]Absence check using 241 positive place invariants in 702 ms returned sat
[2024-05-28 11:11:15] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 157 ms returned sat
[2024-05-28 11:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:17] [INFO ] [Real]Absence check using state equation in 2464 ms returned unknown
[2024-05-28 11:11:19] [INFO ] [Real]Absence check using 241 positive place invariants in 683 ms returned sat
[2024-05-28 11:11:19] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 165 ms returned sat
[2024-05-28 11:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:22] [INFO ] [Real]Absence check using state equation in 2815 ms returned unknown
[2024-05-28 11:11:24] [INFO ] [Real]Absence check using 241 positive place invariants in 687 ms returned sat
[2024-05-28 11:11:24] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 148 ms returned sat
[2024-05-28 11:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:27] [INFO ] [Real]Absence check using state equation in 2796 ms returned unknown
[2024-05-28 11:11:29] [INFO ] [Real]Absence check using 241 positive place invariants in 675 ms returned sat
[2024-05-28 11:11:29] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 153 ms returned sat
[2024-05-28 11:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:32] [INFO ] [Real]Absence check using state equation in 2876 ms returned unknown
[2024-05-28 11:11:34] [INFO ] [Real]Absence check using 241 positive place invariants in 701 ms returned sat
[2024-05-28 11:11:34] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 167 ms returned sat
[2024-05-28 11:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:37] [INFO ] [Real]Absence check using state equation in 2826 ms returned unknown
[2024-05-28 11:11:39] [INFO ] [Real]Absence check using 241 positive place invariants in 665 ms returned sat
[2024-05-28 11:11:39] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 154 ms returned sat
[2024-05-28 11:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:42] [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: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-28 11:11:44] [INFO ] [Real]Absence check using 241 positive place invariants in 701 ms returned sat
[2024-05-28 11:11:44] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 159 ms returned sat
[2024-05-28 11:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:47] [INFO ] [Real]Absence check using state equation in 2807 ms returned unknown
[2024-05-28 11:11:49] [INFO ] [Real]Absence check using 241 positive place invariants in 688 ms returned sat
[2024-05-28 11:11:49] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 184 ms returned sat
[2024-05-28 11:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:52] [INFO ] [Real]Absence check using state equation in 2796 ms returned unknown
[2024-05-28 11:11:54] [INFO ] [Real]Absence check using 241 positive place invariants in 785 ms returned sat
[2024-05-28 11:11:55] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 183 ms returned sat
[2024-05-28 11:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:11:57] [INFO ] [Real]Absence check using state equation in 2697 ms returned unknown
[2024-05-28 11:11:59] [INFO ] [Real]Absence check using 241 positive place invariants in 689 ms returned sat
[2024-05-28 11:12:00] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 169 ms returned sat
[2024-05-28 11:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:12:02] [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: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-28 11:12:04] [INFO ] [Real]Absence check using 241 positive place invariants in 689 ms returned sat
[2024-05-28 11:12:04] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 170 ms returned sat
[2024-05-28 11:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 11:12:07] [INFO ] [Real]Absence check using state equation in 2914 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7989 transitions
Trivial Post-agglo rules discarded 7989 transitions
Performed 7989 trivial Post agglomeration. Transition count delta: 7989
Iterating post reduction 0 with 7989 rules applied. Total rules applied 7989 place count 8841 transition count 8411
Reduce places removed 8020 places and 0 transitions.
Ensure Unique test removed 6000 transitions
Reduce isomorphic transitions removed 6000 transitions.
Iterating post reduction 1 with 14020 rules applied. Total rules applied 22009 place count 821 transition count 2411
Drop transitions removed 1789 transitions
Redundant transition composition rules discarded 1789 transitions
Iterating global reduction 2 with 1789 rules applied. Total rules applied 23798 place count 821 transition count 622
Discarding 189 places :
Implicit places reduction removed 189 places
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 2 with 567 rules applied. Total rules applied 24365 place count 632 transition count 244
Reduce places removed 567 places and 0 transitions.
Drop transitions removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Iterating post reduction 3 with 756 rules applied. Total rules applied 25121 place count 65 transition count 55
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 25132 place count 65 transition count 55
Applied a total of 25132 rules in 335 ms. Remains 65 /8841 variables (removed 8776) and now considering 55/16400 (removed 16345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 65/8841 places, 55/16400 transitions.
// Phase 1: matrix 55 rows 65 cols
[2024-05-28 11:12:08] [INFO ] Computed 32 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1388 ms. (steps per millisecond=720 ) properties (out of 11) seen :11
FORMULA ServersAndClients-PT-200040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 59158 ms.

BK_STOP 1716894730515

--------------------
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="ServersAndClients-PT-200040"
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 ServersAndClients-PT-200040, 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 r351-tall-171679102300406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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