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.r039-tajo-167813692600509.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 lolaxred
Input is BusinessProcesses-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 91K 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-08-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678502186476

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 02:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:36:28] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-11 02:36:28] [INFO ] Transformed 393 places.
[2023-03-11 02:36:28] [INFO ] Transformed 344 transitions.
[2023-03-11 02:36:28] [INFO ] Found NUPN structural information;
[2023-03-11 02:36:28] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 331 rows 380 cols
[2023-03-11 02:36:28] [INFO ] Computed 58 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :10
FORMULA BusinessProcesses-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 02:36:28] [INFO ] Invariant cache hit.
[2023-03-11 02:36:28] [INFO ] [Real]Absence check using 44 positive place invariants in 16 ms returned sat
[2023-03-11 02:36:28] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-11 02:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:28] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-11 02:36:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:28] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-11 02:36:28] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2023-03-11 02:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:28] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 0 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-11 02:36:29] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 0 ms to minimize.
[2023-03-11 02:36:30] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:36:30] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2023-03-11 02:36:30] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1165 ms
[2023-03-11 02:36:30] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 25 ms.
[2023-03-11 02:36:30] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2023-03-11 02:36:30] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:36:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-03-11 02:36:31] [INFO ] Added : 229 causal constraints over 47 iterations in 918 ms. Result :sat
Minimization took 79 ms.
[2023-03-11 02:36:31] [INFO ] [Real]Absence check using 44 positive place invariants in 16 ms returned sat
[2023-03-11 02:36:31] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-11 02:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:31] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-11 02:36:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:31] [INFO ] [Nat]Absence check using 44 positive place invariants in 14 ms returned sat
[2023-03-11 02:36:31] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-11 02:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:31] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-11 02:36:31] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:36:31] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2023-03-11 02:36:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-11 02:36:31] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-11 02:36:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 301 ms
[2023-03-11 02:36:31] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 34 ms.
[2023-03-11 02:36:32] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2023-03-11 02:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-11 02:36:32] [INFO ] Added : 195 causal constraints over 41 iterations in 939 ms. Result :sat
Minimization took 48 ms.
[2023-03-11 02:36:32] [INFO ] [Real]Absence check using 44 positive place invariants in 14 ms returned sat
[2023-03-11 02:36:32] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-11 02:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:33] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-11 02:36:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-11 02:36:33] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-11 02:36:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:33] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2023-03-11 02:36:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 716 ms
[2023-03-11 02:36:33] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 27 ms.
[2023-03-11 02:36:34] [INFO ] Added : 195 causal constraints over 40 iterations in 777 ms. Result :sat
Minimization took 59 ms.
[2023-03-11 02:36:34] [INFO ] [Real]Absence check using 44 positive place invariants in 17 ms returned sat
[2023-03-11 02:36:34] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 02:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:35] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-11 02:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:35] [INFO ] [Nat]Absence check using 44 positive place invariants in 16 ms returned sat
[2023-03-11 02:36:35] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-11 02:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:35] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-11 02:36:35] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:36:35] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-11 02:36:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-11 02:36:35] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2023-03-11 02:36:35] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-11 02:36:35] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:36:36] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 0 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:36:37] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2326 ms
[2023-03-11 02:36:37] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 21 ms.
[2023-03-11 02:36:38] [INFO ] Added : 212 causal constraints over 43 iterations in 844 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA BusinessProcesses-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 10765 ms.
ITS solved all properties within timeout

BK_STOP 1678502199023

--------------------
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="BusinessProcesses-PT-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-08, 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 r039-tajo-167813692600509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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