Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696900495.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BusinessProcesses-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 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 BusinessProcesses-PT-06-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678790276445

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:37:58] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-14 10:37:58] [INFO ] Transformed 376 places.
[2023-03-14 10:37:58] [INFO ] Transformed 297 transitions.
[2023-03-14 10:37:58] [INFO ] Found NUPN structural information;
[2023-03-14 10:37:58] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 16) seen :12
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 375 cols
[2023-03-14 10:37:59] [INFO ] Computed 81 place invariants in 19 ms
[2023-03-14 10:37:59] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 10:37:59] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-14 10:37:59] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-14 10:38:00] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-14 10:38:00] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 7 ms to minimize.
[2023-03-14 10:38:00] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-14 10:38:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-14 10:38:00] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 1 ms to minimize.
[2023-03-14 10:38:00] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-14 10:38:00] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2023-03-14 10:38:00] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 1 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 1 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 0 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 0 ms to minimize.
[2023-03-14 10:38:01] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:38:02] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 1 ms to minimize.
[2023-03-14 10:38:02] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 1 ms to minimize.
[2023-03-14 10:38:02] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2023-03-14 10:38:02] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2023-03-14 10:38:02] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 2 ms to minimize.
[2023-03-14 10:38:02] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 1 ms to minimize.
[2023-03-14 10:38:03] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 1 ms to minimize.
[2023-03-14 10:38:03] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 1 ms to minimize.
[2023-03-14 10:38:03] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 14 ms to minimize.
[2023-03-14 10:38:03] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 1 ms to minimize.
[2023-03-14 10:38:03] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 1 ms to minimize.
[2023-03-14 10:38:04] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:38:05] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2023-03-14 10:38:05] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 0 ms to minimize.
[2023-03-14 10:38:05] [INFO ] Deduced a trap composed of 80 places in 201 ms of which 2 ms to minimize.
[2023-03-14 10:38:05] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 3 ms to minimize.
[2023-03-14 10:38:05] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 0 ms to minimize.
[2023-03-14 10:38:06] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:38:06] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2023-03-14 10:38:06] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 1 ms to minimize.
[2023-03-14 10:38:06] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 1 ms to minimize.
[2023-03-14 10:38:06] [INFO ] Deduced a trap composed of 84 places in 191 ms of which 1 ms to minimize.
[2023-03-14 10:38:07] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 1 ms to minimize.
[2023-03-14 10:38:07] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 0 ms to minimize.
[2023-03-14 10:38:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 41 trap constraints in 6935 ms
[2023-03-14 10:38:07] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 0 ms to minimize.
[2023-03-14 10:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-14 10:38:07] [INFO ] After 7821ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-14 10:38:07] [INFO ] After 8189ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 13 ms.
Support contains 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 196 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 366 transition count 219
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 137 place count 299 transition count 219
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 137 place count 299 transition count 153
Deduced a syphon composed of 66 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 279 place count 223 transition count 153
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 320 place count 182 transition count 112
Iterating global reduction 2 with 41 rules applied. Total rules applied 361 place count 182 transition count 112
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 501 place count 108 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 108 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 503 place count 107 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 107 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 505 place count 106 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 506 place count 105 transition count 44
Applied a total of 506 rules in 123 ms. Remains 105 /375 variables (removed 270) and now considering 44/296 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 105/375 places, 44/296 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9483 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 06
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 376 places, 297 transitions, 830 arcs.
Final Score: 11637.109
Took : 8 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13705696 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16109292 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="BusinessProcesses-PT-06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is BusinessProcesses-PT-06, 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 r043-tajo-167813696900495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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