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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.100 29382.00 51477.00 331.20 FFFFTTTTFTFFTTFF 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-158897699200526.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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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.6K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.2K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:38 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589252263242

[2020-05-12 02:57:47] [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:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:57:47] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2020-05-12 02:57:47] [INFO ] Transformed 518 places.
[2020-05-12 02:57:47] [INFO ] Transformed 471 transitions.
[2020-05-12 02:57:47] [INFO ] Found NUPN structural information;
[2020-05-12 02:57:47] [INFO ] Parsed PT model containing 518 places and 471 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 74 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 108 ms. (steps per millisecond=92 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 471 rows 518 cols
[2020-05-12 02:57:48] [INFO ] Computed 85 place invariants in 69 ms
[2020-05-12 02:57:48] [INFO ] [Real]Absence check using 48 positive place invariants in 58 ms returned sat
[2020-05-12 02:57:48] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 42 ms returned sat
[2020-05-12 02:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:57:50] [INFO ] [Real]Absence check using state equation in 1834 ms returned sat
[2020-05-12 02:57:51] [INFO ] Deduced a trap composed of 11 places in 512 ms
[2020-05-12 02:57:51] [INFO ] Deduced a trap composed of 17 places in 149 ms
[2020-05-12 02:57:51] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2020-05-12 02:57:51] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-12 02:57:51] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2020-05-12 02:57:52] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-05-12 02:57:52] [INFO ] Deduced a trap composed of 34 places in 111 ms
[2020-05-12 02:57:52] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-05-12 02:57:52] [INFO ] Deduced a trap composed of 24 places in 100 ms
[2020-05-12 02:57:52] [INFO ] Deduced a trap composed of 32 places in 100 ms
[2020-05-12 02:57:52] [INFO ] Deduced a trap composed of 23 places in 86 ms
[2020-05-12 02:57:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1895 ms
[2020-05-12 02:57:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:57:52] [INFO ] [Nat]Absence check using 48 positive place invariants in 65 ms returned sat
[2020-05-12 02:57:52] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2020-05-12 02:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:57:53] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-05-12 02:57:53] [INFO ] Deduced a trap composed of 26 places in 101 ms
[2020-05-12 02:57:54] [INFO ] Deduced a trap composed of 16 places in 285 ms
[2020-05-12 02:57:54] [INFO ] Deduced a trap composed of 24 places in 219 ms
[2020-05-12 02:57:54] [INFO ] Deduced a trap composed of 33 places in 281 ms
[2020-05-12 02:57:54] [INFO ] Deduced a trap composed of 29 places in 75 ms
[2020-05-12 02:57:54] [INFO ] Deduced a trap composed of 12 places in 107 ms
[2020-05-12 02:57:54] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-05-12 02:57:55] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-05-12 02:57:55] [INFO ] Deduced a trap composed of 23 places in 125 ms
[2020-05-12 02:57:55] [INFO ] Deduced a trap composed of 21 places in 576 ms
[2020-05-12 02:57:55] [INFO ] Deduced a trap composed of 31 places in 131 ms
[2020-05-12 02:57:56] [INFO ] Deduced a trap composed of 22 places in 162 ms
[2020-05-12 02:57:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2549 ms
[2020-05-12 02:57:56] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 52 ms.
[2020-05-12 02:57:57] [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: Broken pipe (=> (> t208 0) (and (> t204 0) (< o204 o208)))") while checking expression at index 0
[2020-05-12 02:57:57] [INFO ] [Real]Absence check using 48 positive place invariants in 58 ms returned sat
[2020-05-12 02:57:57] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:57:58] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2020-05-12 02:57:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:57:58] [INFO ] [Nat]Absence check using 48 positive place invariants in 56 ms returned sat
[2020-05-12 02:57:58] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-05-12 02:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:00] [INFO ] [Nat]Absence check using state equation in 1653 ms returned sat
[2020-05-12 02:58:03] [INFO ] Deduced a trap composed of 8 places in 3434 ms
[2020-05-12 02:58:03] [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 s208 s211 s357 s358 s359) 0)") while checking expression at index 1
[2020-05-12 02:58:03] [INFO ] [Real]Absence check using 48 positive place invariants in 27 ms returned unsat
[2020-05-12 02:58:04] [INFO ] [Real]Absence check using 48 positive place invariants in 30 ms returned sat
[2020-05-12 02:58:04] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned unsat
[2020-05-12 02:58:04] [INFO ] [Real]Absence check using 48 positive place invariants in 27 ms returned sat
[2020-05-12 02:58:04] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:04] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2020-05-12 02:58:05] [INFO ] Deduced a trap composed of 111 places in 327 ms
[2020-05-12 02:58:05] [INFO ] Deduced a trap composed of 31 places in 159 ms
[2020-05-12 02:58:05] [INFO ] Deduced a trap composed of 10 places in 317 ms
[2020-05-12 02:58:05] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-05-12 02:58:05] [INFO ] Deduced a trap composed of 52 places in 181 ms
[2020-05-12 02:58:06] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-05-12 02:58:06] [INFO ] Deduced a trap composed of 25 places in 316 ms
[2020-05-12 02:58:06] [INFO ] Deduced a trap composed of 131 places in 277 ms
[2020-05-12 02:58:06] [INFO ] Deduced a trap composed of 137 places in 148 ms
[2020-05-12 02:58:07] [INFO ] Deduced a trap composed of 120 places in 313 ms
[2020-05-12 02:58:08] [INFO ] Deduced a trap composed of 53 places in 726 ms
[2020-05-12 02:58:08] [INFO ] Deduced a trap composed of 41 places in 456 ms
[2020-05-12 02:58:11] [INFO ] Deduced a trap composed of 135 places in 3041 ms
[2020-05-12 02:58:11] [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 s34 s35 s43 s44 s48 s49 s50 s73 s76 s77 s86 s87 s95 s99 s100 s101 s102 s103 s104 s109 s110 s111 s112 s117 s118 s119 s123 s124 s125 s135 s136 s137 s138 s150 s151 s152 s154 s156 s161 s162 s163 s164 s168 s169 s170 s174 s175 s176 s180 s186 s201 s202 s203 s238 s242 s244 s247 s248 s249 s252 s253 s254 s258 s263 s273 s278 s288 s293 s308 s313 s318 s323 s333 s337 s339 s362 s365 s366 s367 s368 s372 s373 s374 s375 s376 s377 s378 s394 s395 s404 s405 s408 s409 s410 s411 s414 s415 s416 s419 s420 s421 s422 s428 s429 s430 s431 s440 s441 s448 s449 s450 s451 s452 s453 s460 s461 s468 s469 s470 s473 s474 s477 s478 s479 s515 s516 s517) 0)") while checking expression at index 4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 7 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 290 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 38 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.88 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 510 transition count 352
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 230 place count 400 transition count 352
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 230 place count 400 transition count 276
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 393 place count 313 transition count 276
Symmetric choice reduction at 2 with 66 rule applications. Total rules 459 place count 313 transition count 276
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 66 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 591 place count 247 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 591 place count 247 transition count 202
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 609 place count 237 transition count 202
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 770 place count 155 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 772 place count 154 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 154 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 776 place count 152 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 777 place count 152 transition count 124
Applied a total of 777 rules in 300 ms. Remains 152 /518 variables (removed 366) and now considering 124/471 (removed 347) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/518 places, 124/471 transitions.
Finished random walk after 112896 steps, including 4823 resets, run visited all 3 properties in 289 ms. (steps per millisecond=390 )
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589252292624

--------------------
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-10"
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-10, 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-158897699200526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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