fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900400591
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15758.150 3600000.00 109306.00 181.10 TTFFFTTTFTTTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900400591.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCround-PT-11b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.9K Mar 30 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 00:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 00:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 1.7M 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 DLCround-PT-11b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591256097594

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:35:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 07:35:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:35:01] [INFO ] Load time of PNML (sax parser for PT used): 573 ms
[2020-06-04 07:35:01] [INFO ] Transformed 4375 places.
[2020-06-04 07:35:01] [INFO ] Transformed 6991 transitions.
[2020-06-04 07:35:01] [INFO ] Found NUPN structural information;
[2020-06-04 07:35:01] [INFO ] Parsed PT model containing 4375 places and 6991 transitions in 866 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 550 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 362 ms. (steps per millisecond=27 ) properties seen :[0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0]
FORMULA DLCround-PT-11b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6991 rows 4375 cols
[2020-06-04 07:35:03] [INFO ] Computed 244 place invariants in 217 ms
[2020-06-04 07:35:05] [INFO ] [Real]Absence check using 244 positive place invariants in 1550 ms returned sat
[2020-06-04 07:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 07:35:08] [INFO ] [Real]Absence check using state equation in 2423 ms returned (error "Failed to check-sat")
[2020-06-04 07:35:10] [INFO ] [Real]Absence check using 244 positive place invariants in 1346 ms returned sat
[2020-06-04 07:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:13] [INFO ] [Real]Absence check using state equation in 2495 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 07:35:15] [INFO ] [Real]Absence check using 244 positive place invariants in 1370 ms returned sat
[2020-06-04 07:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:18] [INFO ] [Real]Absence check using state equation in 2839 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 07:35:20] [INFO ] [Real]Absence check using 244 positive place invariants in 1571 ms returned sat
[2020-06-04 07:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 07:35:23] [INFO ] [Real]Absence check using state equation in 2633 ms returned (error "Failed to check-sat")
[2020-06-04 07:35:25] [INFO ] [Real]Absence check using 244 positive place invariants in 1455 ms returned sat
[2020-06-04 07:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:28] [INFO ] [Real]Absence check using state equation in 2652 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 07:35:31] [INFO ] [Real]Absence check using 244 positive place invariants in 1724 ms returned sat
[2020-06-04 07:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 07:35:33] [INFO ] [Real]Absence check using state equation in 2304 ms returned (error "Failed to check-sat")
[2020-06-04 07:35:35] [INFO ] [Real]Absence check using 244 positive place invariants in 1387 ms returned sat
[2020-06-04 07:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:38] [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 (>= t4845 0)") while checking expression at index 6
[2020-06-04 07:35:40] [INFO ] [Real]Absence check using 244 positive place invariants in 1565 ms returned sat
[2020-06-04 07:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:43] [INFO ] [Real]Absence check using state equation in 2647 ms returned (error "Failed to check-sat")
[2020-06-04 07:35:45] [INFO ] [Real]Absence check using 244 positive place invariants in 1589 ms returned sat
[2020-06-04 07:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 07:35:48] [INFO ] [Real]Absence check using state equation in 2630 ms returned (error "Failed to check-sat")
[2020-06-04 07:35:51] [INFO ] [Real]Absence check using 244 positive place invariants in 1498 ms returned sat
[2020-06-04 07:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:35:53] [INFO ] [Real]Absence check using state equation in 1892 ms returned (error "Failed to check-sat")
Support contains 62 out of 4375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3900 edges and 4375 vertex of which 663 / 4375 are part of one of the 51 SCC in 69 ms
Free SCC test removed 612 places
Drop transitions removed 686 transitions
Reduce isomorphic transitions removed 686 transitions.
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Iterating post reduction 0 with 2244 rules applied. Total rules applied 2245 place count 3763 transition count 4747
Reduce places removed 1558 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 1637 rules applied. Total rules applied 3882 place count 2205 transition count 4668
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 42 rules applied. Total rules applied 3924 place count 2171 transition count 4660
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3928 place count 2167 transition count 4660
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 3928 place count 2167 transition count 4627
Deduced a syphon composed of 33 places in 121 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 3994 place count 2134 transition count 4627
Symmetric choice reduction at 4 with 580 rule applications. Total rules 4574 place count 2134 transition count 4627
Deduced a syphon composed of 580 places in 84 ms
Reduce places removed 580 places and 580 transitions.
Iterating global reduction 4 with 1160 rules applied. Total rules applied 5734 place count 1554 transition count 4047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5735 place count 1554 transition count 4046
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 247 Pre rules applied. Total rules applied 5735 place count 1554 transition count 3799
Deduced a syphon composed of 247 places in 111 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 5 with 494 rules applied. Total rules applied 6229 place count 1307 transition count 3799
Symmetric choice reduction at 5 with 70 rule applications. Total rules 6299 place count 1307 transition count 3799
Deduced a syphon composed of 70 places in 124 ms
Reduce places removed 70 places and 1032 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 6439 place count 1237 transition count 2767
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 6459 place count 1237 transition count 2747
Performed 317 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 317 places in 3 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 6 with 634 rules applied. Total rules applied 7093 place count 920 transition count 2423
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 7101 place count 920 transition count 2415
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 7 with 3 rule applications. Total rules 7104 place count 920 transition count 2415
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 45 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 7110 place count 917 transition count 2370
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -614
Deduced a syphon composed of 55 places in 13 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 7220 place count 862 transition count 2984
Drop transitions removed 47 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 7268 place count 862 transition count 2936
Free-agglomeration rule applied 451 times with reduction of 191 identical transitions.
Iterating global reduction 8 with 451 rules applied. Total rules applied 7719 place count 862 transition count 2294
Reduce places removed 451 places and 0 transitions.
Drop transitions removed 852 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 876 transitions.
Iterating post reduction 8 with 1327 rules applied. Total rules applied 9046 place count 411 transition count 1418
Symmetric choice reduction at 9 with 2 rule applications. Total rules 9048 place count 411 transition count 1418
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 9052 place count 409 transition count 1388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 9054 place count 409 transition count 1386
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 9055 place count 409 transition count 1385
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 8 places :
Also discarding 0 output transitions
Graph (complete) has 1287 edges and 408 vertex of which 400 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.20 ms
Iterating post reduction 10 with 17 rules applied. Total rules applied 9072 place count 400 transition count 1370
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 9080 place count 400 transition count 1370
Drop transitions removed 101 transitions
Redundant transition composition rules discarded 101 transitions
Iterating global reduction 11 with 101 rules applied. Total rules applied 9181 place count 400 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 9182 place count 399 transition count 1269
Symmetric choice reduction at 12 with 9 rule applications. Total rules 9191 place count 399 transition count 1269
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 135 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 9209 place count 390 transition count 1134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 9215 place count 390 transition count 1128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 9217 place count 389 transition count 1139
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 9220 place count 389 transition count 1136
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 41 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 13 with 47 rules applied. Total rules applied 9267 place count 386 transition count 1092
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 9272 place count 386 transition count 1087
Applied a total of 9272 rules in 3796 ms. Remains 386 /4375 variables (removed 3989) and now considering 1087/6991 (removed 5904) transitions.
Finished structural reductions, in 1 iterations. Remains : 386/4375 places, 1087/6991 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13107 ms. (steps per millisecond=76 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 0, 1]
FORMULA DLCround-PT-11b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 874296 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen :[1, 0, 0]
FORMULA DLCround-PT-11b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 858389 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :[1, 0]
FORMULA DLCround-PT-11b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2762 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=138 )
FORMULA DLCround-PT-11b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

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="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is DLCround-PT-11b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900400591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11b.tgz
mv DLCround-PT-11b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;