Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r341-tall-167889213600121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is RERS17pb115-PT-7, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213600121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M Mar 5 18:23 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 1679099599166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-7
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 00:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 00:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 00:33:22] [INFO ] Load time of PNML (sax parser for PT used): 1943 ms
[2023-03-18 00:33:22] [INFO ] Transformed 1399 places.
[2023-03-18 00:33:23] [INFO ] Transformed 144369 transitions.
[2023-03-18 00:33:23] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2458 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 42 ms.157607KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 19 rules in 3569 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3584 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 359448 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 00:33:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 00:33:58] [INFO ] Computed 19 place invariants in 358 ms
[2023-03-18 00:34:20] [INFO ] [Real]Absence check using 19 positive place invariants in 84 ms returned sat
[2023-03-18 00:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:34:39] [INFO ] [Real]Absence check using state equation in 18306 ms returned sat
[2023-03-18 00:34:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:35:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 77 ms returned sat
[2023-03-18 00:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:35:21] [INFO ] [Nat]Absence check using state equation in 18558 ms returned sat
[2023-03-18 00:35:21] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:35:28] [INFO ] [Nat]Added 741 Read/Feed constraints in 6465 ms returned sat
[2023-03-18 00:35:36] [INFO ] Deduced a trap composed of 16 places in 7057 ms of which 494 ms to minimize.
[2023-03-18 00:35:44] [INFO ] Deduced a trap composed of 64 places in 6360 ms of which 1 ms to minimize.
[2023-03-18 00:35:52] [INFO ] Deduced a trap composed of 40 places in 7339 ms of which 1 ms to minimize.
[2023-03-18 00:36:01] [INFO ] Deduced a trap composed of 72 places in 7847 ms of which 5 ms to minimize.
[2023-03-18 00:36:09] [INFO ] Deduced a trap composed of 64 places in 7305 ms of which 1 ms to minimize.
[2023-03-18 00:36:18] [INFO ] Deduced a trap composed of 72 places in 7135 ms of which 1 ms to minimize.
[2023-03-18 00:36:27] [INFO ] Deduced a trap composed of 48 places in 8693 ms of which 2 ms to minimize.
[2023-03-18 00:36:36] [INFO ] Deduced a trap composed of 128 places in 7371 ms of which 1 ms to minimize.
[2023-03-18 00:36:44] [INFO ] Deduced a trap composed of 96 places in 7101 ms of which 1 ms to minimize.
[2023-03-18 00:36:53] [INFO ] Deduced a trap composed of 72 places in 7289 ms of which 1 ms to minimize.
[2023-03-18 00:37:01] [INFO ] Deduced a trap composed of 72 places in 7513 ms of which 0 ms to minimize.
[2023-03-18 00:37:10] [INFO ] Deduced a trap composed of 64 places in 7413 ms of which 1 ms to minimize.
[2023-03-18 00:37:18] [INFO ] Deduced a trap composed of 48 places in 6270 ms of which 1 ms to minimize.
[2023-03-18 00:37:26] [INFO ] Deduced a trap composed of 40 places in 7369 ms of which 0 ms to minimize.
[2023-03-18 00:37:34] [INFO ] Deduced a trap composed of 96 places in 7289 ms of which 1 ms to minimize.
[2023-03-18 00:37:43] [INFO ] Deduced a trap composed of 72 places in 6877 ms of which 2 ms to minimize.
[2023-03-18 00:37:51] [INFO ] Deduced a trap composed of 34 places in 6914 ms of which 1 ms to minimize.
[2023-03-18 00:37:59] [INFO ] Deduced a trap composed of 128 places in 7029 ms of which 1 ms to minimize.
[2023-03-18 00:38:06] [INFO ] Deduced a trap composed of 128 places in 6601 ms of which 1 ms to minimize.
[2023-03-18 00:38:14] [INFO ] Deduced a trap composed of 72 places in 6598 ms of which 1 ms to minimize.
[2023-03-18 00:38:22] [INFO ] Deduced a trap composed of 128 places in 6520 ms of which 1 ms to minimize.
[2023-03-18 00:38:29] [INFO ] Deduced a trap composed of 64 places in 6192 ms of which 2 ms to minimize.
[2023-03-18 00:38:37] [INFO ] Deduced a trap composed of 128 places in 7115 ms of which 1 ms to minimize.
[2023-03-18 00:38:46] [INFO ] Deduced a trap composed of 40 places in 7496 ms of which 1 ms to minimize.
[2023-03-18 00:38:54] [INFO ] Deduced a trap composed of 96 places in 7558 ms of which 1 ms to minimize.
[2023-03-18 00:39:02] [INFO ] Deduced a trap composed of 96 places in 6216 ms of which 0 ms to minimize.
[2023-03-18 00:39:09] [INFO ] Deduced a trap composed of 64 places in 6442 ms of which 1 ms to minimize.
[2023-03-18 00:39:16] [INFO ] Deduced a trap composed of 128 places in 5868 ms of which 0 ms to minimize.
[2023-03-18 00:39:23] [INFO ] Deduced a trap composed of 128 places in 5758 ms of which 1 ms to minimize.
[2023-03-18 00:39:32] [INFO ] Deduced a trap composed of 64 places in 6928 ms of which 1 ms to minimize.
[2023-03-18 00:39:39] [INFO ] Deduced a trap composed of 128 places in 6755 ms of which 0 ms to minimize.
[2023-03-18 00:39:46] [INFO ] Deduced a trap composed of 96 places in 5938 ms of which 1 ms to minimize.
[2023-03-18 00:39:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 197143 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=6 )
Interrupted Random walk after 363657 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 193421 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=6 )
Interrupted Random walk after 348359 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1258 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 00:41:48] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:41:48] [INFO ] Invariant cache hit.
[2023-03-18 00:41:57] [INFO ] Implicit Places using invariants in 8951 ms returned []
Implicit Place search using SMT only with invariants took 8964 ms to find 0 implicit places.
[2023-03-18 00:41:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:41:57] [INFO ] Invariant cache hit.
[2023-03-18 00:42:27] [INFO ] Performed 94198/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 00:42:43] [INFO ] Dead Transitions using invariants and state equation in 46360 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 56584 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 335630 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 00:43:13] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:43:13] [INFO ] Invariant cache hit.
[2023-03-18 00:43:36] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2023-03-18 00:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:43:55] [INFO ] [Real]Absence check using state equation in 19034 ms returned sat
[2023-03-18 00:43:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:44:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 42 ms returned sat
[2023-03-18 00:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:44:39] [INFO ] [Nat]Absence check using state equation in 19343 ms returned sat
[2023-03-18 00:44:40] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:44:46] [INFO ] [Nat]Added 741 Read/Feed constraints in 5936 ms returned sat
[2023-03-18 00:44:54] [INFO ] Deduced a trap composed of 48 places in 7615 ms of which 1 ms to minimize.
[2023-03-18 00:45:03] [INFO ] Deduced a trap composed of 72 places in 7223 ms of which 1 ms to minimize.
[2023-03-18 00:45:11] [INFO ] Deduced a trap composed of 40 places in 6820 ms of which 4 ms to minimize.
[2023-03-18 00:45:18] [INFO ] Deduced a trap composed of 128 places in 6488 ms of which 1 ms to minimize.
[2023-03-18 00:45:25] [INFO ] Deduced a trap composed of 96 places in 6187 ms of which 0 ms to minimize.
[2023-03-18 00:45:33] [INFO ] Deduced a trap composed of 48 places in 6738 ms of which 0 ms to minimize.
[2023-03-18 00:45:41] [INFO ] Deduced a trap composed of 34 places in 6983 ms of which 0 ms to minimize.
[2023-03-18 00:45:49] [INFO ] Deduced a trap composed of 64 places in 6796 ms of which 2 ms to minimize.
[2023-03-18 00:45:57] [INFO ] Deduced a trap composed of 40 places in 7091 ms of which 1 ms to minimize.
[2023-03-18 00:46:05] [INFO ] Deduced a trap composed of 96 places in 6776 ms of which 1 ms to minimize.
[2023-03-18 00:46:13] [INFO ] Deduced a trap composed of 40 places in 6693 ms of which 1 ms to minimize.
[2023-03-18 00:46:20] [INFO ] Deduced a trap composed of 72 places in 5723 ms of which 0 ms to minimize.
[2023-03-18 00:46:27] [INFO ] Deduced a trap composed of 64 places in 5831 ms of which 0 ms to minimize.
[2023-03-18 00:46:34] [INFO ] Deduced a trap composed of 16 places in 5618 ms of which 1 ms to minimize.
[2023-03-18 00:46:40] [INFO ] Deduced a trap composed of 72 places in 5341 ms of which 0 ms to minimize.
[2023-03-18 00:46:47] [INFO ] Deduced a trap composed of 64 places in 5828 ms of which 1 ms to minimize.
[2023-03-18 00:46:54] [INFO ] Deduced a trap composed of 72 places in 5556 ms of which 1 ms to minimize.
[2023-03-18 00:47:01] [INFO ] Deduced a trap composed of 72 places in 6364 ms of which 1 ms to minimize.
[2023-03-18 00:47:09] [INFO ] Deduced a trap composed of 96 places in 6399 ms of which 1 ms to minimize.
[2023-03-18 00:47:17] [INFO ] Deduced a trap composed of 64 places in 7356 ms of which 0 ms to minimize.
[2023-03-18 00:47:26] [INFO ] Deduced a trap composed of 72 places in 7159 ms of which 0 ms to minimize.
[2023-03-18 00:47:33] [INFO ] Deduced a trap composed of 128 places in 6630 ms of which 1 ms to minimize.
[2023-03-18 00:47:42] [INFO ] Deduced a trap composed of 128 places in 7232 ms of which 0 ms to minimize.
[2023-03-18 00:47:49] [INFO ] Deduced a trap composed of 96 places in 6466 ms of which 5 ms to minimize.
[2023-03-18 00:47:58] [INFO ] Deduced a trap composed of 96 places in 7030 ms of which 0 ms to minimize.
[2023-03-18 00:48:05] [INFO ] Deduced a trap composed of 64 places in 6090 ms of which 0 ms to minimize.
[2023-03-18 00:48:13] [INFO ] Deduced a trap composed of 128 places in 6615 ms of which 0 ms to minimize.
[2023-03-18 00:48:20] [INFO ] Deduced a trap composed of 64 places in 5793 ms of which 0 ms to minimize.
[2023-03-18 00:48:27] [INFO ] Deduced a trap composed of 128 places in 6527 ms of which 0 ms to minimize.
[2023-03-18 00:48:34] [INFO ] Deduced a trap composed of 128 places in 5861 ms of which 0 ms to minimize.
[2023-03-18 00:48:40] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 234274 ms
[2023-03-18 00:48:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 81236 transitions) in 14173 ms.
[2023-03-18 00:49:09] [INFO ] Deduced a trap composed of 4 places in 11747 ms of which 2 ms to minimize.
[2023-03-18 00:49:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 187899 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=6 )
Interrupted Random walk after 350481 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 195331 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 341045 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 00:51:14] [INFO ] Flatten gal took : 4221 ms
[2023-03-18 00:51:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 00:51:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 314 ms.
Total runtime 1074010 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RERS17pb115-PT-7
BK_EXAMINATION: ReachabilityDeadlock
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
GlobalProperty: ReachabilityDeadlock

BK_STOP 1679101378055

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 756 Killed lola --conf=$BIN_DIR/configfiles/globalconf --check=deadlockfreedom $DIR/model.pnml

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="RERS17pb115-PT-7"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is RERS17pb115-PT-7, 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 r341-tall-167889213600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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