fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r162-oct2-158972927100246
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for SafeBus-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.610 9433.00 19868.00 74.90 F normal

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.r162-oct2-158972927100246.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 SafeBus-PT-03, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-oct2-158972927100246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 93K Mar 24 05:38 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1589992286428

[2020-05-20 16:31:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2020-05-20 16:31:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 16:31:28] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-05-20 16:31:28] [INFO ] Transformed 57 places.
[2020-05-20 16:31:28] [INFO ] Transformed 91 transitions.
[2020-05-20 16:31:28] [INFO ] Parsed PT model containing 57 places and 91 transitions in 79 ms.
Reduce places removed 3 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 15 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.15568KB memory used
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 29 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2020-05-20 16:31:28] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2020-05-20 16:31:28] [INFO ] Computed 17 place invariants in 5 ms
[2020-05-20 16:31:28] [INFO ] Implicit Places using invariants in 246 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 266 ms to find 3 implicit places.
[2020-05-20 16:31:28] [INFO ] Redundant transitions in 2 ms returned []
[2020-05-20 16:31:28] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 51 cols
[2020-05-20 16:31:28] [INFO ] Computed 14 place invariants in 6 ms
[2020-05-20 16:31:28] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned [7, 11, 15, 16, 20, 24, 25, 29, 33]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions :[33, 29, 25, 24, 20, 16, 15, 11, 7]
Starting structural reductions, iteration 1 : 51/54 places, 82/91 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 12 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2020-05-20 16:31:29] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2020-05-20 16:31:29] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-20 16:31:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2020-05-20 16:31:29] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2020-05-20 16:31:29] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-20 16:31:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-20 16:31:29] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1004 ms (no deadlock found). (steps per millisecond=1245 )
Random directed walk for 1250000 steps, including 0 resets, run took 735 ms (no deadlock found). (steps per millisecond=1700 )
[2020-05-20 16:31:31] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2020-05-20 16:31:31] [INFO ] Computed 14 place invariants in 0 ms
[2020-05-20 16:31:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-20 16:31:31] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-20 16:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 16:31:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-20 16:31:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 16:31:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2020-05-20 16:31:31] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-20 16:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 16:31:31] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-20 16:31:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-20 16:31:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2020-05-20 16:31:31] [INFO ] Deduced a trap composed of 11 places in 38 ms
[2020-05-20 16:31:31] [INFO ] Deduced a trap composed of 11 places in 16 ms
[2020-05-20 16:31:31] [INFO ] Deduced a trap composed of 11 places in 12 ms
[2020-05-20 16:31:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 85 ms
[2020-05-20 16:31:31] [INFO ] Computed and/alt/rep : 79/693/65 causal constraints in 4 ms.
[2020-05-20 16:31:31] [INFO ] Added : 53 causal constraints over 11 iterations in 178 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Parikh directed walk for 10300 steps, including 737 resets, run took 33 ms. (steps per millisecond=312 )
Random directed walk for 500000 steps, including 0 resets, run took 255 ms (no deadlock found). (steps per millisecond=1960 )
Random walk for 500000 steps, including 0 resets, run took 344 ms (no deadlock found). (steps per millisecond=1453 )
Random directed walk for 500000 steps, including 0 resets, run took 297 ms (no deadlock found). (steps per millisecond=1683 )
Random walk for 500000 steps, including 0 resets, run took 350 ms (no deadlock found). (steps per millisecond=1428 )
[2020-05-20 16:31:33] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 16:31:33] [INFO ] Applying decomposition
[2020-05-20 16:31:33] [INFO ] Flatten gal took : 11 ms
[2020-05-20 16:31:33] [INFO ] Input system was already deterministic with 91 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16250946405099589935.txt, -o, /tmp/graph16250946405099589935.bin, -w, /tmp/graph16250946405099589935.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16250946405099589935.bin, -l, -1, -v, -w, /tmp/graph16250946405099589935.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 16:31:33] [INFO ] Decomposing Gal with order
[2020-05-20 16:31:33] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2020-05-20 16:31:33] [INFO ] Computed 17 place invariants in 1 ms
inv : -wait_ack_1_2 - wait_ack_1_3 + cable_used_1 - FMC_1 - PMC_1 = 0
inv : ACK + T_out + MSG_1 + MSG_2 + MSG_3 + FMC_1 + FMC_2 + FMC_3 + cable_free + PMC_1 + PMC_2 + PMC_3 = 1
inv : wait_ack_1_2 + wait_ack_1_3 + listen_1 + wait_cable_1 + wait_msg_1 + loop_em_1 = 1
inv : wait_ack_1_2 + wait_ack_1_3 + AMC_1_1 + AMC_1_2 + AMC_1_3 + RMC_1 + PMC_1 + listen_1 + wait_msg_1 + loop_em_1 = 1
inv : -wait_ack_3_1 - wait_ack_3_2 + cable_used_3 - FMC_3 - PMC_3 = 0
inv : AMC_3_1 + AMC_3_2 + AMC_3_3 + RMC_3 + PMC_3 - wait_cable_3 = 0
inv : Cpt2_2 + AMC_1_1 + AMC_2_1 - AMC_1_2 - AMC_2_2 - 2*AMC_3_2 - AMC_3_3 - RMC_3 - PMC_3 + wait_cable_3 - Cpt1_2 = 0
inv : AMC_2_1 + AMC_2_2 + AMC_2_3 + RMC_2 + PMC_2 - wait_cable_2 = 0
inv : Cpt1_1 + Cpt1_2 + Cpt1_3 = 1
inv : FMCb + FMC_1 + FMC_2 + FMC_3 = 1
inv : -ACK - T_out + wait_ack_3_1 + wait_ack_1_2 + wait_ack_3_2 + wait_ack_1_3 - MSG_1 - MSG_2 - MSG_3 + cable_used_2 - FMC_2 - PMC_2 = 0
inv : Cpt2_1 - AMC_1_1 - AMC_2_1 + AMC_3_2 + AMC_1_3 + AMC_2_3 + 2*AMC_3_3 + RMC_3 + PMC_3 - wait_cable_3 + Cpt1_2 + Cpt1_3 = 1
inv : -ACK - T_out + wait_ack_2_1 + wait_ack_3_1 + wait_ack_1_2 + wait_ack_3_2 + wait_ack_1_3 + wait_ack_2_3 - MSG_1 - MSG_2 - MSG_3 = 0
inv : R_tout + S_tout = 1
inv : Cpt2_3 + AMC_1_2 + AMC_2_2 + AMC_3_2 - AMC_1_3 - AMC_2_3 - AMC_3_3 - Cpt1_3 = 0
inv : ACK + T_out - wait_ack_3_1 - wait_ack_1_2 - wait_ack_3_2 - wait_ack_1_3 + MSG_1 + MSG_2 + MSG_3 + listen_2 + wait_cable_2 + wait_msg_2 + loop_em_2 = 1
inv : wait_ack_3_1 + wait_ack_3_2 + listen_3 + wait_cable_3 + wait_msg_3 + loop_em_3 = 1
Total of 17 invariants.
[2020-05-20 16:31:33] [INFO ] Computed 17 place invariants in 2 ms
[2020-05-20 16:31:33] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-20 16:31:33] [INFO ] Flatten gal took : 96 ms
[2020-05-20 16:31:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 6 ms.
[2020-05-20 16:31:33] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 36 ordering constraints for composite.
[2020-05-20 16:31:33] [INFO ] Proved 54 variables to be positive in 352 ms
[2020-05-20 16:31:33] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2020-05-20 16:31:33] [INFO ] Computation of disable matrix completed :0/91 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 16:31:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 16:31:33] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2020-05-20 16:31:33] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 16:31:33] [INFO ] Computing symmetric co enabling matrix : 91 transitions.
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,4650,1.7208,60120,801,1603,15063,14721,268,251879,167,615923,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,1.93166,60120,1,0,15063,24053,669,251879,887,615923,15301

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-20 16:31:35] [INFO ] Built C files in 2345ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589992295861

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -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 1800 -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="SafeBus-PT-03"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-PT-03, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-oct2-158972927100246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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