fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r489-tall-167912707400925
Last Updated
May 14, 2023

About the Execution of LTSMin+red for TwoPhaseLocking-PT-nC05000vN

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
434.855 5090.00 8254.00 310.60 2501 2500 2500 2501 2500 2501 2501 2500 2500 2501 2501 2500 2500 2500 2500 2500 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707400925.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is TwoPhaseLocking-PT-nC05000vN, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707400925
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.1K Feb 25 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 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 TwoPhaseLocking-PT-nC05000vN-UpperBounds-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679334413864

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC05000vN
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 17:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 17:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 17:46:55] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-03-20 17:46:55] [INFO ] Transformed 8 places.
[2023-03-20 17:46:55] [INFO ] Transformed 6 transitions.
[2023-03-20 17:46:55] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 17:46:55] [INFO ] Computed 3 place invariants in 6 ms
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-11 2500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-05 2501 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-00 2501 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10006 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :10000
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-15 2500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-14 2500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-08 2500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-02 2500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :489
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :1048
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :505
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :1036
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :533
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :1032
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :1036
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 9) seen :163
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 9) seen :533
[2023-03-20 17:46:55] [INFO ] Invariant cache hit.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 17:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 17:46:55] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-20 17:46:55] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:55] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-20 17:46:55] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 17:46:56] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-20 17:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 17:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 17:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:46:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-20 17:46:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:46:56] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [2500, 2501, 2500, 2501, 2500, 2501, 2501, 2500, 2500] Max seen :[119, 262, 119, 262, 119, 262, 262, 159, 119]
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-13 2500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-12 2500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-07 2500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-04 2500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-01 2500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-10 2501 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-09 2501 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-06 2501 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vN-UpperBounds-03 2501 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 2608 ms.
ITS solved all properties within timeout

BK_STOP 1679334418954

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="TwoPhaseLocking-PT-nC05000vN"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is TwoPhaseLocking-PT-nC05000vN, 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 r489-tall-167912707400925"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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