Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640602200717.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602200717
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Apr 12 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:42 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-03-UpperBounds-00
FORMULA_NAME HealthRecord-PT-03-UpperBounds-01
FORMULA_NAME HealthRecord-PT-03-UpperBounds-02
FORMULA_NAME HealthRecord-PT-03-UpperBounds-03
FORMULA_NAME HealthRecord-PT-03-UpperBounds-04
FORMULA_NAME HealthRecord-PT-03-UpperBounds-05
FORMULA_NAME HealthRecord-PT-03-UpperBounds-06
FORMULA_NAME HealthRecord-PT-03-UpperBounds-07
FORMULA_NAME HealthRecord-PT-03-UpperBounds-08
FORMULA_NAME HealthRecord-PT-03-UpperBounds-09
FORMULA_NAME HealthRecord-PT-03-UpperBounds-10
FORMULA_NAME HealthRecord-PT-03-UpperBounds-11
FORMULA_NAME HealthRecord-PT-03-UpperBounds-12
FORMULA_NAME HealthRecord-PT-03-UpperBounds-13
FORMULA_NAME HealthRecord-PT-03-UpperBounds-14
FORMULA_NAME HealthRecord-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716490263210

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:51:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 18:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:51:04] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-23 18:51:04] [INFO ] Transformed 121 places.
[2024-05-23 18:51:04] [INFO ] Transformed 232 transitions.
[2024-05-23 18:51:04] [INFO ] Found NUPN structural information;
[2024-05-23 18:51:04] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
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, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 18:51:04] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2024-05-23 18:51:04] [INFO ] Computed 14 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (660 resets) in 27 ms. (357 steps per ms)
FORMULA HealthRecord-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (406 resets) in 38 ms. (1025 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-23 18:51:04] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
[2024-05-23 18:51:04] [INFO ] Invariant cache hit.
[2024-05-23 18:51:04] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-23 18:51:04] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-23 18:51:04] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-23 18:51:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:51:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:51:05] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 8 ms to minimize.
[2024-05-23 18:51:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:51:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:51:05] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-23 18:51:05] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:51:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-05-23 18:51:05] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 15 ms.
[2024-05-23 18:51:05] [INFO ] Added : 16 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 107 ms.
[2024-05-23 18:51:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-23 18:51:05] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-23 18:51:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:51:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-23 18:51:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:51:05] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-23 18:51:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-23 18:51:05] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 20 ms.
[2024-05-23 18:51:06] [INFO ] Added : 17 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 91 ms.
[2024-05-23 18:51:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:51:06] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-23 18:51:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:51:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-23 18:51:06] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-23 18:51:06] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 13 ms.
[2024-05-23 18:51:06] [INFO ] Added : 17 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 91 ms.
[2024-05-23 18:51:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:51:06] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 24 ms.
[2024-05-23 18:51:06] [INFO ] Added : 7 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 99 ms.
[2024-05-23 18:51:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:51:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-23 18:51:06] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:51:07] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-23 18:51:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 18:51:07] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 17 ms.
[2024-05-23 18:51:07] [INFO ] Added : 7 causal constraints over 2 iterations in 64 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 176 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 429 edges and 116 vertex of which 90 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 90 transition count 108
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 138 place count 37 transition count 55
Iterating global reduction 1 with 53 rules applied. Total rules applied 191 place count 37 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 191 place count 37 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 201 place count 32 transition count 50
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 213 place count 20 transition count 34
Iterating global reduction 1 with 12 rules applied. Total rules applied 225 place count 20 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 229 place count 20 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 232 place count 17 transition count 25
Iterating global reduction 2 with 3 rules applied. Total rules applied 235 place count 17 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 17 transition count 24
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 238 place count 15 transition count 22
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 15 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 15 transition count 20
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 244 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 13 transition count 18
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 249 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 253 place count 9 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 253 place count 9 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 255 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 8 transition count 12
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 6 with 2 rules applied. Total rules applied 258 place count 7 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 259 place count 7 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 262 place count 6 transition count 8
Applied a total of 262 rules in 40 ms. Remains 6 /121 variables (removed 115) and now considering 8/225 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 6/121 places, 8/225 transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-23 18:51:07] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (115315 resets) in 382 ms. (2610 steps per ms)
FORMULA HealthRecord-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (50205 resets) in 217 ms. (4587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3597 ms.
ITS solved all properties within timeout

BK_STOP 1716490268000

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-03, 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 r179-tall-171640602200717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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