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.r182-oct2-158987914000514.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 itslola
Input is BusinessProcesses-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 104K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-00
FORMULA_NAME BusinessProcesses-PT-09-01
FORMULA_NAME BusinessProcesses-PT-09-02
FORMULA_NAME BusinessProcesses-PT-09-03
FORMULA_NAME BusinessProcesses-PT-09-04
FORMULA_NAME BusinessProcesses-PT-09-05
FORMULA_NAME BusinessProcesses-PT-09-06
FORMULA_NAME BusinessProcesses-PT-09-07
FORMULA_NAME BusinessProcesses-PT-09-08
FORMULA_NAME BusinessProcesses-PT-09-09
FORMULA_NAME BusinessProcesses-PT-09-10
FORMULA_NAME BusinessProcesses-PT-09-11
FORMULA_NAME BusinessProcesses-PT-09-12
FORMULA_NAME BusinessProcesses-PT-09-13
FORMULA_NAME BusinessProcesses-PT-09-14
FORMULA_NAME BusinessProcesses-PT-09-15

=== Now, execution of the tool begins

BK_START 1591160285554

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:58:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:58:07] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-06-03 04:58:07] [INFO ] Transformed 403 places.
[2020-06-03 04:58:07] [INFO ] Transformed 374 transitions.
[2020-06-03 04:58:07] [INFO ] Found NUPN structural information;
[2020-06-03 04:58:07] [INFO ] Parsed PT model containing 403 places and 374 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1041 resets, run finished after 359 ms. (steps per millisecond=278 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 374 rows 403 cols
[2020-06-03 04:58:07] [INFO ] Computed 65 place invariants in 28 ms
[2020-06-03 04:58:08] [INFO ] [Real]Absence check using 36 positive place invariants in 48 ms returned sat
[2020-06-03 04:58:08] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 19 ms returned sat
[2020-06-03 04:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:08] [INFO ] [Real]Absence check using state equation in 519 ms returned unsat
[2020-06-03 04:58:08] [INFO ] [Real]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-06-03 04:58:08] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-06-03 04:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:09] [INFO ] [Real]Absence check using state equation in 310 ms returned unsat
[2020-06-03 04:58:09] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2020-06-03 04:58:09] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 112 ms returned sat
[2020-06-03 04:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:09] [INFO ] [Real]Absence check using state equation in 327 ms returned unsat
[2020-06-03 04:58:10] [INFO ] [Real]Absence check using 36 positive place invariants in 60 ms returned sat
[2020-06-03 04:58:10] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 22 ms returned sat
[2020-06-03 04:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:10] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2020-06-03 04:58:10] [INFO ] Deduced a trap composed of 119 places in 210 ms
[2020-06-03 04:58:11] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-06-03 04:58:11] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-06-03 04:58:11] [INFO ] Deduced a trap composed of 15 places in 129 ms
[2020-06-03 04:58:11] [INFO ] Deduced a trap composed of 16 places in 101 ms
[2020-06-03 04:58:11] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2020-06-03 04:58:12] [INFO ] Deduced a trap composed of 20 places in 511 ms
[2020-06-03 04:58:12] [INFO ] Deduced a trap composed of 27 places in 48 ms
[2020-06-03 04:58:12] [INFO ] Deduced a trap composed of 15 places in 33 ms
[2020-06-03 04:58:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1690 ms
[2020-06-03 04:58:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:58:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 268 ms returned sat
[2020-06-03 04:58:12] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 265 ms returned sat
[2020-06-03 04:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:15] [INFO ] [Nat]Absence check using state equation in 2373 ms returned sat
[2020-06-03 04:58:17] [INFO ] Deduced a trap composed of 20 places in 1916 ms
[2020-06-03 04:58:17] [INFO ] Deduced a trap composed of 15 places in 250 ms
[2020-06-03 04:58:17] [INFO ] Deduced a trap composed of 17 places in 145 ms
[2020-06-03 04:58:17] [INFO ] Deduced a trap composed of 35 places in 167 ms
[2020-06-03 04:58:20] [INFO ] Deduced a trap composed of 19 places in 2212 ms
[2020-06-03 04:58:23] [INFO ] Deduced a trap composed of 11 places in 3244 ms
[2020-06-03 04:58:26] [INFO ] Deduced a trap composed of 110 places in 3022 ms
[2020-06-03 04:58:26] [INFO ] Deduced a trap composed of 19 places in 110 ms
[2020-06-03 04:58:26] [INFO ] Deduced a trap composed of 105 places in 146 ms
[2020-06-03 04:58:27] [INFO ] Deduced a trap composed of 103 places in 203 ms
[2020-06-03 04:58:27] [INFO ] Deduced a trap composed of 27 places in 236 ms
[2020-06-03 04:58:27] [INFO ] Deduced a trap composed of 110 places in 243 ms
[2020-06-03 04:58:27] [INFO ] Deduced a trap composed of 107 places in 201 ms
[2020-06-03 04:58:27] [INFO ] Deduced a trap composed of 115 places in 221 ms
[2020-06-03 04:58:28] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2020-06-03 04:58:28] [INFO ] Deduced a trap composed of 43 places in 127 ms
[2020-06-03 04:58:28] [INFO ] Deduced a trap composed of 46 places in 139 ms
[2020-06-03 04:58:28] [INFO ] Deduced a trap composed of 45 places in 119 ms
[2020-06-03 04:58:28] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13354 ms
[2020-06-03 04:58:28] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 30 ms.
[2020-06-03 04:58:30] [INFO ] Added : 245 causal constraints over 49 iterations in 1448 ms. Result :sat
[2020-06-03 04:58:30] [INFO ] Deduced a trap composed of 113 places in 119 ms
[2020-06-03 04:58:30] [INFO ] Deduced a trap composed of 110 places in 470 ms
[2020-06-03 04:58:31] [INFO ] Deduced a trap composed of 111 places in 339 ms
[2020-06-03 04:58:31] [INFO ] Deduced a trap composed of 109 places in 214 ms
[2020-06-03 04:58:31] [INFO ] Deduced a trap composed of 120 places in 112 ms
[2020-06-03 04:58:31] [INFO ] Deduced a trap composed of 115 places in 118 ms
[2020-06-03 04:58:31] [INFO ] Deduced a trap composed of 95 places in 94 ms
[2020-06-03 04:58:32] [INFO ] Deduced a trap composed of 103 places in 115 ms
[2020-06-03 04:58:32] [INFO ] Deduced a trap composed of 111 places in 124 ms
[2020-06-03 04:58:32] [INFO ] Deduced a trap composed of 104 places in 127 ms
[2020-06-03 04:58:32] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s20 s21 s22 s28 s29 s48 s49 s53 s82 s108 s126 s153 s154 s155 s159 s160 s161 s194 s198 s200 s204 s214 s219 s234 s239 s244 s249 s269 s274 s278 s279 s280 s281 s282 s283 s284 s287 s288 s289 s290 s291 s292 s293 s294 s306 s307 s308 s309 s310 s311 s312 s317 s318 s319 s320 s321 s322 s323 s324 s328 s329 s330 s333 s334 s335 s336 s337 s338 s339 s340 s341 s344 s345 s346 s347 s348 s349 s352 s353 s356 s357 s358 s359 s368 s373 s374 s375 s379 s380 s381 s391 s400 s401 s402) 0)") while checking expression at index 3
[2020-06-03 04:58:32] [INFO ] [Real]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 04:58:32] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2020-06-03 04:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:32] [INFO ] [Real]Absence check using state equation in 349 ms returned unsat
[2020-06-03 04:58:32] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2020-06-03 04:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using state equation in 331 ms returned unsat
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-06-03 04:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using state equation in 267 ms returned unsat
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 04:58:33] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 24 ms returned sat
[2020-06-03 04:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:34] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2020-06-03 04:58:34] [INFO ] Deduced a trap composed of 8 places in 220 ms
[2020-06-03 04:58:34] [INFO ] Deduced a trap composed of 11 places in 163 ms
[2020-06-03 04:58:34] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2020-06-03 04:58:34] [INFO ] Deduced a trap composed of 14 places in 126 ms
[2020-06-03 04:58:35] [INFO ] Deduced a trap composed of 28 places in 114 ms
[2020-06-03 04:58:35] [INFO ] Deduced a trap composed of 88 places in 205 ms
[2020-06-03 04:58:35] [INFO ] Deduced a trap composed of 35 places in 230 ms
[2020-06-03 04:58:35] [INFO ] Deduced a trap composed of 70 places in 112 ms
[2020-06-03 04:58:35] [INFO ] Deduced a trap composed of 79 places in 271 ms
[2020-06-03 04:58:36] [INFO ] Deduced a trap composed of 89 places in 199 ms
[2020-06-03 04:58:36] [INFO ] Deduced a trap composed of 74 places in 116 ms
[2020-06-03 04:58:36] [INFO ] Deduced a trap composed of 65 places in 142 ms
[2020-06-03 04:58:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 2264 ms
[2020-06-03 04:58:36] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2020-06-03 04:58:36] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-06-03 04:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:58:36] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2020-06-03 04:58:37] [INFO ] Deduced a trap composed of 8 places in 537 ms
[2020-06-03 04:58:37] [INFO ] Deduced a trap composed of 11 places in 352 ms
[2020-06-03 04:58:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 934 ms
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2020-06-03 04:58:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 04:58:38] [INFO ] Flatten gal took : 108 ms
FORMULA BusinessProcesses-PT-09-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:58:38] [INFO ] Applying decomposition
[2020-06-03 04:58:38] [INFO ] Flatten gal took : 39 ms
[2020-06-03 04:58:38] [INFO ] Decomposing Gal with order
[2020-06-03 04:58:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 04:58:38] [INFO ] Removed a total of 117 redundant transitions.
[2020-06-03 04:58:38] [INFO ] Flatten gal took : 111 ms
[2020-06-03 04:58:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 87 ms.
[2020-06-03 04:58:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 28 ms.
[2020-06-03 04:58:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-09 @ 3570 seconds

FORMULA BusinessProcesses-PT-09-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 153252 kB
After kill :
MemTotal: 16427332 kB
MemFree: 14599948 kB

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

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="BusinessProcesses-PT-09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 itslola"
echo " Input is BusinessProcesses-PT-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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