Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692800637.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANConstruction-PT-030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:22 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 CANConstruction-PT-030-UpperBounds-00
FORMULA_NAME CANConstruction-PT-030-UpperBounds-01
FORMULA_NAME CANConstruction-PT-030-UpperBounds-02
FORMULA_NAME CANConstruction-PT-030-UpperBounds-03
FORMULA_NAME CANConstruction-PT-030-UpperBounds-04
FORMULA_NAME CANConstruction-PT-030-UpperBounds-05
FORMULA_NAME CANConstruction-PT-030-UpperBounds-06
FORMULA_NAME CANConstruction-PT-030-UpperBounds-07
FORMULA_NAME CANConstruction-PT-030-UpperBounds-08
FORMULA_NAME CANConstruction-PT-030-UpperBounds-09
FORMULA_NAME CANConstruction-PT-030-UpperBounds-10
FORMULA_NAME CANConstruction-PT-030-UpperBounds-11
FORMULA_NAME CANConstruction-PT-030-UpperBounds-12
FORMULA_NAME CANConstruction-PT-030-UpperBounds-13
FORMULA_NAME CANConstruction-PT-030-UpperBounds-14
FORMULA_NAME CANConstruction-PT-030-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678504102905

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 03:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:08:25] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-11 03:08:25] [INFO ] Transformed 2162 places.
[2023-03-11 03:08:25] [INFO ] Transformed 3840 transitions.
[2023-03-11 03:08:25] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3840 rows 2162 cols
[2023-03-11 03:08:25] [INFO ] Computed 61 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 18 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :11
FORMULA CANConstruction-PT-030-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
[2023-03-11 03:08:25] [INFO ] Invariant cache hit.
[2023-03-11 03:08:25] [INFO ] [Real]Absence check using 31 positive place invariants in 72 ms returned sat
[2023-03-11 03:08:25] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-11 03:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:26] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-11 03:08:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:08:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 97 ms returned sat
[2023-03-11 03:08:27] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 65 ms returned sat
[2023-03-11 03:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:29] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2023-03-11 03:08:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:29] [INFO ] [Nat]Added 1770 Read/Feed constraints in 150 ms returned sat
[2023-03-11 03:08:29] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 365 ms.
[2023-03-11 03:08:30] [INFO ] Added : 8 causal constraints over 2 iterations in 1194 ms. Result :sat
[2023-03-11 03:08:31] [INFO ] [Real]Absence check using 31 positive place invariants in 49 ms returned sat
[2023-03-11 03:08:31] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-11 03:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:33] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2023-03-11 03:08:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:08:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2023-03-11 03:08:33] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-11 03:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:34] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2023-03-11 03:08:34] [INFO ] [Nat]Added 1770 Read/Feed constraints in 145 ms returned sat
[2023-03-11 03:08:35] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 274 ms.
[2023-03-11 03:08:36] [INFO ] Added : 11 causal constraints over 3 iterations in 1016 ms. Result :sat
[2023-03-11 03:08:36] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2023-03-11 03:08:36] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 13 ms returned sat
[2023-03-11 03:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:37] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2023-03-11 03:08:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:08:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 42 ms returned sat
[2023-03-11 03:08:38] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-11 03:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:39] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2023-03-11 03:08:39] [INFO ] [Nat]Added 1770 Read/Feed constraints in 192 ms returned sat
[2023-03-11 03:08:39] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 303 ms.
[2023-03-11 03:08:41] [INFO ] Added : 11 causal constraints over 3 iterations in 1340 ms. Result :sat
[2023-03-11 03:08:41] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2023-03-11 03:08:41] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-11 03:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:42] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2023-03-11 03:08:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:08:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2023-03-11 03:08:43] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-11 03:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:44] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2023-03-11 03:08:44] [INFO ] [Nat]Added 1770 Read/Feed constraints in 165 ms returned sat
[2023-03-11 03:08:44] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 253 ms.
[2023-03-11 03:08:45] [INFO ] Added : 11 causal constraints over 3 iterations in 1244 ms. Result :sat
[2023-03-11 03:08:46] [INFO ] [Real]Absence check using 31 positive place invariants in 77 ms returned sat
[2023-03-11 03:08:46] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 20 ms returned sat
[2023-03-11 03:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:47] [INFO ] [Real]Absence check using state equation in 1228 ms returned sat
[2023-03-11 03:08:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:08:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2023-03-11 03:08:48] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-11 03:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:08:49] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2023-03-11 03:08:49] [INFO ] [Nat]Added 1770 Read/Feed constraints in 209 ms returned sat
[2023-03-11 03:08:50] [INFO ] Computed and/alt/rep : 3720/7230/3720 causal constraints (skipped 90 transitions) in 289 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-11 03:08:54] [INFO ] Deduced a trap composed of 5 places in 1396 ms of which 6 ms to minimize.
[2023-03-11 03:08:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA CANConstruction-PT-030-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-030-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-030-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-030-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2162 transition count 3630
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1952 transition count 3630
Discarding 840 places :
Symmetric choice reduction at 2 with 840 rule applications. Total rules 1260 place count 1112 transition count 1950
Iterating global reduction 2 with 840 rules applied. Total rules applied 2100 place count 1112 transition count 1950
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 2160 place count 1082 transition count 1920
Free-agglomeration rule applied 60 times.
Iterating global reduction 2 with 60 rules applied. Total rules applied 2220 place count 1082 transition count 1860
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 2280 place count 1022 transition count 1860
Applied a total of 2280 rules in 821 ms. Remains 1022 /2162 variables (removed 1140) and now considering 1860/3840 (removed 1980) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 822 ms. Remains : 1022/2162 places, 1860/3840 transitions.
// Phase 1: matrix 1860 rows 1022 cols
[2023-03-11 03:08:55] [INFO ] Computed 61 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 4873 resets, run finished after 6445 ms. (steps per millisecond=155 ) properties (out of 1) seen :1
FORMULA CANConstruction-PT-030-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36982 ms.
ITS solved all properties within timeout

BK_STOP 1678504142029

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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-030"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is CANConstruction-PT-030, 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 r039-tajo-167813692800637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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