fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699100486
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.950 25105.00 46484.00 109.70 TFFFFFFFTTTTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100486.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K Mar 24 05:37 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589250843322

[2020-05-12 02:34:06] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:34:06] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-05-12 02:34:06] [INFO ] Transformed 368 places.
[2020-05-12 02:34:06] [INFO ] Transformed 319 transitions.
[2020-05-12 02:34:06] [INFO ] Found NUPN structural information;
[2020-05-12 02:34:06] [INFO ] Parsed PT model containing 368 places and 319 transitions in 107 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 98 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:34:06] [INFO ] Computed 57 place invariants in 11 ms
[2020-05-12 02:34:06] [INFO ] [Real]Absence check using 41 positive place invariants in 61 ms returned sat
[2020-05-12 02:34:06] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 32 ms returned sat
[2020-05-12 02:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:07] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2020-05-12 02:34:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 356 ms returned sat
[2020-05-12 02:34:07] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 104 ms returned sat
[2020-05-12 02:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:09] [INFO ] [Nat]Absence check using state equation in 2164 ms returned sat
[2020-05-12 02:34:10] [INFO ] Deduced a trap composed of 14 places in 590 ms
[2020-05-12 02:34:11] [INFO ] Deduced a trap composed of 13 places in 743 ms
[2020-05-12 02:34:11] [INFO ] Deduced a trap composed of 19 places in 294 ms
[2020-05-12 02:34:11] [INFO ] Deduced a trap composed of 9 places in 214 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 8 places in 1543 ms
[2020-05-12 02:34:13] [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 s131 s134 s212 s213 s214) 0)") while checking expression at index 0
[2020-05-12 02:34:13] [INFO ] [Real]Absence check using 41 positive place invariants in 47 ms returned unsat
[2020-05-12 02:34:13] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2020-05-12 02:34:13] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2020-05-12 02:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:14] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2020-05-12 02:34:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:14] [INFO ] [Nat]Absence check using 41 positive place invariants in 67 ms returned sat
[2020-05-12 02:34:14] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 85 ms returned sat
[2020-05-12 02:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:14] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 10 places in 92 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 25 places in 150 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 84 places in 135 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 24 places in 75 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 34 places in 120 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 30 places in 108 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 39 places in 100 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 13 places in 163 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 20 places in 119 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 30 places in 107 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 40 places in 112 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 33 places in 104 ms
[2020-05-12 02:34:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2005 ms
[2020-05-12 02:34:16] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 14 ms.
[2020-05-12 02:34:18] [INFO ] Added : 193 causal constraints over 39 iterations in 1235 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-12 02:34:18] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned sat
[2020-05-12 02:34:18] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 104 ms returned sat
[2020-05-12 02:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:19] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2020-05-12 02:34:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:19] [INFO ] [Nat]Absence check using 41 positive place invariants in 246 ms returned sat
[2020-05-12 02:34:19] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2020-05-12 02:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:20] [INFO ] [Nat]Absence check using state equation in 1022 ms returned sat
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 12 places in 459 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 16 places in 188 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 22 places in 168 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 10 places in 75 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2020-05-12 02:34:22] [INFO ] Deduced a trap composed of 11 places in 797 ms
[2020-05-12 02:34:22] [INFO ] Deduced a trap composed of 25 places in 169 ms
[2020-05-12 02:34:22] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-05-12 02:34:25] [INFO ] Deduced a trap composed of 20 places in 2645 ms
[2020-05-12 02:34:25] [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 s37 s38 s44 s45 s121 s172 s173 s174 s177 s178 s179 s183 s188 s362 s363) 0)") while checking expression at index 3
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 17800 steps, including 108 resets, run finished after 85 ms. (steps per millisecond=209 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 218 edges and 367 vertex of which 5 / 367 are part of one of the 1 SCC in 17 ms
Free SCC test removed 4 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 704 edges and 363 vertex of which 360 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 360 transition count 225
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 180 place count 274 transition count 225
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 180 place count 274 transition count 181
Deduced a syphon composed of 44 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 279 place count 219 transition count 181
Symmetric choice reduction at 2 with 55 rule applications. Total rules 334 place count 219 transition count 181
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 55 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 444 place count 164 transition count 126
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 444 place count 164 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 459 place count 155 transition count 120
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 567 place count 101 transition count 66
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 568 place count 101 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 100 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 570 place count 99 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 571 place count 98 transition count 64
Applied a total of 571 rules in 138 ms. Remains 98 /367 variables (removed 269) and now considering 64/318 (removed 254) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/367 places, 64/318 transitions.
Incomplete random walk after 1000000 steps, including 56783 resets, run finished after 1431 ms. (steps per millisecond=698 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 18587 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties seen :[0]
// Phase 1: matrix 64 rows 98 cols
[2020-05-12 02:34:27] [INFO ] Computed 40 place invariants in 1 ms
[2020-05-12 02:34:27] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2020-05-12 02:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:27] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-12 02:34:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2020-05-12 02:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:27] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 11 places in 99 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2020-05-12 02:34:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 145 ms
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589250868427

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itstools"
echo " Input is BusinessProcesses-PT-05, 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 r021-oct2-158897699100486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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