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.r199-smll-167840345700277.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 lolaxred
Input is HealthRecord-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345700277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 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 67K 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 HealthRecord-PT-06-UpperBounds-00
FORMULA_NAME HealthRecord-PT-06-UpperBounds-01
FORMULA_NAME HealthRecord-PT-06-UpperBounds-02
FORMULA_NAME HealthRecord-PT-06-UpperBounds-03
FORMULA_NAME HealthRecord-PT-06-UpperBounds-04
FORMULA_NAME HealthRecord-PT-06-UpperBounds-05
FORMULA_NAME HealthRecord-PT-06-UpperBounds-06
FORMULA_NAME HealthRecord-PT-06-UpperBounds-07
FORMULA_NAME HealthRecord-PT-06-UpperBounds-08
FORMULA_NAME HealthRecord-PT-06-UpperBounds-09
FORMULA_NAME HealthRecord-PT-06-UpperBounds-10
FORMULA_NAME HealthRecord-PT-06-UpperBounds-11
FORMULA_NAME HealthRecord-PT-06-UpperBounds-12
FORMULA_NAME HealthRecord-PT-06-UpperBounds-13
FORMULA_NAME HealthRecord-PT-06-UpperBounds-14
FORMULA_NAME HealthRecord-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678504971996

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=HealthRecord-PT-06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:22:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 03:22:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:22:54] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-11 03:22:54] [INFO ] Transformed 154 places.
[2023-03-11 03:22:54] [INFO ] Transformed 319 transitions.
[2023-03-11 03:22:54] [INFO ] Found NUPN structural information;
[2023-03-11 03:22:54] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Normalized transition count is 282 out of 294 initially.
// Phase 1: matrix 282 rows 154 cols
[2023-03-11 03:22:54] [INFO ] Computed 18 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 510 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :11
FORMULA HealthRecord-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 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 68 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
[2023-03-11 03:22:55] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2023-03-11 03:22:55] [INFO ] Computed 18 place invariants in 15 ms
[2023-03-11 03:22:55] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-11 03:22:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-11 03:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:55] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-11 03:22:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:22:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 03:22:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 03:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:55] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-11 03:22:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 03:22:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 03:22:56] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 44 ms.
[2023-03-11 03:22:56] [INFO ] Added : 11 causal constraints over 3 iterations in 142 ms. Result :sat
Minimization took 28 ms.
[2023-03-11 03:22:56] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:56] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-11 03:22:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:22:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:56] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2023-03-11 03:22:56] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 32 ms.
[2023-03-11 03:22:56] [INFO ] Added : 24 causal constraints over 6 iterations in 162 ms. Result :sat
Minimization took 29 ms.
[2023-03-11 03:22:56] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 03:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:56] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-11 03:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:22:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:57] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-11 03:22:57] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 33 ms.
[2023-03-11 03:22:57] [INFO ] Added : 6 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 25 ms.
[2023-03-11 03:22:57] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:57] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-11 03:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:22:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:57] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-11 03:22:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-11 03:22:58] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 9 ms to minimize.
[2023-03-11 03:22:58] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2023-03-11 03:22:58] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2023-03-11 03:22:58] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2023-03-11 03:22:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 484 ms
[2023-03-11 03:22:58] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 54 ms.
[2023-03-11 03:22:58] [INFO ] Added : 15 causal constraints over 3 iterations in 172 ms. Result :sat
Minimization took 48 ms.
[2023-03-11 03:22:58] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 03:22:58] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 03:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:58] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-11 03:22:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:22:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 03:22:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 03:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:59] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-11 03:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 03:22:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2023-03-11 03:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-11 03:22:59] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 40 ms.
[2023-03-11 03:22:59] [INFO ] Added : 13 causal constraints over 3 iterations in 154 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 231 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 7 ms
Free SCC test removed 7 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 636 edges and 147 vertex of which 113 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.3 ms
Discarding 34 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 113 transition count 142
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 178 place count 41 transition count 70
Iterating global reduction 1 with 72 rules applied. Total rules applied 250 place count 41 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 250 place count 41 transition count 67
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 256 place count 38 transition count 67
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 265 place count 29 transition count 58
Iterating global reduction 1 with 9 rules applied. Total rules applied 274 place count 29 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 283 place count 29 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 284 place count 28 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 28 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 28 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 292 place count 25 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 25 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 294 place count 24 transition count 42
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 297 place count 22 transition count 41
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 308 place count 22 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 21 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 311 place count 20 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 312 place count 20 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 20 transition count 27
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 317 place count 20 transition count 23
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 321 place count 16 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 322 place count 16 transition count 23
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 323 place count 16 transition count 22
Applied a total of 323 rules in 82 ms. Remains 16 /154 variables (removed 138) and now considering 22/294 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 16/154 places, 22/294 transitions.
// Phase 1: matrix 22 rows 16 cols
[2023-03-11 03:22:59] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 75235 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5937 ms.
ITS solved all properties within timeout

BK_STOP 1678504981597

--------------------
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="HealthRecord-PT-06"
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 HealthRecord-PT-06, 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 r199-smll-167840345700277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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