fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089416300767
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ResAllocation-PT-R003C050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
227.951 5164.00 10972.00 45.90 TTTTFTTFFTTTTTFF 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/mcc2021-input.r178-tajo-162089416300767.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 itstools
Input is ResAllocation-PT-R003C050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416300767
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 360K May 5 16:51 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 ResAllocation-PT-R003C050-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621265921356

Running Version 0
[2021-05-17 15:38:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2021-05-17 15:38:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:38:43] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2021-05-17 15:38:43] [INFO ] Transformed 300 places.
[2021-05-17 15:38:43] [INFO ] Transformed 200 transitions.
[2021-05-17 15:38:43] [INFO ] Parsed PT model containing 300 places and 200 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 94 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 16) seen :11
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 200 rows 300 cols
[2021-05-17 15:38:43] [INFO ] Computed 150 place invariants in 7 ms
[2021-05-17 15:38:43] [INFO ] [Real]Absence check using 150 positive place invariants in 51 ms returned sat
[2021-05-17 15:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:43] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-17 15:38:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
[2021-05-17 15:38:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2021-05-17 15:38:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 426 ms
[2021-05-17 15:38:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:38:44] [INFO ] [Nat]Absence check using 150 positive place invariants in 19 ms returned sat
[2021-05-17 15:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:44] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 6 ms of which 1 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 307 ms
[2021-05-17 15:38:44] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:38:44] [INFO ] Added : 25 causal constraints over 5 iterations in 99 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-17 15:38:44] [INFO ] [Real]Absence check using 150 positive place invariants in 16 ms returned sat
[2021-05-17 15:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:44] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-17 15:38:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 107 ms
[2021-05-17 15:38:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:38:45] [INFO ] [Nat]Absence check using 150 positive place invariants in 15 ms returned sat
[2021-05-17 15:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 6 ms of which 1 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 81 ms
[2021-05-17 15:38:45] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:38:45] [INFO ] Added : 16 causal constraints over 4 iterations in 58 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-17 15:38:45] [INFO ] [Real]Absence check using 150 positive place invariants in 15 ms returned sat
[2021-05-17 15:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:45] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 2 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 5 places in 6 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 83 ms
[2021-05-17 15:38:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:38:45] [INFO ] [Nat]Absence check using 150 positive place invariants in 15 ms returned sat
[2021-05-17 15:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 3 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 7 places in 8 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 5 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 5 places in 7 ms of which 1 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2021-05-17 15:38:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 212 ms
[2021-05-17 15:38:45] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 15:38:45] [INFO ] Added : 34 causal constraints over 7 iterations in 76 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-17 15:38:45] [INFO ] [Real]Absence check using 150 positive place invariants in 23 ms returned sat
[2021-05-17 15:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:45] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 15:38:45] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 4 places in 6 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 73 ms
[2021-05-17 15:38:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:38:46] [INFO ] [Nat]Absence check using 150 positive place invariants in 15 ms returned sat
[2021-05-17 15:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:38:46] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 1 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 6 places in 6 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Deduced a trap composed of 4 places in 5 ms of which 0 ms to minimize.
[2021-05-17 15:38:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 72 ms
[2021-05-17 15:38:46] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 15:38:46] [INFO ] Added : 19 causal constraints over 4 iterations in 52 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
Incomplete Parikh walk after 6100 steps, including 102 resets, run finished after 30 ms. (steps per millisecond=203 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4600 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=242 ) properties (out of 3) seen :2 could not realise parikh vector
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6700 steps, including 112 resets, run finished after 28 ms. (steps per millisecond=239 ) properties (out of 1) seen :0 could not realise parikh vector
Finished Parikh walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621265926520

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ResAllocation-PT-R003C050"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ResAllocation-PT-R003C050, 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 r178-tajo-162089416300767"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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