Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700343.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 itstools
Input is Parking-PT-864, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 30 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 30 07:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 30 07:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 427K May 10 09:34 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 Parking-PT-864-ReachabilityFireability-00
FORMULA_NAME Parking-PT-864-ReachabilityFireability-01
FORMULA_NAME Parking-PT-864-ReachabilityFireability-02
FORMULA_NAME Parking-PT-864-ReachabilityFireability-03
FORMULA_NAME Parking-PT-864-ReachabilityFireability-04
FORMULA_NAME Parking-PT-864-ReachabilityFireability-05
FORMULA_NAME Parking-PT-864-ReachabilityFireability-06
FORMULA_NAME Parking-PT-864-ReachabilityFireability-07
FORMULA_NAME Parking-PT-864-ReachabilityFireability-08
FORMULA_NAME Parking-PT-864-ReachabilityFireability-09
FORMULA_NAME Parking-PT-864-ReachabilityFireability-10
FORMULA_NAME Parking-PT-864-ReachabilityFireability-11
FORMULA_NAME Parking-PT-864-ReachabilityFireability-12
FORMULA_NAME Parking-PT-864-ReachabilityFireability-13
FORMULA_NAME Parking-PT-864-ReachabilityFireability-14
FORMULA_NAME Parking-PT-864-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654250131471

Running Version 202205111006
[2022-06-03 09:55:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 09:55:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 09:55:34] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2022-06-03 09:55:34] [INFO ] Transformed 1185 places.
[2022-06-03 09:55:34] [INFO ] Transformed 1697 transitions.
[2022-06-03 09:55:34] [INFO ] Found NUPN structural information;
[2022-06-03 09:55:34] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 707 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 1341 ms. (steps per millisecond=7 ) properties (out of 16) seen :3
FORMULA Parking-PT-864-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1009 rows 1185 cols
[2022-06-03 09:55:37] [INFO ] Computed 280 place invariants in 77 ms
[2022-06-03 09:55:38] [INFO ] After 1137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-03 09:55:39] [INFO ] [Nat]Absence check using 272 positive place invariants in 139 ms returned sat
[2022-06-03 09:55:39] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 25 ms returned sat
[2022-06-03 09:55:44] [INFO ] After 3804ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-06-03 09:55:44] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-06-03 09:55:49] [INFO ] After 5283ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2022-06-03 09:55:51] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 10 ms to minimize.
[2022-06-03 09:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2022-06-03 09:55:52] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 1 ms to minimize.
[2022-06-03 09:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2022-06-03 09:55:54] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2022-06-03 09:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2022-06-03 09:55:56] [INFO ] After 11819ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 4396 ms.
[2022-06-03 09:56:00] [INFO ] After 21937ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA Parking-PT-864-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 12 different solutions.
FORMULA Parking-PT-864-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 9 properties in 15745 ms.
Support contains 80 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1185 transition count 990
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 1166 transition count 987
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 1163 transition count 987
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 44 place count 1163 transition count 968
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 82 place count 1144 transition count 968
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 89 place count 1137 transition count 961
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 1137 transition count 961
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 154 place count 1108 transition count 932
Free-agglomeration rule applied 166 times.
Iterating global reduction 3 with 166 rules applied. Total rules applied 320 place count 1108 transition count 766
Reduce places removed 166 places and 0 transitions.
Iterating post reduction 3 with 166 rules applied. Total rules applied 486 place count 942 transition count 766
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 487 place count 942 transition count 765
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 488 place count 942 transition count 765
Applied a total of 488 rules in 870 ms. Remains 942 /1185 variables (removed 243) and now considering 765/1009 (removed 244) transitions.
Finished structural reductions, in 1 iterations. Remains : 942/1185 places, 765/1009 transitions.
Incomplete random walk after 1000000 steps, including 4747 resets, run finished after 16806 ms. (steps per millisecond=59 ) properties (out of 3) seen :1
FORMULA Parking-PT-864-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 725933 steps, including 263 resets, run timeout after 5001 ms. (steps per millisecond=145 ) properties seen 0
Interrupted Best-First random walk after 668008 steps, including 177 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 1
FORMULA Parking-PT-864-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 765 rows 942 cols
[2022-06-03 09:56:44] [INFO ] Computed 280 place invariants in 14 ms
[2022-06-03 09:56:44] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 09:56:44] [INFO ] [Nat]Absence check using 272 positive place invariants in 79 ms returned sat
[2022-06-03 09:56:44] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-03 09:56:45] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 09:56:45] [INFO ] State equation strengthened by 458 read => feed constraints.
[2022-06-03 09:56:45] [INFO ] After 191ms SMT Verify possible using 458 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 09:56:45] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2022-06-03 09:56:45] [INFO ] After 1505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 70 ms.
Support contains 4 out of 942 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 942/942 places, 765/765 transitions.
Graph (complete) has 2005 edges and 942 vertex of which 727 are kept as prefixes of interest. Removing 215 places using SCC suffix rule.8 ms
Discarding 215 places :
Also discarding 158 output transitions
Drop transitions removed 158 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 727 transition count 574
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 43 place count 718 transition count 574
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 43 place count 718 transition count 561
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 69 place count 705 transition count 561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 704 transition count 560
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 704 transition count 560
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 87 place count 696 transition count 552
Free-agglomeration rule applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 696 transition count 530
Reduce places removed 22 places and 0 transitions.
Graph (complete) has 1394 edges and 674 vertex of which 234 are kept as prefixes of interest. Removing 440 places using SCC suffix rule.1 ms
Discarding 440 places :
Also discarding 336 output transitions
Drop transitions removed 336 transitions
Iterating post reduction 2 with 23 rules applied. Total rules applied 132 place count 234 transition count 194
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 148 place count 234 transition count 178
Applied a total of 148 rules in 145 ms. Remains 234 /942 variables (removed 708) and now considering 178/765 (removed 587) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/942 places, 178/765 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3203 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished Best-First random walk after 234 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=234 )
FORMULA Parking-PT-864-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 75449 ms.

BK_STOP 1654250209331

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Parking-PT-864"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Parking-PT-864, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998700343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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