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.r288-smll-165307357200114.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 gold2021
Input is UtilityControlRoom-PT-Z2T4N02, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r288-smll-165307357200114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 11K Apr 29 18:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 18:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 24K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1653210058059

Running Version 0
[2022-05-22 09:01:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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, 1800]
[2022-05-22 09:01:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 09:01:01] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2022-05-22 09:01:01] [INFO ] Transformed 38 places.
[2022-05-22 09:01:01] [INFO ] Transformed 54 transitions.
[2022-05-22 09:01:01] [INFO ] Parsed PT model containing 38 places and 54 transitions in 124 ms.
Discarding 16 transitions out of 54. Remains 38
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.15020KB memory used
Starting structural reductions, iteration 0 : 38/38 places, 46/46 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 42
Applied a total of 4 rules in 22 ms. Remains 38 /38 variables (removed 0) and now considering 42/46 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 42/46 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1201 ms (no deadlock found). (steps per millisecond=1040 )
Random directed walk for 1250002 steps, including 0 resets, run took 804 ms (no deadlock found). (steps per millisecond=1554 )
// Phase 1: matrix 42 rows 38 cols
[2022-05-22 09:01:03] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-22 09:01:03] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
Starting structural reductions, iteration 0 : 38/38 places, 54/54 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 38 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 28 place count 30 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 30 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 26 transition count 30
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 22 transition count 26
Applied a total of 44 rules in 17 ms. Remains 22 /38 variables (removed 16) and now considering 26/54 (removed 28) transitions.
// Phase 1: matrix 26 rows 22 cols
[2022-05-22 09:01:03] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-22 09:01:04] [INFO ] Implicit Places using invariants in 126 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 130 ms to find 2 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2022-05-22 09:01:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-22 09:01:04] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 20/38 places, 26/54 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 22
Applied a total of 8 rules in 5 ms. Remains 16 /20 variables (removed 4) and now considering 22/26 (removed 4) transitions.
// Phase 1: matrix 22 rows 16 cols
[2022-05-22 09:01:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-22 09:01:04] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 22 rows 16 cols
[2022-05-22 09:01:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-22 09:01:04] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/38 places, 22/54 transitions.
Discarding 4 transitions out of 22. Remains 18
[2022-05-22 09:01:04] [INFO ] Initial state test concluded for 2 properties.
Finished random walk after 57 steps, including 0 resets, run visited all 16 properties in 2 ms. (steps per millisecond=28 )
Able to resolve query QuasiLiveness after proving 18 properties.
Starting structural reductions, iteration 0 : 38/38 places, 54/54 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 38 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 28 place count 30 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 30 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 26 transition count 30
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 22 transition count 26
Applied a total of 44 rules in 6 ms. Remains 22 /38 variables (removed 16) and now considering 26/54 (removed 28) transitions.
// Phase 1: matrix 26 rows 22 cols
[2022-05-22 09:01:04] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-22 09:01:04] [INFO ] Implicit Places using invariants in 80 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
// Phase 1: matrix 26 rows 20 cols
[2022-05-22 09:01:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-22 09:01:04] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 20/38 places, 26/54 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 22
Applied a total of 8 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 22/26 (removed 4) transitions.
// Phase 1: matrix 22 rows 16 cols
[2022-05-22 09:01:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-22 09:01:04] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 22 rows 16 cols
[2022-05-22 09:01:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-22 09:01:04] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/38 places, 22/54 transitions.
Discarding 4 transitions out of 22. Remains 18
[2022-05-22 09:01:04] [INFO ] Flatten gal took : 47 ms
[2022-05-22 09:01:04] [INFO ] Flatten gal took : 13 ms
[2022-05-22 09:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability42798320152794709.gal : 9 ms
[2022-05-22 09:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16979211784189946091.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability42798320152794709.gal, -t, CGAL, -ctl, /tmp/CTLFireability16979211784189946091.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability42798320152794709.gal -t CGAL -ctl /tmp/CTLFireability16979211784189946091.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 18 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,171,0.019589,4376,2,53,5,223,6,0,89,151,0


Converting to forward existential form...Done !
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.026889,4764,1,0,6,900,14,0,414,373,5
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 1,1,0.02934,5028,1,0,7,947,15,0,415,396,8
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 2,1,0.030834,5028,1,0,8,967,16,0,416,423,11
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 3,1,0.032183,5028,1,0,9,973,17,0,417,427,14
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 4,1,0.033915,5028,1,0,10,1010,18,0,418,443,17
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 5,1,0.035275,5028,1,0,11,1042,19,0,419,448,20
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 6,1,0.036901,5028,1,0,12,1049,20,0,420,449,23
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 7,1,0.038087,5028,1,0,13,1049,21,0,421,449,26
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_0>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_0>=1))))] = FALSE
(forward)formula 8,1,0.038987,5028,1,0,14,1054,22,0,421,459,29
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_1>=1))))] = FALSE
(forward)formula 9,1,0.039616,5028,1,0,15,1054,23,0,421,459,32
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_0>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_0>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 10,1,0.040859,5028,1,0,16,1082,24,0,422,461,35
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_0>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_0>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 11,1,0.042328,5028,1,0,17,1133,25,0,423,478,38
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_1>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_1>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 12,1,0.043597,5028,1,0,18,1163,26,0,424,484,41
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_1>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_1>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 13,1,0.045371,5028,1,0,19,1238,27,0,425,535,44
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_0>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_0>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 14,1,0.046516,5028,1,0,20,1244,28,0,426,538,47
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_0>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_0>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 15,1,0.04758,5028,1,0,21,1249,29,0,427,539,50
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_1>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_1>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 16,1,0.048791,5028,1,0,22,1260,30,0,428,544,53
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_1>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_1>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 17,1,0.050122,5028,1,0,23,1289,31,0,429,561,56
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 18 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1653210066730

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -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 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="UtilityControlRoom-PT-Z2T4N02"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2021"
echo " Input is UtilityControlRoom-PT-Z2T4N02, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r288-smll-165307357200114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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