Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717226078151

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:39] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 07:14:39] [INFO ] Transformed 717 places.
[2024-06-01 07:14:39] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:39] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:39] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (208 resets) in 1889 ms. (21 steps per ms) remains 5/13 properties
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (37 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (37 resets) in 385 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (43 resets) in 536 ms. (74 steps per ms) remains 5/5 properties
// Phase 1: matrix 627 rows 702 cols
[2024-06-01 07:14:41] [INFO ] Computed 114 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BusinessProcesses-PT-18-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 463/557 variables, 66/160 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 463/623 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/623 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/580 variables, 7/630 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 23/653 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/653 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 120/700 variables, 39/692 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 120/812 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 0/812 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/702 variables, 2/814 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 2/816 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/702 variables, 0/816 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 627/1329 variables, 702/1518 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 1518 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1561 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem BusinessProcesses-PT-18-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 479/532 variables, 61/114 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 479/593 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 25 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 11 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 4 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 43 places in 669 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 14/607 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/607 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 40/572 variables, 12/619 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 40/659 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 3/662 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/662 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem BusinessProcesses-PT-18-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 128/700 variables, 39/701 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 128/829 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 0/829 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/702 variables, 2/831 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/702 variables, 2/833 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/702 variables, 0/833 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 627/1329 variables, 702/1535 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1329 variables, 2/1537 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 8 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 4 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 151 places in 248 ms of which 3 ms to minimize.
SMT process timed out in 6900ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 397 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 686 transition count 461
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 312 place count 531 transition count 461
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 312 place count 531 transition count 355
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 548 place count 401 transition count 355
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 637 place count 312 transition count 266
Iterating global reduction 2 with 89 rules applied. Total rules applied 726 place count 312 transition count 266
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 726 place count 312 transition count 257
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 747 place count 300 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 748 place count 299 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 749 place count 299 transition count 256
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 955 place count 196 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 957 place count 195 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 958 place count 195 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 959 place count 194 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 960 place count 193 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 961 place count 192 transition count 154
Applied a total of 961 rules in 176 ms. Remains 192 /702 variables (removed 510) and now considering 154/627 (removed 473) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 192/702 places, 154/627 transitions.
RANDOM walk for 967 steps (34 resets) in 134 ms. (7 steps per ms) remains 0/2 properties
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8758 ms.
ITS solved all properties within timeout

BK_STOP 1717226088461

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-18, 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 r472-tajo-171620399800590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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