Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100462.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 BusinessProcesses-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589250115197

[2020-05-12 02:21:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:21:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:21:56] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-12 02:21:56] [INFO ] Transformed 262 places.
[2020-05-12 02:21:56] [INFO ] Transformed 219 transitions.
[2020-05-12 02:21:56] [INFO ] Found NUPN structural information;
[2020-05-12 02:21:56] [INFO ] Parsed PT model containing 262 places and 219 transitions in 101 ms.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 136 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:21:56] [INFO ] Computed 43 place invariants in 9 ms
[2020-05-12 02:21:57] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2020-05-12 02:21:57] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:57] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-05-12 02:21:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2020-05-12 02:21:57] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:57] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 22 places in 61 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 60 places in 54 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 19 places in 52 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 65 places in 51 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 25 places in 46 ms
[2020-05-12 02:21:57] [INFO ] Deduced a trap composed of 64 places in 46 ms
[2020-05-12 02:21:58] [INFO ] Deduced a trap composed of 20 places in 48 ms
[2020-05-12 02:21:58] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2020-05-12 02:21:58] [INFO ] Deduced a trap composed of 31 places in 50 ms
[2020-05-12 02:21:58] [INFO ] Deduced a trap composed of 63 places in 53 ms
[2020-05-12 02:21:58] [INFO ] Deduced a trap composed of 69 places in 49 ms
[2020-05-12 02:21:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 859 ms
[2020-05-12 02:21:58] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:21:58] [INFO ] Added : 148 causal constraints over 30 iterations in 584 ms. Result :sat
[2020-05-12 02:21:58] [INFO ] Deduced a trap composed of 64 places in 50 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 63 places in 45 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 65 places in 63 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 68 places in 48 ms
[2020-05-12 02:21:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 313 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-05-12 02:21:59] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:21:59] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:59] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-05-12 02:21:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-05-12 02:21:59] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:59] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 15 places in 51 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 11 places in 44 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 10 places in 44 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 19 places in 36 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 17 places in 38 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 20 places in 28 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 36 places in 32 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2020-05-12 02:22:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 688 ms
[2020-05-12 02:22:00] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:22:00] [INFO ] Added : 149 causal constraints over 31 iterations in 507 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-05-12 02:22:00] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:22:00] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:01] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-05-12 02:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:22:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-05-12 02:22:01] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:22:01] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:01] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-05-12 02:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:22:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 46 ms returned sat
[2020-05-12 02:22:01] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 12 ms returned sat
[2020-05-12 02:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:01] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-05-12 02:22:01] [INFO ] Deduced a trap composed of 13 places in 119 ms
[2020-05-12 02:22:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 130 ms
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 14600 steps, including 229 resets, run finished after 21 ms. (steps per millisecond=695 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14100 steps, including 214 resets, run finished after 19 ms. (steps per millisecond=742 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 138 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 227 transition count 138
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 113 place count 176 transition count 138
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 113 place count 176 transition count 103
Deduced a syphon composed of 35 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 190 place count 134 transition count 103
Symmetric choice reduction at 2 with 28 rule applications. Total rules 218 place count 134 transition count 103
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 274 place count 106 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 352 place count 66 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 66 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 65 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 355 place count 65 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 64 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 357 place count 63 transition count 35
Applied a total of 357 rules in 40 ms. Remains 63 /245 variables (removed 182) and now considering 35/204 (removed 169) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/245 places, 35/204 transitions.
Finished random walk after 99 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=99 )
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589250122925

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;