fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900400543
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.250 3600000.00 63818.00 196.20 TTTFTTTFTTTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900400543.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCround-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.2K Mar 30 19:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 19:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 09:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 09:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 24 05:37 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 DLCround-PT-08b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-08b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591245394042

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 04:36:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 04:36:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 04:36:39] [INFO ] Load time of PNML (sax parser for PT used): 775 ms
[2020-06-04 04:36:39] [INFO ] Transformed 3088 places.
[2020-06-04 04:36:39] [INFO ] Transformed 4732 transitions.
[2020-06-04 04:36:39] [INFO ] Found NUPN structural information;
[2020-06-04 04:36:39] [INFO ] Parsed PT model containing 3088 places and 4732 transitions in 1163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 377 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=45 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0]
FORMULA DLCround-PT-08b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4732 rows 3088 cols
[2020-06-04 04:36:40] [INFO ] Computed 157 place invariants in 154 ms
[2020-06-04 04:36:42] [INFO ] [Real]Absence check using 157 positive place invariants in 836 ms returned sat
[2020-06-04 04:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:36:45] [INFO ] [Real]Absence check using state equation in 3365 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:36:47] [INFO ] [Real]Absence check using 157 positive place invariants in 647 ms returned sat
[2020-06-04 04:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:36:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:36:50] [INFO ] [Real]Absence check using state equation in 3152 ms returned (error "Failed to check-sat")
[2020-06-04 04:36:52] [INFO ] [Real]Absence check using 157 positive place invariants in 761 ms returned sat
[2020-06-04 04:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:36:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:36:55] [INFO ] [Real]Absence check using state equation in 3613 ms returned (error "Failed to check-sat")
[2020-06-04 04:36:57] [INFO ] [Real]Absence check using 157 positive place invariants in 742 ms returned sat
[2020-06-04 04:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:37:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:37:00] [INFO ] [Real]Absence check using state equation in 3710 ms returned (error "Failed to check-sat")
[2020-06-04 04:37:02] [INFO ] [Real]Absence check using 157 positive place invariants in 718 ms returned sat
[2020-06-04 04:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:37:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:37:05] [INFO ] [Real]Absence check using state equation in 3641 ms returned (error "Failed to check-sat")
[2020-06-04 04:37:07] [INFO ] [Real]Absence check using 157 positive place invariants in 855 ms returned sat
[2020-06-04 04:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:37:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:37:10] [INFO ] [Real]Absence check using state equation in 3564 ms returned (error "Failed to check-sat")
[2020-06-04 04:37:12] [INFO ] [Real]Absence check using 157 positive place invariants in 610 ms returned sat
[2020-06-04 04:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:37:15] [INFO ] [Real]Absence check using state equation in 3837 ms returned (error "Solver has unexpectedly terminated")
Support contains 48 out of 3088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3088/3088 places, 4732/4732 transitions.
Graph (trivial) has 2808 edges and 3088 vertex of which 489 / 3088 are part of one of the 40 SCC in 54 ms
Free SCC test removed 449 places
Drop transitions removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Performed 1161 Post agglomeration using F-continuation condition.Transition count delta: 1161
Iterating post reduction 0 with 1665 rules applied. Total rules applied 1666 place count 2639 transition count 3067
Reduce places removed 1161 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 1227 rules applied. Total rules applied 2893 place count 1478 transition count 3001
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 37 rules applied. Total rules applied 2930 place count 1449 transition count 2993
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2934 place count 1445 transition count 2993
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 2934 place count 1445 transition count 2983
Deduced a syphon composed of 10 places in 42 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2954 place count 1435 transition count 2983
Symmetric choice reduction at 4 with 394 rule applications. Total rules 3348 place count 1435 transition count 2983
Deduced a syphon composed of 394 places in 43 ms
Reduce places removed 394 places and 394 transitions.
Iterating global reduction 4 with 788 rules applied. Total rules applied 4136 place count 1041 transition count 2589
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4138 place count 1041 transition count 2587
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 169 Pre rules applied. Total rules applied 4138 place count 1041 transition count 2418
Deduced a syphon composed of 169 places in 47 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 5 with 338 rules applied. Total rules applied 4476 place count 872 transition count 2418
Symmetric choice reduction at 5 with 51 rule applications. Total rules 4527 place count 872 transition count 2418
Deduced a syphon composed of 51 places in 34 ms
Reduce places removed 51 places and 597 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 4629 place count 821 transition count 1821
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 4647 place count 821 transition count 1803
Performed 212 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 212 places in 2 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 6 with 424 rules applied. Total rules applied 5071 place count 609 transition count 1584
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 5077 place count 609 transition count 1578
Symmetric choice reduction at 7 with 3 rule applications. Total rules 5080 place count 609 transition count 1578
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 36 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 5086 place count 606 transition count 1542
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -392
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 5166 place count 566 transition count 1934
Drop transitions removed 24 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 5193 place count 566 transition count 1907
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 5197 place count 564 transition count 1939
Free-agglomeration rule applied 292 times with reduction of 137 identical transitions.
Iterating global reduction 8 with 292 rules applied. Total rules applied 5489 place count 564 transition count 1510
Reduce places removed 292 places and 0 transitions.
Drop transitions removed 519 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 532 transitions.
Discarding 9 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Graph (complete) has 965 edges and 272 vertex of which 263 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Iterating post reduction 8 with 825 rules applied. Total rules applied 6314 place count 263 transition count 960
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 6335 place count 263 transition count 939
Symmetric choice reduction at 10 with 4 rule applications. Total rules 6339 place count 263 transition count 939
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 48 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 6347 place count 259 transition count 891
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 6351 place count 259 transition count 887
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 6352 place count 259 transition count 886
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 919 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Iterating post reduction 11 with 14 rules applied. Total rules applied 6366 place count 253 transition count 874
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 6369 place count 253 transition count 904
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 12 with 33 rules applied. Total rules applied 6402 place count 250 transition count 874
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 6405 place count 250 transition count 874
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 6406 place count 250 transition count 874
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 13 with 44 rules applied. Total rules applied 6450 place count 250 transition count 830
Symmetric choice reduction at 13 with 1 rule applications. Total rules 6451 place count 250 transition count 830
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 12 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6453 place count 249 transition count 818
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 6454 place count 249 transition count 817
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 6459 place count 249 transition count 812
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 52 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 14 with 61 rules applied. Total rules applied 6520 place count 244 transition count 756
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 6526 place count 244 transition count 750
Applied a total of 6526 rules in 1882 ms. Remains 244 /3088 variables (removed 2844) and now considering 750/4732 (removed 3982) transitions.
Finished structural reductions, in 1 iterations. Remains : 244/3088 places, 750/4732 transitions.
Finished random walk after 7139 steps, including 0 resets, run visited all 7 properties in 92 ms. (steps per millisecond=77 )
FORMULA DLCround-PT-08b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="DLCround-PT-08b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DLCround-PT-08b, 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 r180-ebro-158987900400543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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