fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r343-tall-167889215100126
Last Updated
May 14, 2023

About the Execution of LTSMin+red for RERS17pb115-PT-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8705.827 1800000.00 1879593.00 4331.70 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r343-tall-167889215100126.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 ltsminxred
Input is RERS17pb115-PT-8, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215100126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.6K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 1679131587377

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=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-8
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:26:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 09:26:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:26:30] [INFO ] Load time of PNML (sax parser for PT used): 1775 ms
[2023-03-18 09:26:31] [INFO ] Transformed 1399 places.
[2023-03-18 09:26:31] [INFO ] Transformed 144369 transitions.
[2023-03-18 09:26:31] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2256 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 46 ms.501920KB 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 3590 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 3604 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 350313 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:27:06] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 09:27:06] [INFO ] Computed 19 place invariants in 402 ms
[2023-03-18 09:27:29] [INFO ] [Real]Absence check using 19 positive place invariants in 84 ms returned sat
[2023-03-18 09:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:27:47] [INFO ] [Real]Absence check using state equation in 18644 ms returned sat
[2023-03-18 09:27:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:28:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 69 ms returned sat
[2023-03-18 09:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:28:29] [INFO ] [Nat]Absence check using state equation in 18674 ms returned sat
[2023-03-18 09:28:31] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:28:37] [INFO ] [Nat]Added 741 Read/Feed constraints in 6199 ms returned sat
[2023-03-18 09:28:44] [INFO ] Deduced a trap composed of 40 places in 5734 ms of which 3 ms to minimize.
[2023-03-18 09:28:51] [INFO ] Deduced a trap composed of 64 places in 6120 ms of which 1 ms to minimize.
[2023-03-18 09:28:58] [INFO ] Deduced a trap composed of 40 places in 5602 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 72 places in 6220 ms of which 1 ms to minimize.
[2023-03-18 09:29:13] [INFO ] Deduced a trap composed of 96 places in 6800 ms of which 1 ms to minimize.
[2023-03-18 09:29:20] [INFO ] Deduced a trap composed of 64 places in 6536 ms of which 1 ms to minimize.
[2023-03-18 09:29:28] [INFO ] Deduced a trap composed of 72 places in 6140 ms of which 1 ms to minimize.
[2023-03-18 09:29:35] [INFO ] Deduced a trap composed of 64 places in 6537 ms of which 1 ms to minimize.
[2023-03-18 09:29:44] [INFO ] Deduced a trap composed of 128 places in 7543 ms of which 1 ms to minimize.
[2023-03-18 09:29:52] [INFO ] Deduced a trap composed of 34 places in 6445 ms of which 1 ms to minimize.
[2023-03-18 09:29:59] [INFO ] Deduced a trap composed of 16 places in 6390 ms of which 1 ms to minimize.
[2023-03-18 09:30:09] [INFO ] Deduced a trap composed of 128 places in 8498 ms of which 2 ms to minimize.
[2023-03-18 09:30:16] [INFO ] Deduced a trap composed of 48 places in 6492 ms of which 1 ms to minimize.
[2023-03-18 09:30:24] [INFO ] Deduced a trap composed of 128 places in 6818 ms of which 1 ms to minimize.
[2023-03-18 09:30:31] [INFO ] Deduced a trap composed of 72 places in 5633 ms of which 3 ms to minimize.
[2023-03-18 09:30:39] [INFO ] Deduced a trap composed of 96 places in 6687 ms of which 1 ms to minimize.
[2023-03-18 09:30:46] [INFO ] Deduced a trap composed of 96 places in 6611 ms of which 1 ms to minimize.
[2023-03-18 09:30:55] [INFO ] Deduced a trap composed of 72 places in 6831 ms of which 0 ms to minimize.
[2023-03-18 09:31:03] [INFO ] Deduced a trap composed of 64 places in 6709 ms of which 1 ms to minimize.
[2023-03-18 09:31:10] [INFO ] Deduced a trap composed of 96 places in 6493 ms of which 0 ms to minimize.
[2023-03-18 09:31:17] [INFO ] Deduced a trap composed of 64 places in 6197 ms of which 0 ms to minimize.
[2023-03-18 09:31:24] [INFO ] Deduced a trap composed of 80 places in 5795 ms of which 0 ms to minimize.
[2023-03-18 09:31:32] [INFO ] Deduced a trap composed of 40 places in 6326 ms of which 1 ms to minimize.
[2023-03-18 09:31:39] [INFO ] Deduced a trap composed of 128 places in 5984 ms of which 0 ms to minimize.
[2023-03-18 09:31:46] [INFO ] Deduced a trap composed of 96 places in 6247 ms of which 1 ms to minimize.
[2023-03-18 09:31:53] [INFO ] Deduced a trap composed of 48 places in 6072 ms of which 0 ms to minimize.
[2023-03-18 09:32:01] [INFO ] Deduced a trap composed of 128 places in 6418 ms of which 1 ms to minimize.
[2023-03-18 09:32:08] [INFO ] Deduced a trap composed of 128 places in 5745 ms of which 1 ms to minimize.
[2023-03-18 09:32:15] [INFO ] Deduced a trap composed of 72 places in 6074 ms of which 1 ms to minimize.
[2023-03-18 09:32:22] [INFO ] Deduced a trap composed of 72 places in 5785 ms of which 1 ms to minimize.
[2023-03-18 09:32:29] [INFO ] Deduced a trap composed of 128 places in 5760 ms of which 1 ms to minimize.
[2023-03-18 09:32:37] [INFO ] Deduced a trap composed of 64 places in 6272 ms of which 1 ms to minimize.
[2023-03-18 09:32:45] [INFO ] Deduced a trap composed of 128 places in 6695 ms of which 0 ms to minimize.
[2023-03-18 09:32:52] [INFO ] Deduced a trap composed of 128 places in 6463 ms of which 1 ms to minimize.
[2023-03-18 09:32:52] [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 186844 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 347707 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 185015 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 349397 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 1222 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 09:34:53] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:34:53] [INFO ] Invariant cache hit.
[2023-03-18 09:35:02] [INFO ] Implicit Places using invariants in 8236 ms returned []
Implicit Place search using SMT only with invariants took 8238 ms to find 0 implicit places.
[2023-03-18 09:35:02] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:35:02] [INFO ] Invariant cache hit.
[2023-03-18 09:35:32] [INFO ] Performed 99662/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 09:35:45] [INFO ] Dead Transitions using invariants and state equation in 43635 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 53097 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 352084 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=11 )
[2023-03-18 09:36:15] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:36:15] [INFO ] Invariant cache hit.
[2023-03-18 09:36:38] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2023-03-18 09:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:36:56] [INFO ] [Real]Absence check using state equation in 18479 ms returned sat
[2023-03-18 09:36:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:37:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 61 ms returned sat
[2023-03-18 09:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:37:39] [INFO ] [Nat]Absence check using state equation in 18781 ms returned sat
[2023-03-18 09:37:40] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:37:46] [INFO ] [Nat]Added 741 Read/Feed constraints in 6133 ms returned sat
[2023-03-18 09:37:54] [INFO ] Deduced a trap composed of 40 places in 6285 ms of which 1 ms to minimize.
[2023-03-18 09:38:02] [INFO ] Deduced a trap composed of 72 places in 6585 ms of which 1 ms to minimize.
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 48 places in 7120 ms of which 1 ms to minimize.
[2023-03-18 09:38:19] [INFO ] Deduced a trap composed of 72 places in 7708 ms of which 1 ms to minimize.
[2023-03-18 09:38:27] [INFO ] Deduced a trap composed of 96 places in 6848 ms of which 1 ms to minimize.
[2023-03-18 09:38:34] [INFO ] Deduced a trap composed of 64 places in 6511 ms of which 0 ms to minimize.
[2023-03-18 09:38:42] [INFO ] Deduced a trap composed of 40 places in 6758 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 128 places in 7200 ms of which 1 ms to minimize.
[2023-03-18 09:38:58] [INFO ] Deduced a trap composed of 16 places in 6808 ms of which 0 ms to minimize.
[2023-03-18 09:39:07] [INFO ] Deduced a trap composed of 128 places in 7781 ms of which 1 ms to minimize.
[2023-03-18 09:39:16] [INFO ] Deduced a trap composed of 48 places in 7508 ms of which 2 ms to minimize.
[2023-03-18 09:39:24] [INFO ] Deduced a trap composed of 128 places in 7394 ms of which 1 ms to minimize.
[2023-03-18 09:39:32] [INFO ] Deduced a trap composed of 64 places in 7197 ms of which 1 ms to minimize.
[2023-03-18 09:39:41] [INFO ] Deduced a trap composed of 72 places in 7461 ms of which 1 ms to minimize.
[2023-03-18 09:39:49] [INFO ] Deduced a trap composed of 72 places in 7094 ms of which 1 ms to minimize.
[2023-03-18 09:39:57] [INFO ] Deduced a trap composed of 64 places in 6937 ms of which 0 ms to minimize.
[2023-03-18 09:40:05] [INFO ] Deduced a trap composed of 80 places in 6883 ms of which 1 ms to minimize.
[2023-03-18 09:40:13] [INFO ] Deduced a trap composed of 96 places in 6923 ms of which 2 ms to minimize.
[2023-03-18 09:40:21] [INFO ] Deduced a trap composed of 64 places in 6888 ms of which 1 ms to minimize.
[2023-03-18 09:40:30] [INFO ] Deduced a trap composed of 128 places in 7221 ms of which 2 ms to minimize.
[2023-03-18 09:40:38] [INFO ] Deduced a trap composed of 96 places in 7108 ms of which 0 ms to minimize.
[2023-03-18 09:40:46] [INFO ] Deduced a trap composed of 72 places in 6372 ms of which 0 ms to minimize.
[2023-03-18 09:40:53] [INFO ] Deduced a trap composed of 96 places in 6009 ms of which 4 ms to minimize.
[2023-03-18 09:41:00] [INFO ] Deduced a trap composed of 128 places in 6261 ms of which 0 ms to minimize.
[2023-03-18 09:41:08] [INFO ] Deduced a trap composed of 128 places in 6779 ms of which 1 ms to minimize.
[2023-03-18 09:41:16] [INFO ] Deduced a trap composed of 40 places in 6316 ms of which 0 ms to minimize.
[2023-03-18 09:41:23] [INFO ] Deduced a trap composed of 34 places in 6252 ms of which 1 ms to minimize.
[2023-03-18 09:41:30] [INFO ] Deduced a trap composed of 128 places in 6131 ms of which 1 ms to minimize.
[2023-03-18 09:41:37] [INFO ] Deduced a trap composed of 96 places in 5799 ms of which 0 ms to minimize.
[2023-03-18 09:41:45] [INFO ] Deduced a trap composed of 64 places in 6140 ms of which 1 ms to minimize.
[2023-03-18 09:41:51] [INFO ] Deduced a trap composed of 96 places in 5473 ms of which 0 ms to minimize.
[2023-03-18 09:41:58] [INFO ] Deduced a trap composed of 128 places in 5850 ms of which 1 ms to minimize.
[2023-03-18 09:41:58] [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 199206 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 360335 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 197663 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 339440 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:44:02] [INFO ] Flatten gal took : 3681 ms
[2023-03-18 09:44:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 4 ms.
[2023-03-18 09:44:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 300 ms.
Total runtime 1054118 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 14961004 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15946728 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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-8"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RERS17pb115-PT-8, 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 r343-tall-167889215100126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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