Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107900421.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LamportFastMutEx-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 15K Mar 7 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 7 16:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Mar 15 11:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 15 11:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 15 11:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 15 11:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Mar 7 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 7 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Mar 7 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Mar 7 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Mar 15 11:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 157K Mar 3 18:30 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 LamportFastMutEx-PT-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779880849115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 11:20:51] [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]
[2026-05-27 11:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 11:20:51] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2026-05-27 11:20:51] [INFO ] Transformed 174 places.
[2026-05-27 11:20:51] [INFO ] Transformed 318 transitions.
[2026-05-27 11:20:51] [INFO ] Found NUPN structural information;
[2026-05-27 11:20:51] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2026-05-27 11:20:52] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[5, 5, 5, 5, 5, 5, 5, 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] Max Struct:[5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16296267482478326413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6740185531650438421.kers'
[2026-05-27 11:20:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16296267482478326413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6740185531650438421.kers]
Normalized transition count is 200 out of 260 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 200 rows 132 cols 620 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-27 11:20:52] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6740185531650438421.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 82 ms. (120 steps per ms)
FORMULA LamportFastMutEx-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 107 ms. (463 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 4, 4, 4] Max Struct:[5, 5, 5, 5, 5]
[2026-05-27 11:20:52] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7461183892992582509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7994078640783450456.kers'
[2026-05-27 11:20:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7461183892992582509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7994078640783450456.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 200 rows 132 cols 620 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-27 11:20:52] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7994078640783450456.kers
Total runtime 2 ms.
[2026-05-27 11:20:52] [INFO ] [Real]Absence check using 37 positive place invariants in 34 ms returned sat
[2026-05-27 11:20:52] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2026-05-27 11:20:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-27 11:20:52] [INFO ] [Real]Added 55 Read/Feed constraints in 24 ms returned sat
[2026-05-27 11:20:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 11:20:53] [INFO ] [Nat]Absence check using 37 positive place invariants in 32 ms returned sat
[2026-05-27 11:20:53] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2026-05-27 11:20:53] [INFO ] [Nat]Added 55 Read/Feed constraints in 37 ms returned sat
[2026-05-27 11:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 981 ms
[2026-05-27 11:20:54] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2026-05-27 11:20:54] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-27 11:20:54] [INFO ] [Real]Added 55 Read/Feed constraints in 25 ms returned sat
[2026-05-27 11:20:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 11:20:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 24 ms returned sat
[2026-05-27 11:20:54] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2026-05-27 11:20:55] [INFO ] [Nat]Added 55 Read/Feed constraints in 60 ms returned sat
[2026-05-27 11:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 2833 ms
[2026-05-27 11:20:57] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2026-05-27 11:20:58] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2026-05-27 11:20:58] [INFO ] [Real]Added 55 Read/Feed constraints in 31 ms returned sat
[2026-05-27 11:20:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 11:20:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2026-05-27 11:20:58] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-05-27 11:20:58] [INFO ] [Nat]Added 55 Read/Feed constraints in 50 ms returned sat
[2026-05-27 11:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 858 ms
[2026-05-27 11:20:59] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2026-05-27 11:20:59] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-27 11:20:59] [INFO ] [Real]Added 55 Read/Feed constraints in 11 ms returned sat
[2026-05-27 11:20:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 11:20:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2026-05-27 11:20:59] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-27 11:20:59] [INFO ] [Nat]Added 55 Read/Feed constraints in 25 ms returned sat
[2026-05-27 11:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1130 ms
[2026-05-27 11:21:01] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2026-05-27 11:21:01] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-27 11:21:01] [INFO ] [Real]Added 55 Read/Feed constraints in 12 ms returned sat
[2026-05-27 11:21:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 11:21:01] [INFO ] [Nat]Absence check using 37 positive place invariants in 24 ms returned sat
[2026-05-27 11:21:01] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2026-05-27 11:21:01] [INFO ] [Nat]Added 55 Read/Feed constraints in 30 ms returned sat
[2026-05-27 11:21:01] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 34 ms.
[2026-05-27 11:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2026-05-27 11:21:02] [INFO ] Added : 65 causal constraints over 14 iterations in 754 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 4, 4, 4] Max Struct:[4, 4, 4, 4, 5]
FORMULA LamportFastMutEx-PT-5-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[5]
FORMULA LamportFastMutEx-PT-5-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
All properties solved without resorting to model-checking.
Total runtime 11125 ms.

BK_STOP 1779880862775

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="LamportFastMutEx-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5973"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-5, 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 r162-smll-177961107900421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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