About the Execution of 2020-gold for Diffusion2D-PT-D40N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
374.392 | 3600000.00 | 89341.00 | 2408.10 | FFTFTFFFTTTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902300091.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Diffusion2D-PT-D40N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902300091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.7M May 5 16:51 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 Diffusion2D-PT-D40N050-ReachabilityCardinality-00
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-01
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-02
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-03
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-04
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-05
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-06
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-07
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-08
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-09
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D40N050-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620730653070
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 10:57:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-11 10:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 10:57:36] [INFO ] Load time of PNML (sax parser for PT used): 2165 ms
[2021-05-11 10:57:36] [INFO ] Transformed 1600 places.
[2021-05-11 10:57:36] [INFO ] Transformed 12324 transitions.
[2021-05-11 10:57:36] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 2251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 112 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10013 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-11 10:57:37] [INFO ] Computed 1 place invariants in 137 ms
[2021-05-11 10:57:37] [INFO ] [Real]Absence check using 1 positive place invariants in 31 ms returned sat
[2021-05-11 10:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:57:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:57:42] [INFO ] [Real]Absence check using state equation in 4759 ms returned (error "Failed to check-sat")
[2021-05-11 10:57:42] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 10:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:57:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:57:47] [INFO ] [Real]Absence check using state equation in 4887 ms returned (error "Failed to check-sat")
[2021-05-11 10:57:47] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:57:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:57:52] [INFO ] [Real]Absence check using state equation in 4857 ms returned (error "Failed to check-sat")
[2021-05-11 10:57:52] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:57:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:57:57] [INFO ] [Real]Absence check using state equation in 4824 ms returned (error "Failed to check-sat")
[2021-05-11 10:57:57] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:02] [INFO ] [Real]Absence check using state equation in 4843 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:02] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:07] [INFO ] [Real]Absence check using state equation in 4830 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:07] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:12] [INFO ] [Real]Absence check using state equation in 4829 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:12] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:17] [INFO ] [Real]Absence check using state equation in 4829 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:17] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:22] [INFO ] [Real]Absence check using state equation in 4829 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:22] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 10:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:27] [INFO ] [Real]Absence check using state equation in 4855 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:27] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2021-05-11 10:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:32] [INFO ] [Real]Absence check using state equation in 4841 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:32] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:37] [INFO ] [Real]Absence check using state equation in 4844 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:37] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:42] [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 (= s466 (- (+ t3030 t3037 t3044 t3537 t3552 t3849 t3856 t3863) (+ t3541 t3542 t3543 t3544 t3545 t3546 t3547 t3548)))") while checking expression at index 12
[2021-05-11 10:58:42] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 10:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:47] [INFO ] [Real]Absence check using state equation in 4828 ms returned (error "Failed to check-sat")
[2021-05-11 10:58:47] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 10:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:58:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 10:58:52] [INFO ] [Real]Absence check using state equation in 4856 ms returned unknown
Support contains 59 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 11418 edges and 1600 vertex of which 1541 / 1600 are part of one of the 1 SCC in 54 ms
Free SCC test removed 1540 places
Drop transitions removed 11418 transitions
Ensure Unique test removed 780 transitions
Reduce isomorphic transitions removed 12198 transitions.
Iterating post reduction 0 with 12198 rules applied. Total rules applied 12199 place count 60 transition count 126
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 12211 place count 60 transition count 114
Applied a total of 12211 rules in 189 ms. Remains 60 /1600 variables (removed 1540) and now considering 114/12324 (removed 12210) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/1600 places, 114/12324 transitions.
Incomplete random walk after 1000031 steps, including 0 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 323449 steps, including 0 resets, run visited all 3 properties in 247 ms. (steps per millisecond=1309 )
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D40N050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
--------------------
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="Diffusion2D-PT-D40N050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool gold2020"
echo " Input is Diffusion2D-PT-D40N050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-tall-162048902300091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D40N050.tgz
mv Diffusion2D-PT-D40N050 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;