fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r150-smll-165276998400143
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for NoC3x3-PT-2B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
312.203 23869.00 45181.00 232.80 TFTTFTFTFFTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998400143.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998400143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 548K May 10 09:34 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 NoC3x3-PT-2B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654241257963

Running Version 202205111006
[2022-06-03 07:27:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 07:27:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 07:27:41] [INFO ] Load time of PNML (sax parser for PT used): 487 ms
[2022-06-03 07:27:41] [INFO ] Transformed 2003 places.
[2022-06-03 07:27:41] [INFO ] Transformed 2292 transitions.
[2022-06-03 07:27:41] [INFO ] Found NUPN structural information;
[2022-06-03 07:27:41] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 783 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2022-06-03 07:27:42] [INFO ] Computed 66 place invariants in 64 ms
[2022-06-03 07:27:44] [INFO ] [Real]Absence check using 66 positive place invariants in 83 ms returned sat
[2022-06-03 07:27:44] [INFO ] After 1472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 07:27:45] [INFO ] [Nat]Absence check using 66 positive place invariants in 75 ms returned sat
[2022-06-03 07:27:47] [INFO ] After 2497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 07:27:48] [INFO ] Deduced a trap composed of 39 places in 736 ms of which 9 ms to minimize.
[2022-06-03 07:27:49] [INFO ] Deduced a trap composed of 17 places in 919 ms of which 3 ms to minimize.
[2022-06-03 07:27:50] [INFO ] Deduced a trap composed of 70 places in 1030 ms of which 3 ms to minimize.
[2022-06-03 07:27:51] [INFO ] Deduced a trap composed of 51 places in 1013 ms of which 3 ms to minimize.
[2022-06-03 07:27:52] [INFO ] Deduced a trap composed of 65 places in 492 ms of which 2 ms to minimize.
[2022-06-03 07:27:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5026 ms
[2022-06-03 07:27:53] [INFO ] Deduced a trap composed of 66 places in 657 ms of which 2 ms to minimize.
[2022-06-03 07:27:54] [INFO ] Deduced a trap composed of 128 places in 552 ms of which 1 ms to minimize.
[2022-06-03 07:27:55] [INFO ] Deduced a trap composed of 101 places in 584 ms of which 2 ms to minimize.
[2022-06-03 07:27:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2388 ms
[2022-06-03 07:27:56] [INFO ] Deduced a trap composed of 111 places in 502 ms of which 1 ms to minimize.
[2022-06-03 07:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
[2022-06-03 07:27:56] [INFO ] After 11357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 618 ms.
[2022-06-03 07:27:57] [INFO ] After 12966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 2775 ms.
Support contains 32 out of 2003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1558 edges and 2003 vertex of which 48 / 2003 are part of one of the 6 SCC in 11 ms
Free SCC test removed 42 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 394 rules applied. Total rules applied 395 place count 1952 transition count 1859
Reduce places removed 385 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 407 rules applied. Total rules applied 802 place count 1567 transition count 1837
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 824 place count 1545 transition count 1837
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 824 place count 1545 transition count 1813
Deduced a syphon composed of 24 places in 7 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 872 place count 1521 transition count 1813
Discarding 349 places :
Symmetric choice reduction at 3 with 349 rule applications. Total rules 1221 place count 1172 transition count 1464
Iterating global reduction 3 with 349 rules applied. Total rules applied 1570 place count 1172 transition count 1464
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 1570 place count 1172 transition count 1428
Deduced a syphon composed of 36 places in 11 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1642 place count 1136 transition count 1428
Discarding 127 places :
Symmetric choice reduction at 3 with 127 rule applications. Total rules 1769 place count 1009 transition count 1266
Iterating global reduction 3 with 127 rules applied. Total rules applied 1896 place count 1009 transition count 1266
Discarding 118 places :
Symmetric choice reduction at 3 with 118 rule applications. Total rules 2014 place count 891 transition count 1136
Iterating global reduction 3 with 118 rules applied. Total rules applied 2132 place count 891 transition count 1136
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2172 place count 851 transition count 1066
Iterating global reduction 3 with 40 rules applied. Total rules applied 2212 place count 851 transition count 1066
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 13 rules applied. Total rules applied 2225 place count 850 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2226 place count 849 transition count 1054
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 2255 place count 820 transition count 1025
Iterating global reduction 5 with 29 rules applied. Total rules applied 2284 place count 820 transition count 1025
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2286 place count 819 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2287 place count 818 transition count 1024
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2303 place count 802 transition count 992
Iterating global reduction 7 with 16 rules applied. Total rules applied 2319 place count 802 transition count 992
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2335 place count 786 transition count 976
Iterating global reduction 7 with 16 rules applied. Total rules applied 2351 place count 786 transition count 976
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 18 rules applied. Total rules applied 2369 place count 785 transition count 959
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2370 place count 784 transition count 959
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 9 with 606 rules applied. Total rules applied 2976 place count 481 transition count 656
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 2988 place count 469 transition count 644
Iterating global reduction 9 with 12 rules applied. Total rules applied 3000 place count 469 transition count 644
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 3008 place count 461 transition count 628
Iterating global reduction 9 with 8 rules applied. Total rules applied 3016 place count 461 transition count 628
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3017 place count 460 transition count 626
Iterating global reduction 9 with 1 rules applied. Total rules applied 3018 place count 460 transition count 626
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 3054 place count 442 transition count 654
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 3073 place count 442 transition count 635
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 3097 place count 423 transition count 630
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3099 place count 423 transition count 628
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3100 place count 423 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3101 place count 422 transition count 627
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 3107 place count 422 transition count 627
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 3112 place count 422 transition count 627
Applied a total of 3112 rules in 1117 ms. Remains 422 /2003 variables (removed 1581) and now considering 627/2292 (removed 1665) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/2003 places, 627/2292 transitions.
Finished random walk after 149164 steps, including 1497 resets, run visited all 2 properties in 688 ms. (steps per millisecond=216 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21508 ms.

BK_STOP 1654241281832

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="NoC3x3-PT-2B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-2B, 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 r150-smll-165276998400143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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