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.r334-tall-171679080800653.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 itstools
Input is ServersAndClients-PT-200040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080800653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716862857159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 02:20:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:20:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:20:58] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2024-05-28 02:20:58] [INFO ] Transformed 8841 places.
[2024-05-28 02:20:58] [INFO ] Transformed 16400 transitions.
[2024-05-28 02:20:58] [INFO ] Found NUPN structural information;
[2024-05-28 02:20:58] [INFO ] Parsed PT model containing 8841 places and 16400 transitions and 49600 arcs in 627 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16400 rows 8841 cols
[2024-05-28 02:20:59] [INFO ] Computed 441 invariants in 405 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 540 ms. (18 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 404 ms. (222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-28 02:21:00] [INFO ] Invariant cache hit.
[2024-05-28 02:21:02] [INFO ] [Real]Absence check using 241 positive place invariants in 778 ms returned sat
[2024-05-28 02:21:03] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 177 ms returned sat
[2024-05-28 02:21:05] [INFO ] [Real]Absence check using state equation in 2571 ms returned unknown
[2024-05-28 02:21:07] [INFO ] [Real]Absence check using 241 positive place invariants in 654 ms returned sat
[2024-05-28 02:21:07] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 141 ms returned sat
[2024-05-28 02:21:10] [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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 02:21:12] [INFO ] [Real]Absence check using 241 positive place invariants in 685 ms returned sat
[2024-05-28 02:21:12] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 135 ms returned sat
[2024-05-28 02:21:15] [INFO ] [Real]Absence check using state equation in 2801 ms returned unknown
[2024-05-28 02:21:17] [INFO ] [Real]Absence check using 241 positive place invariants in 694 ms returned sat
[2024-05-28 02:21:17] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 145 ms returned sat
[2024-05-28 02:21:20] [INFO ] [Real]Absence check using state equation in 2791 ms returned unknown
[2024-05-28 02:21:22] [INFO ] [Real]Absence check using 241 positive place invariants in 636 ms returned sat
[2024-05-28 02:21:22] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 143 ms returned sat
[2024-05-28 02:21:25] [INFO ] [Real]Absence check using state equation in 2983 ms returned unknown
[2024-05-28 02:21:27] [INFO ] [Real]Absence check using 241 positive place invariants in 674 ms returned sat
[2024-05-28 02:21:27] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 135 ms returned sat
[2024-05-28 02:21:30] [INFO ] [Real]Absence check using state equation in 2917 ms returned unknown
[2024-05-28 02:21:32] [INFO ] [Real]Absence check using 241 positive place invariants in 581 ms returned sat
[2024-05-28 02:21:32] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 136 ms returned sat
[2024-05-28 02:21:35] [INFO ] [Real]Absence check using state equation in 2987 ms returned unknown
[2024-05-28 02:21:37] [INFO ] [Real]Absence check using 241 positive place invariants in 647 ms returned sat
[2024-05-28 02:21:37] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 140 ms returned sat
[2024-05-28 02:21:40] [INFO ] [Real]Absence check using state equation in 2844 ms returned unknown
[2024-05-28 02:21:42] [INFO ] [Real]Absence check using 241 positive place invariants in 626 ms returned sat
[2024-05-28 02:21:42] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 144 ms returned sat
[2024-05-28 02:21:45] [INFO ] [Real]Absence check using state equation in 2876 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7991 transitions
Trivial Post-agglo rules discarded 7991 transitions
Performed 7991 trivial Post agglomeration. Transition count delta: 7991
Iterating post reduction 0 with 7991 rules applied. Total rules applied 7991 place count 8841 transition count 8409
Reduce places removed 8022 places and 0 transitions.
Ensure Unique test removed 6000 transitions
Reduce isomorphic transitions removed 6000 transitions.
Iterating post reduction 1 with 14022 rules applied. Total rules applied 22013 place count 819 transition count 2409
Drop transitions (Redundant composition of simpler transitions.) removed 1791 transitions
Redundant transition composition rules discarded 1791 transitions
Iterating global reduction 2 with 1791 rules applied. Total rules applied 23804 place count 819 transition count 618
Discarding 191 places :
Implicit places reduction removed 191 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 2 with 573 rules applied. Total rules applied 24377 place count 628 transition count 236
Reduce places removed 573 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 3 with 764 rules applied. Total rules applied 25141 place count 55 transition count 45
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 25150 place count 55 transition count 45
Applied a total of 25150 rules in 337 ms. Remains 55 /8841 variables (removed 8786) and now considering 45/16400 (removed 16355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 55/8841 places, 45/16400 transitions.
// Phase 1: matrix 45 rows 55 cols
[2024-05-28 02:21:46] [INFO ] Computed 28 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1137 ms. (878 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 487 ms. (2049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 02:21:48] [INFO ] Flatten gal took : 33 ms
[2024-05-28 02:21:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 02:21:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3543748039470471128.gal : 6 ms
[2024-05-28 02:21:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4085770335476886488.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3543748039470471128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4085770335476886488.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 49825 ms.

BK_STOP 1716862908161

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ServersAndClients-PT-200040"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-200040, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080800653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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