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.r528-tall-171683761900799.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 ltsminxred
Input is ShieldRVs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761900799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 17:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 17:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 122K May 18 16:43 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 ShieldRVs-PT-010B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717264982130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:03:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:03:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:03:03] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 18:03:03] [INFO ] Transformed 403 places.
[2024-06-01 18:03:03] [INFO ] Transformed 453 transitions.
[2024-06-01 18:03:03] [INFO ] Found NUPN structural information;
[2024-06-01 18:03:03] [INFO ] Parsed PT model containing 403 places and 453 transitions and 1440 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (88 resets) in 1517 ms. (26 steps per ms) remains 4/16 properties
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 311 ms. (128 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 757 ms. (52 steps per ms) remains 2/2 properties
// Phase 1: matrix 453 rows 403 cols
[2024-06-01 18:03:04] [INFO ] Computed 41 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 326/388 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 326/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/403 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 15/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 453/856 variables, 403/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/856 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 856/856 variables, and 847 constraints, problems are : Problem set: 0 solved, 2 unsolved in 631 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 403/403 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/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem ShieldRVs-PT-010B-ReachabilityFireability-2024-14 is UNSAT
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 326/388 variables, 39/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 326/427 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 18:03:05] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 26 ms to minimize.
[2024-06-01 18:03:05] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 18:03:05] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:03:05] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:03:05] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:03:05] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 3 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 17/444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 15/403 variables, 2/446 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 15/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 18:03:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 2/463 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/463 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 453/856 variables, 403/866 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/856 variables, 1/867 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:03:07] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:03:08] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:03:08] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:03:08] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:03:08] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:03:08] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:03:08] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/856 variables, 13/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/856 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/856 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 856/856 variables, and 880 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3456 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 32/32 constraints]
After SMT, in 4185ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 116 ms.
Support contains 29 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 403 transition count 418
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 368 transition count 416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 366 transition count 416
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 74 place count 366 transition count 368
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 170 place count 318 transition count 368
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 233 place count 255 transition count 305
Iterating global reduction 3 with 63 rules applied. Total rules applied 296 place count 255 transition count 305
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 296 place count 255 transition count 283
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 340 place count 233 transition count 283
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 472 place count 167 transition count 217
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 488 place count 167 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 489 place count 166 transition count 216
Applied a total of 489 rules in 104 ms. Remains 166 /403 variables (removed 237) and now considering 216/453 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 166/403 places, 216/453 transitions.
RANDOM walk for 14706 steps (83 resets) in 199 ms. (73 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5782 ms.
ITS solved all properties within timeout

BK_STOP 1717264989074

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-010B, 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 r528-tall-171683761900799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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