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

About the Execution of ITS-Tools for BART-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.480 52919.00 81812.00 179.70 FTFFFFTTTFFFTTFT 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-158897698600118.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 BART-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 4.6K Apr 15 13:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 15 13:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 15 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 15 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.5M Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 15 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 15 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 15 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 15 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 15 13:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 12M 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 BART-PT-050-ReachabilityCardinality-00
FORMULA_NAME BART-PT-050-ReachabilityCardinality-01
FORMULA_NAME BART-PT-050-ReachabilityCardinality-02
FORMULA_NAME BART-PT-050-ReachabilityCardinality-03
FORMULA_NAME BART-PT-050-ReachabilityCardinality-04
FORMULA_NAME BART-PT-050-ReachabilityCardinality-05
FORMULA_NAME BART-PT-050-ReachabilityCardinality-06
FORMULA_NAME BART-PT-050-ReachabilityCardinality-07
FORMULA_NAME BART-PT-050-ReachabilityCardinality-08
FORMULA_NAME BART-PT-050-ReachabilityCardinality-09
FORMULA_NAME BART-PT-050-ReachabilityCardinality-10
FORMULA_NAME BART-PT-050-ReachabilityCardinality-11
FORMULA_NAME BART-PT-050-ReachabilityCardinality-12
FORMULA_NAME BART-PT-050-ReachabilityCardinality-13
FORMULA_NAME BART-PT-050-ReachabilityCardinality-14
FORMULA_NAME BART-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589206729745

[2020-05-11 14:18:53] [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-11 14:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:18:54] [INFO ] Load time of PNML (sax parser for PT used): 774 ms
[2020-05-11 14:18:54] [INFO ] Transformed 6810 places.
[2020-05-11 14:18:54] [INFO ] Transformed 10100 transitions.
[2020-05-11 14:18:54] [INFO ] Found NUPN structural information;
[2020-05-11 14:18:54] [INFO ] Parsed PT model containing 6810 places and 10100 transitions in 1095 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 279 ms.
Working with output stream class java.io.PrintStream
FORMULA BART-PT-050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 624 ms. (steps per millisecond=16 ) properties seen :[1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0]
FORMULA BART-PT-050-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 10100 rows 6600 cols
[2020-05-11 14:18:56] [INFO ] Computed 50 place invariants in 397 ms
[2020-05-11 14:18:58] [INFO ] [Real]Absence check using 50 positive place invariants in 482 ms returned sat
[2020-05-11 14:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:01] [INFO ] [Real]Absence check using state equation in 3167 ms returned (error "Solver has unexpectedly terminated")
[2020-05-11 14:19:03] [INFO ] [Real]Absence check using 50 positive place invariants in 886 ms returned sat
[2020-05-11 14:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:06] [INFO ] [Real]Absence check using state equation in 2796 ms returned (error "Solver has unexpectedly terminated")
[2020-05-11 14:19:08] [INFO ] [Real]Absence check using 50 positive place invariants in 420 ms returned sat
[2020-05-11 14:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 14:19:11] [INFO ] [Real]Absence check using state equation in 3676 ms returned (error "Failed to check-sat")
[2020-05-11 14:19:13] [INFO ] [Real]Absence check using 50 positive place invariants in 472 ms returned sat
[2020-05-11 14:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:16] [INFO ] [Real]Absence check using state equation in 3108 ms returned (error "Solver has unexpectedly terminated")
[2020-05-11 14:19:19] [INFO ] [Real]Absence check using 50 positive place invariants in 837 ms returned sat
[2020-05-11 14:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 14:19:21] [INFO ] [Real]Absence check using state equation in 2744 ms returned (error "Failed to check-sat")
[2020-05-11 14:19:22] [INFO ] [Real]Absence check using 50 positive place invariants in 513 ms returned sat
[2020-05-11 14:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 14:19:26] [INFO ] [Real]Absence check using state equation in 3905 ms returned (error "Failed to check-sat")
[2020-05-11 14:19:28] [INFO ] [Real]Absence check using 50 positive place invariants in 795 ms returned sat
[2020-05-11 14:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:31] [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 (= s267 (- (+ t6367 t8667) t6267))") while checking expression at index 6
[2020-05-11 14:19:32] [INFO ] [Real]Absence check using 50 positive place invariants in 450 ms returned sat
[2020-05-11 14:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:36] [INFO ] [Real]Absence check using state equation in 3925 ms returned (error "Solver has unexpectedly terminated")
[2020-05-11 14:19:39] [INFO ] [Real]Absence check using 50 positive place invariants in 1124 ms returned sat
[2020-05-11 14:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:19:41] [INFO ] [Real]Absence check using state equation in 2419 ms returned (error "Solver has unexpectedly terminated")
Support contains 47 out of 6600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 9962 edges and 6600 vertex of which 6254 / 6600 are part of one of the 50 SCC in 59 ms
Free SCC test removed 6204 places
Discarding 20 places :
Also discarding 4040 output transitions
Drop transitions removed 4040 transitions
Graph (complete) has 489 edges and 396 vertex of which 376 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.80 ms
Drop transitions removed 5557 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 5571 transitions.
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Iterating post reduction 0 with 5782 rules applied. Total rules applied 5784 place count 376 transition count 278
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 255 rules applied. Total rules applied 6039 place count 165 transition count 234
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 36 rules applied. Total rules applied 6075 place count 152 transition count 211
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 27 rules applied. Total rules applied 6102 place count 142 transition count 194
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 4 with 20 rules applied. Total rules applied 6122 place count 135 transition count 181
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 12 rules applied. Total rules applied 6134 place count 129 transition count 175
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 6138 place count 127 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 6138 place count 127 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 6140 place count 126 transition count 172
Symmetric choice reduction at 7 with 14 rule applications. Total rules 6154 place count 126 transition count 172
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 6182 place count 112 transition count 158
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 6196 place count 112 transition count 144
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 6196 place count 112 transition count 138
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 6208 place count 106 transition count 138
Symmetric choice reduction at 8 with 1 rule applications. Total rules 6209 place count 106 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 6211 place count 105 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 6212 place count 105 transition count 136
Symmetric choice reduction at 9 with 1 rule applications. Total rules 6213 place count 105 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 6215 place count 104 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 6216 place count 104 transition count 134
Symmetric choice reduction at 10 with 1 rule applications. Total rules 6217 place count 104 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 6219 place count 103 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 6220 place count 103 transition count 132
Symmetric choice reduction at 11 with 1 rule applications. Total rules 6221 place count 103 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 6223 place count 102 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 6224 place count 102 transition count 130
Symmetric choice reduction at 12 with 1 rule applications. Total rules 6225 place count 102 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 6227 place count 101 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 6228 place count 101 transition count 128
Symmetric choice reduction at 13 with 1 rule applications. Total rules 6229 place count 101 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6231 place count 100 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 6232 place count 100 transition count 126
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 6246 place count 93 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 6252 place count 93 transition count 113
Free-agglomeration rule applied 15 times.
Iterating global reduction 15 with 15 rules applied. Total rules applied 6267 place count 93 transition count 98
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 18 rules applied. Total rules applied 6285 place count 78 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 6286 place count 78 transition count 95
Applied a total of 6286 rules in 331 ms. Remains 78 /6600 variables (removed 6522) and now considering 95/10100 (removed 10005) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/6600 places, 95/10100 transitions.
Finished random walk after 208 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=104 )
FORMULA BART-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589206782664

--------------------
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="BART-PT-050"
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 BART-PT-050, 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-158897698600118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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