Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is BusinessProcesses-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 29 23:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 23:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:33 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-06-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083012842

Running Version 0
[2022-06-13 01:16:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:16:54] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-06-13 01:16:54] [INFO ] Transformed 376 places.
[2022-06-13 01:16:54] [INFO ] Transformed 297 transitions.
[2022-06-13 01:16:54] [INFO ] Found NUPN structural information;
[2022-06-13 01:16:54] [INFO ] Parsed PT model containing 376 places and 297 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 98 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :9
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 375 cols
[2022-06-13 01:16:55] [INFO ] Computed 81 place invariants in 33 ms
[2022-06-13 01:16:55] [INFO ] [Real]Absence check using 42 positive place invariants in 27 ms returned sat
[2022-06-13 01:16:55] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2022-06-13 01:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:55] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-06-13 01:16:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:55] [INFO ] [Real]Absence check using 42 positive place invariants in 26 ms returned sat
[2022-06-13 01:16:55] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2022-06-13 01:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:55] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-06-13 01:16:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:55] [INFO ] [Nat]Absence check using 42 positive place invariants in 25 ms returned sat
[2022-06-13 01:16:55] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 21 ms returned sat
[2022-06-13 01:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:56] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:16:56] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:16:57] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:16:58] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:16:58] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:16:58] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2005 ms
[2022-06-13 01:16:58] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 21 ms.
[2022-06-13 01:16:59] [INFO ] Added : 231 causal constraints over 47 iterations in 1422 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:16:59] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2022-06-13 01:16:59] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2022-06-13 01:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:59] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-06-13 01:16:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:17:00] [INFO ] [Nat]Absence check using 42 positive place invariants in 15 ms returned unsat
[2022-06-13 01:17:00] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-06-13 01:17:00] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2022-06-13 01:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:00] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-06-13 01:17:00] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Incomplete Parikh walk after 25200 steps, including 288 resets, run finished after 65 ms. (steps per millisecond=387 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 33 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 169 edges and 375 vertex of which 4 / 375 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 688 edges and 372 vertex of which 369 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 369 transition count 240
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 113 place count 319 transition count 230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 123 place count 309 transition count 230
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 123 place count 309 transition count 174
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 239 place count 249 transition count 174
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 271 place count 217 transition count 142
Iterating global reduction 3 with 32 rules applied. Total rules applied 303 place count 217 transition count 142
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 409 place count 164 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 164 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 413 place count 162 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 161 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 415 place count 160 transition count 86
Applied a total of 415 rules in 111 ms. Remains 160 /375 variables (removed 215) and now considering 86/296 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/375 places, 86/296 transitions.
[2022-06-13 01:17:00] [INFO ] Flatten gal took : 39 ms
[2022-06-13 01:17:00] [INFO ] Flatten gal took : 13 ms
[2022-06-13 01:17:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality84794657775367568.gal : 8 ms
[2022-06-13 01:17:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16369605908534415957.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality84794657775367568.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16369605908534415957.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality84794657775367568.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16369605908534415957.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16369605908534415957.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 100
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :100 after 174
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :780 after 1374
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1374 after 208233
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :208233 after 210293
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :210293 after 230845
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :230845 after 280055
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :280055 after 354213
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :354213 after 2.41058e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.27984e+06,14.7916,123744,2,118953,19,600598,7,0,786,315423,0
Total reachable state count : 4279842

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-06-ReachabilityCardinality-03 is true.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-06-ReachabilityCardinality-03,24,14.8841,123744,2,235,19,600598,7,0,820,315423,0
All properties solved without resorting to model-checking.

BK_STOP 1655083036540

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-06, 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 r028-tall-165251936100137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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