Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000207.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 146K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620938281346

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:38:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:38:03] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-13 20:38:03] [INFO ] Transformed 586 places.
[2021-05-13 20:38:03] [INFO ] Transformed 525 transitions.
[2021-05-13 20:38:03] [INFO ] Found NUPN structural information;
[2021-05-13 20:38:03] [INFO ] Parsed PT model containing 586 places and 525 transitions in 118 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 521 rows 582 cols
[2021-05-13 20:38:03] [INFO ] Computed 98 place invariants in 24 ms
[2021-05-13 20:38:03] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2021-05-13 20:38:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-13 20:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:04] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2021-05-13 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:38:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 70 ms returned sat
[2021-05-13 20:38:04] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 25 ms returned sat
[2021-05-13 20:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:05] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2021-05-13 20:38:05] [INFO ] Deduced a trap composed of 10 places in 220 ms
[2021-05-13 20:38:06] [INFO ] Deduced a trap composed of 15 places in 213 ms
[2021-05-13 20:38:06] [INFO ] Deduced a trap composed of 20 places in 198 ms
[2021-05-13 20:38:06] [INFO ] Deduced a trap composed of 29 places in 190 ms
[2021-05-13 20:38:06] [INFO ] Deduced a trap composed of 14 places in 182 ms
[2021-05-13 20:38:07] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2021-05-13 20:38:07] [INFO ] Deduced a trap composed of 8 places in 180 ms
[2021-05-13 20:38:07] [INFO ] Deduced a trap composed of 17 places in 223 ms
[2021-05-13 20:38:07] [INFO ] Deduced a trap composed of 122 places in 196 ms
[2021-05-13 20:38:07] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2021-05-13 20:38:08] [INFO ] Deduced a trap composed of 38 places in 245 ms
[2021-05-13 20:38:08] [INFO ] Deduced a trap composed of 18 places in 244 ms
[2021-05-13 20:38:08] [INFO ] Deduced a trap composed of 27 places in 201 ms
[2021-05-13 20:38:08] [INFO ] Deduced a trap composed of 25 places in 203 ms
[2021-05-13 20:38:09] [INFO ] Deduced a trap composed of 26 places in 187 ms
[2021-05-13 20:38:09] [INFO ] Deduced a trap composed of 107 places in 184 ms
[2021-05-13 20:38:09] [INFO ] Deduced a trap composed of 28 places in 150 ms
[2021-05-13 20:38:09] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2021-05-13 20:38:09] [INFO ] Deduced a trap composed of 25 places in 162 ms
[2021-05-13 20:38:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s27 s28 s31 s223 s224 s228 s229 s230 s236 s239 s269 s270 s271 s379 s393 s394 s395 s399 s404 s409 s525 s526) 0)") while checking expression at index 0
[2021-05-13 20:38:10] [INFO ] [Real]Absence check using 55 positive place invariants in 36 ms returned sat
[2021-05-13 20:38:10] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2021-05-13 20:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:10] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2021-05-13 20:38:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:38:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 59 ms returned sat
[2021-05-13 20:38:10] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2021-05-13 20:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:11] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 14 places in 205 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 13 places in 258 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 107 places in 226 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 26 places in 208 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 11 places in 172 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 121 places in 215 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 20 places in 254 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 16 places in 209 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 22 places in 171 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 113 places in 171 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 30 places in 195 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 126 places in 216 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 30 places in 204 ms
[2021-05-13 20:38:15] [INFO ] Deduced a trap composed of 45 places in 214 ms
[2021-05-13 20:38:15] [INFO ] Deduced a trap composed of 115 places in 164 ms
[2021-05-13 20:38:15] [INFO ] Deduced a trap composed of 115 places in 221 ms
[2021-05-13 20:38:15] [INFO ] Deduced a trap composed of 25 places in 233 ms
[2021-05-13 20:38:15] [INFO ] Deduced a trap composed of 23 places in 232 ms
[2021-05-13 20:38:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s156 s159 s160 s161 s338 s339 s340) 0)") while checking expression at index 1
[2021-05-13 20:38:16] [INFO ] [Real]Absence check using 55 positive place invariants in 46 ms returned sat
[2021-05-13 20:38:16] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2021-05-13 20:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:16] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 18 places in 146 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 25 places in 169 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 20 places in 153 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 35 places in 159 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 46 places in 160 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 33 places in 156 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 25 places in 130 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 31 places in 148 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 25 places in 121 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 36 places in 135 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 54 places in 117 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 31 places in 106 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 34 places in 112 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2021-05-13 20:38:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s26 s29 s30 s31 s32 s240 s379 s393 s394 s395 s399 s404 s407 s409 s410 s411 s428 s429 s432 s525 s526 s535 s536 s539 s540) 0)") while checking expression at index 2
[2021-05-13 20:38:21] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2021-05-13 20:38:21] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 32 ms returned sat
[2021-05-13 20:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:22] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2021-05-13 20:38:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:38:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 64 ms returned sat
[2021-05-13 20:38:22] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 32 ms returned sat
[2021-05-13 20:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:22] [INFO ] [Nat]Absence check using state equation in 593 ms returned unsat
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 5 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 324 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 572 transition count 387
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 260 place count 447 transition count 387
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 260 place count 447 transition count 297
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 457 place count 340 transition count 297
Symmetric choice reduction at 2 with 70 rule applications. Total rules 527 place count 340 transition count 297
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 70 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 667 place count 270 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 667 place count 270 transition count 221
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 680 place count 263 transition count 221
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 861 place count 171 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 863 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 865 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 867 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 868 place count 168 transition count 134
Applied a total of 868 rules in 117 ms. Remains 168 /582 variables (removed 414) and now considering 134/521 (removed 387) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/582 places, 134/521 transitions.
Finished random walk after 2662 steps, including 85 resets, run visited all 3 properties in 15 ms. (steps per millisecond=177 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;