Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649587400102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HirschbergSinclair-PT-30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 03:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 357K May 18 16:42 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 HirschbergSinclair-PT-30-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717246658370

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:57:40] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-06-01 12:57:40] [INFO ] Transformed 670 places.
[2024-06-01 12:57:40] [INFO ] Transformed 605 transitions.
[2024-06-01 12:57:40] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 105 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 2077 ms. (19 steps per ms) remains 4/16 properties
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
// Phase 1: matrix 605 rows 670 cols
[2024-06-01 12:57:42] [INFO ] Computed 65 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-09 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 491/581 variables, 49/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/613 variables, 11/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/644 variables, 5/65 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 605/1249 variables, 644/709 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1249 variables, 0/709 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/1275 variables, 26/735 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1275 variables, 0/735 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1275 variables, 0/735 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1275/1275 variables, and 735 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1821 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 670/670 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 502/579 variables, 49/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 12:57:44] [INFO ] Deduced a trap composed of 60 places in 301 ms of which 51 ms to minimize.
[2024-06-01 12:57:44] [INFO ] Deduced a trap composed of 120 places in 248 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 2/51 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 12:57:45] [INFO ] Deduced a trap composed of 114 places in 212 ms of which 5 ms to minimize.
[2024-06-01 12:57:45] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 9 ms to minimize.
[2024-06-01 12:57:45] [INFO ] Deduced a trap composed of 221 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/611 variables, 11/65 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 12:57:45] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 5 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 2/67 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/611 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 31/642 variables, 5/72 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 1/73 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 0/73 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/1247 variables, 642/715 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1247 variables, 1/716 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1247 variables, 0/716 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 28/1275 variables, 28/744 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1275 variables, 1/745 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1275 variables, 1/746 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1275 variables, 0/746 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1275 variables, 0/746 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 746 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3847 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 670/670 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 5833ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 41 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 629 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.6 ms
Discarding 41 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 629 transition count 374
Reduce places removed 219 places and 0 transitions.
Graph (complete) has 677 edges and 410 vertex of which 344 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.1 ms
Discarding 66 places :
Also discarding 0 output transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 234 rules applied. Total rules applied 466 place count 344 transition count 360
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 546 place count 330 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 549 place count 327 transition count 291
Iterating global reduction 3 with 3 rules applied. Total rules applied 552 place count 327 transition count 291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 554 place count 325 transition count 289
Iterating global reduction 3 with 2 rules applied. Total rules applied 556 place count 325 transition count 289
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 582 place count 325 transition count 263
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 608 place count 299 transition count 263
Reduce places removed 24 places and 24 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 632 place count 275 transition count 239
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 9 rules applied. Total rules applied 641 place count 270 transition count 235
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 645 place count 266 transition count 235
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 645 place count 266 transition count 214
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 687 place count 245 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 689 place count 244 transition count 213
Applied a total of 689 rules in 265 ms. Remains 244 /670 variables (removed 426) and now considering 213/605 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 244/670 places, 213/605 transitions.
RANDOM walk for 40000 steps (184 resets) in 608 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 6155 steps (4 resets) in 34 ms. (175 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 8344 ms.
ITS solved all properties within timeout

BK_STOP 1717246668519

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="HirschbergSinclair-PT-30"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-30, 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 r500-smll-171649587400102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-30.tgz
mv HirschbergSinclair-PT-30 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;