About the Execution of LTSMin+red for AutonomousCar-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
362.731 | 10473.00 | 26608.00 | 158.80 | FFFFTTTFTFTFFFFF | normal |
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.r468-smll-171620167400279.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 AutonomousCar-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400279
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K 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 AutonomousCar-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717211637028
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 03:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:14:00] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-06-01 03:14:00] [INFO ] Transformed 221 places.
[2024-06-01 03:14:00] [INFO ] Transformed 368 transitions.
[2024-06-01 03:14:00] [INFO ] Found NUPN structural information;
[2024-06-01 03:14:00] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (39 resets) in 2737 ms. (14 steps per ms) remains 7/16 properties
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (85 resets) in 451 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (78 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (107 resets) in 675 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (108 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (59 resets) in 936 ms. (42 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (123 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (105 resets) in 478 ms. (83 steps per ms) remains 7/7 properties
// Phase 1: matrix 368 rows 221 cols
[2024-06-01 03:14:02] [INFO ] Computed 9 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-04b-ReachabilityFireability-2024-02 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-04b-ReachabilityFireability-2024-14 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 119/221 variables, 9/111 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 119/230 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 368/589 variables, 221/451 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/451 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/589 variables, 0/451 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 451 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1382 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AutonomousCar-PT-04b-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-04b-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 128/221 variables, 9/102 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 128/230 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-01 03:14:04] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 41 ms to minimize.
[2024-06-01 03:14:05] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 5 ms to minimize.
[2024-06-01 03:14:05] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 4 ms to minimize.
[2024-06-01 03:14:05] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 4 ms to minimize.
[2024-06-01 03:14:06] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 3 ms to minimize.
[2024-06-01 03:14:06] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
Problem AutonomousCar-PT-04b-ReachabilityFireability-2024-03 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 03:14:06] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
Problem AutonomousCar-PT-04b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 7/237 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/237 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 368/589 variables, 221/458 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 1/459 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-01 03:14:06] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 1/460 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/460 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/589 variables, 0/460 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 460 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2741 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 8/8 constraints]
After SMT, in 4549ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 8 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 200 edges and 221 vertex of which 4 / 221 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 584 edges and 219 vertex of which 212 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 212 transition count 264
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 118 rules applied. Total rules applied 215 place count 119 transition count 239
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 17 rules applied. Total rules applied 232 place count 105 transition count 236
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 236 place count 102 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 236 place count 102 transition count 229
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 248 place count 96 transition count 229
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 267 place count 77 transition count 210
Iterating global reduction 4 with 19 rules applied. Total rules applied 286 place count 77 transition count 210
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 351 place count 77 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 351 place count 77 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 353 place count 76 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 356 place count 73 transition count 135
Iterating global reduction 5 with 3 rules applied. Total rules applied 359 place count 73 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 363 place count 73 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 365 place count 71 transition count 131
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 413 place count 47 transition count 107
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 417 place count 43 transition count 87
Iterating global reduction 7 with 4 rules applied. Total rules applied 421 place count 43 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 42 transition count 100
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 428 place count 42 transition count 95
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 433 place count 37 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 434 place count 37 transition count 95
Applied a total of 434 rules in 197 ms. Remains 37 /221 variables (removed 184) and now considering 95/368 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 37/221 places, 95/368 transitions.
RANDOM walk for 11030 steps (323 resets) in 107 ms. (102 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7801 ms.
ITS solved all properties within timeout
BK_STOP 1717211647501
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="AutonomousCar-PT-04b"
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 AutonomousCar-PT-04b, 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 r468-smll-171620167400279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b 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 '
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 ;