fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620503600006
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CANConstruction-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
330.008 7558.00 18618.00 84.60 TFFTTFFFFFTFFTTF normal

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.r069-tall-171620503600006.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 greatspnxred
Input is CANConstruction-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716361399189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:03:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:03:20] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-22 07:03:20] [INFO ] Transformed 112 places.
[2024-05-22 07:03:20] [INFO ] Transformed 140 transitions.
[2024-05-22 07:03:20] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (518 resets) in 2194 ms. (18 steps per ms) remains 11/13 properties
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (122 resets) in 320 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (116 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 423 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (134 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (131 resets) in 531 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (125 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (146 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (134 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (141 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (137 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (140 resets) in 151 ms. (263 steps per ms) remains 10/11 properties
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 140 rows 112 cols
[2024-05-22 07:03:22] [INFO ] Computed 11 invariants in 14 ms
[2024-05-22 07:03:22] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-09 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 10/110 variables, 6/8 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 140/251 variables, 111/122 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 45/167 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/252 variables, 1/168 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/168 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/168 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 168 constraints, problems are : Problem set: 4 solved, 6 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-01 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-05 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 13/110 variables, 6/8 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/10 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 12 ms to minimize.
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
Problem CANConstruction-PT-005-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/19 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/20 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-05-22 07:03:23] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/21 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 140/251 variables, 111/132 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 45/177 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 2/179 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/179 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/252 variables, 1/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/252 variables, 0/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 180 constraints, problems are : Problem set: 8 solved, 2 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 10/10 constraints]
After SMT, in 2011ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 71 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 140/140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 139
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 111 transition count 136
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 108 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 107 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 105 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 105 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 105 transition count 131
Applied a total of 15 rules in 33 ms. Remains 105 /112 variables (removed 7) and now considering 131/140 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 105/112 places, 131/140 transitions.
RANDOM walk for 40000 steps (558 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (149 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (139 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Probably explored full state space saw : 76393 states, properties seen :0
Probabilistic random walk after 395553 steps, saw 76393 distinct states, run finished after 1018 ms. (steps per millisecond=388 ) properties seen :0
Explored full state space saw : 76393 states, properties seen :0
Exhaustive walk after 395553 steps, saw 76393 distinct states, run finished after 935 ms. (steps per millisecond=423 ) properties seen :0
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANConstruction-PT-005-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 6263 ms.
ITS solved all properties within timeout

BK_STOP 1716361406747

--------------------
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="CANConstruction-PT-005"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANConstruction-PT-005, 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 r069-tall-171620503600006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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