Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r224-tall-171649612000071.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is JoinFreeModules-PT-0500, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612000071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 JoinFreeModules-PT-0500-ReachabilityFireability-2024-00
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-01
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-02
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-03
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-04
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-05
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-06
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-07
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-08
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-09
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-10
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-11
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-12
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-13
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-14
FORMULA_NAME JoinFreeModules-PT-0500-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716541741220

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 09:09:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 09:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:09:02] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-24 09:09:02] [INFO ] Transformed 2501 places.
[2024-05-24 09:09:02] [INFO ] Transformed 4001 transitions.
[2024-05-24 09:09:02] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 12 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40458 steps (8 resets) in 2419 ms. (16 steps per ms) remains 4/4 properties
[2024-05-24 09:09:03] [INFO ] Flatten gal took : 411 ms
[2024-05-24 09:09:03] [INFO ] Flatten gal took : 291 ms
[2024-05-24 09:09:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12751036050395380542.gal : 227 ms
[2024-05-24 09:09:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9761557568867432120.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12751036050395380542.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9761557568867432120.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 2337 ms. (17 steps per ms) remains 3/4 properties
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality9761557568867432120.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 2188 ms. (18 steps per ms) remains 2/3 properties
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2213 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1348 ms. (29 steps per ms) remains 2/2 properties
// Phase 1: matrix 4001 rows 2500 cols
[2024-05-24 09:09:06] [INFO ] Computed 500 invariants in 53 ms
[2024-05-24 09:09:06] [INFO ] State equation strengthened by 500 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/290 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 464/754 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 58/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/754 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/6501 variables, and 406 constraints, problems are : Problem set: 0 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 58/500 constraints, State Equation: 290/2500 constraints, ReadFeed: 58/500 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/290 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 09:09:06] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 7 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 10 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 09:09:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 464/754 variables, 290/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 58/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 09:09:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/754 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/6501 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2768 ms.
Refiners :[Positive P Invariants (semi-flows): 58/500 constraints, State Equation: 290/2500 constraints, ReadFeed: 58/500 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 34/34 constraints]
After SMT, in 3391ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1122 steps, including 0 resets, run visited all 2 properties in 65 ms. (steps per millisecond=17 )
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0500-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 81 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7300 ms.

BK_STOP 1716541749689

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="JoinFreeModules-PT-0500"
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-5568"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0500, 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 r224-tall-171649612000071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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