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

About the Execution of Marcie+red for RERS17pb115-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9308.487 1800000.00 1899207.00 4868.40 [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.r344-tall-167889215900096.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 marciexred
Input is RERS17pb115-PT-2, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r344-tall-167889215900096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:48 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 27K 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 18K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 13:57 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 1679128440408

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=marciexred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 08:34:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 08:34:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 08:34:04] [INFO ] Load time of PNML (sax parser for PT used): 1931 ms
[2023-03-18 08:34:04] [INFO ] Transformed 1399 places.
[2023-03-18 08:34:04] [INFO ] Transformed 144369 transitions.
[2023-03-18 08:34:04] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2413 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 55 ms.177823KB 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 3953 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 3975 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 275212 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 08:34:39] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 08:34:40] [INFO ] Computed 19 place invariants in 471 ms
[2023-03-18 08:35:04] [INFO ] [Real]Absence check using 19 positive place invariants in 90 ms returned sat
[2023-03-18 08:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:35:24] [INFO ] [Real]Absence check using state equation in 19592 ms returned sat
[2023-03-18 08:35:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:35:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 53 ms returned sat
[2023-03-18 08:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:36:08] [INFO ] [Nat]Absence check using state equation in 18894 ms returned sat
[2023-03-18 08:36:10] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 08:36:17] [INFO ] [Nat]Added 741 Read/Feed constraints in 7547 ms returned sat
[2023-03-18 08:36:27] [INFO ] Deduced a trap composed of 40 places in 8557 ms of which 13 ms to minimize.
[2023-03-18 08:36:36] [INFO ] Deduced a trap composed of 64 places in 7554 ms of which 2 ms to minimize.
[2023-03-18 08:36:46] [INFO ] Deduced a trap composed of 64 places in 9250 ms of which 2 ms to minimize.
[2023-03-18 08:36:56] [INFO ] Deduced a trap composed of 128 places in 8481 ms of which 12 ms to minimize.
[2023-03-18 08:37:06] [INFO ] Deduced a trap composed of 40 places in 8755 ms of which 1 ms to minimize.
[2023-03-18 08:37:17] [INFO ] Deduced a trap composed of 40 places in 10159 ms of which 3 ms to minimize.
[2023-03-18 08:37:28] [INFO ] Deduced a trap composed of 64 places in 10404 ms of which 1 ms to minimize.
[2023-03-18 08:37:40] [INFO ] Deduced a trap composed of 48 places in 10016 ms of which 3 ms to minimize.
[2023-03-18 08:37:50] [INFO ] Deduced a trap composed of 96 places in 9471 ms of which 1 ms to minimize.
[2023-03-18 08:38:00] [INFO ] Deduced a trap composed of 16 places in 8779 ms of which 2 ms to minimize.
[2023-03-18 08:38:10] [INFO ] Deduced a trap composed of 96 places in 8736 ms of which 1 ms to minimize.
[2023-03-18 08:38:20] [INFO ] Deduced a trap composed of 64 places in 9405 ms of which 2 ms to minimize.
[2023-03-18 08:38:30] [INFO ] Deduced a trap composed of 96 places in 8333 ms of which 2 ms to minimize.
[2023-03-18 08:38:39] [INFO ] Deduced a trap composed of 128 places in 8469 ms of which 1 ms to minimize.
[2023-03-18 08:38:48] [INFO ] Deduced a trap composed of 72 places in 7526 ms of which 1 ms to minimize.
[2023-03-18 08:38:57] [INFO ] Deduced a trap composed of 64 places in 8213 ms of which 1 ms to minimize.
[2023-03-18 08:39:06] [INFO ] Deduced a trap composed of 80 places in 7279 ms of which 1 ms to minimize.
[2023-03-18 08:39:13] [INFO ] Deduced a trap composed of 48 places in 6684 ms of which 1 ms to minimize.
[2023-03-18 08:39:22] [INFO ] Deduced a trap composed of 72 places in 7204 ms of which 1 ms to minimize.
[2023-03-18 08:39:30] [INFO ] Deduced a trap composed of 64 places in 6721 ms of which 1 ms to minimize.
[2023-03-18 08:39:37] [INFO ] Deduced a trap composed of 96 places in 6791 ms of which 0 ms to minimize.
[2023-03-18 08:39:46] [INFO ] Deduced a trap composed of 72 places in 7238 ms of which 1 ms to minimize.
[2023-03-18 08:39:55] [INFO ] Deduced a trap composed of 128 places in 8118 ms of which 2 ms to minimize.
[2023-03-18 08:40:03] [INFO ] Deduced a trap composed of 72 places in 6461 ms of which 1 ms to minimize.
[2023-03-18 08:40:12] [INFO ] Deduced a trap composed of 72 places in 7061 ms of which 0 ms to minimize.
[2023-03-18 08:40:19] [INFO ] Deduced a trap composed of 72 places in 6396 ms of which 1 ms to minimize.
[2023-03-18 08:40:27] [INFO ] Deduced a trap composed of 128 places in 6618 ms of which 0 ms to minimize.
[2023-03-18 08:40:27] [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 200168 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 359110 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 197423 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 350622 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 1383 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 08:42:28] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 08:42:28] [INFO ] Invariant cache hit.
[2023-03-18 08:42:37] [INFO ] Implicit Places using invariants in 9174 ms returned []
Implicit Place search using SMT only with invariants took 9178 ms to find 0 implicit places.
[2023-03-18 08:42:37] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 08:42:37] [INFO ] Invariant cache hit.
[2023-03-18 08:43:08] [INFO ] Performed 86214/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 08:43:27] [INFO ] Dead Transitions using invariants and state equation in 49459 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60022 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 320722 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 08:43:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 08:43:57] [INFO ] Invariant cache hit.
[2023-03-18 08:44:22] [INFO ] [Real]Absence check using 19 positive place invariants in 35 ms returned sat
[2023-03-18 08:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:44:42] [INFO ] [Real]Absence check using state equation in 19935 ms returned sat
[2023-03-18 08:44:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:45:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 50 ms returned sat
[2023-03-18 08:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:45:27] [INFO ] [Nat]Absence check using state equation in 19956 ms returned sat
[2023-03-18 08:45:28] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 08:45:34] [INFO ] [Nat]Added 741 Read/Feed constraints in 6784 ms returned sat
[2023-03-18 08:45:46] [INFO ] Deduced a trap composed of 96 places in 10230 ms of which 2 ms to minimize.
[2023-03-18 08:45:57] [INFO ] Deduced a trap composed of 72 places in 10422 ms of which 1 ms to minimize.
[2023-03-18 08:46:09] [INFO ] Deduced a trap composed of 64 places in 10888 ms of which 2 ms to minimize.
[2023-03-18 08:46:21] [INFO ] Deduced a trap composed of 72 places in 10257 ms of which 1 ms to minimize.
[2023-03-18 08:46:32] [INFO ] Deduced a trap composed of 34 places in 10070 ms of which 2 ms to minimize.
[2023-03-18 08:46:42] [INFO ] Deduced a trap composed of 72 places in 8390 ms of which 1 ms to minimize.
[2023-03-18 08:46:52] [INFO ] Deduced a trap composed of 16 places in 9030 ms of which 3 ms to minimize.
[2023-03-18 08:47:02] [INFO ] Deduced a trap composed of 72 places in 9219 ms of which 1 ms to minimize.
[2023-03-18 08:47:14] [INFO ] Deduced a trap composed of 48 places in 10234 ms of which 1 ms to minimize.
[2023-03-18 08:47:24] [INFO ] Deduced a trap composed of 80 places in 9001 ms of which 5 ms to minimize.
[2023-03-18 08:47:35] [INFO ] Deduced a trap composed of 72 places in 10165 ms of which 1 ms to minimize.
[2023-03-18 08:47:43] [INFO ] Deduced a trap composed of 40 places in 6718 ms of which 1 ms to minimize.
[2023-03-18 08:47:54] [INFO ] Deduced a trap composed of 64 places in 9708 ms of which 3 ms to minimize.
[2023-03-18 08:48:04] [INFO ] Deduced a trap composed of 64 places in 8850 ms of which 2 ms to minimize.
[2023-03-18 08:48:13] [INFO ] Deduced a trap composed of 64 places in 8374 ms of which 1 ms to minimize.
[2023-03-18 08:48:22] [INFO ] Deduced a trap composed of 128 places in 7764 ms of which 1 ms to minimize.
[2023-03-18 08:48:33] [INFO ] Deduced a trap composed of 64 places in 9872 ms of which 1 ms to minimize.
[2023-03-18 08:48:44] [INFO ] Deduced a trap composed of 96 places in 9015 ms of which 1 ms to minimize.
[2023-03-18 08:48:53] [INFO ] Deduced a trap composed of 128 places in 8308 ms of which 1 ms to minimize.
[2023-03-18 08:49:02] [INFO ] Deduced a trap composed of 40 places in 7662 ms of which 1 ms to minimize.
[2023-03-18 08:49:10] [INFO ] Deduced a trap composed of 128 places in 6937 ms of which 0 ms to minimize.
[2023-03-18 08:49:19] [INFO ] Deduced a trap composed of 96 places in 6780 ms of which 1 ms to minimize.
[2023-03-18 08:49:26] [INFO ] Deduced a trap composed of 128 places in 6588 ms of which 0 ms to minimize.
[2023-03-18 08:49:34] [INFO ] Deduced a trap composed of 40 places in 6588 ms of which 1 ms to minimize.
[2023-03-18 08:49:42] [INFO ] Deduced a trap composed of 96 places in 6377 ms of which 5 ms to minimize.
[2023-03-18 08:49:49] [INFO ] Deduced a trap composed of 64 places in 6376 ms of which 1 ms to minimize.
[2023-03-18 08:49:49] [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 185056 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=6 )
Interrupted Random walk after 326941 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random directed walk after 186892 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 332193 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 08:51:55] [INFO ] Flatten gal took : 4067 ms
[2023-03-18 08:51:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2023-03-18 08:51:55] [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 1073231 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//ReachabilityDeadlock.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS17pb115_PT_2
(NrP: 1399 NrTr: 144369 NrArc: 577414)

parse formulas
formulas created successfully
place and transition orderings generation:0m53.026sec

net check time: 0m 0.161sec

init dd package: 0m 2.671sec

TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 10113024 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15947368 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 2m22.143sec

1399 2751 3547 3547 5058 5178 5428 5434 8361 9309 9309 13476

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-2"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is RERS17pb115-PT-2, 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 r344-tall-167889215900096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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