Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900321.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716650770608

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:26:13] [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-25 15:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:26:13] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-25 15:26:13] [INFO ] Transformed 403 places.
[2024-05-25 15:26:13] [INFO ] Transformed 374 transitions.
[2024-05-25 15:26:13] [INFO ] Found NUPN structural information;
[2024-05-25 15:26:13] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 374 rows 403 cols
[2024-05-25 15:26:14] [INFO ] Computed 65 invariants in 28 ms
Incomplete random walk after 10000 steps, including 102 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
FORMULA BusinessProcesses-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
[2024-05-25 15:26:14] [INFO ] Invariant cache hit.
[2024-05-25 15:26:14] [INFO ] [Real]Absence check using 36 positive place invariants in 76 ms returned sat
[2024-05-25 15:26:14] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-25 15:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:26:14] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-25 15:26:15] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 8 ms to minimize.
[2024-05-25 15:26:15] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:26:15] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:26:16] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:26:16] [INFO ] Deduced a trap composed of 112 places in 217 ms of which 1 ms to minimize.
[2024-05-25 15:26:16] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2024-05-25 15:26:16] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:26:16] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:26:16] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:26:17] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-25 15:26:17] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:26:17] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 1 ms to minimize.
[2024-05-25 15:26:17] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:26:17] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 1 ms to minimize.
[2024-05-25 15:26:18] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:26:18] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:26:18] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:26:18] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:26:18] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:26:18] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:26:19] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:26:19] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:26:19] [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 0
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 15:26:19] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2024-05-25 15:26:19] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-25 15:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:26:19] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-25 15:26:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:26:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2024-05-25 15:26:19] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-25 15:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:26:20] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:26:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 890 ms
[2024-05-25 15:26:20] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 34 ms.
[2024-05-25 15:26:22] [INFO ] Added : 246 causal constraints over 50 iterations in 1657 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 224 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 395 transition count 281
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 311 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 310 transition count 280
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 172 place count 310 transition count 218
Deduced a syphon composed of 62 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 306 place count 238 transition count 218
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 352 place count 192 transition count 172
Iterating global reduction 3 with 46 rules applied. Total rules applied 398 place count 192 transition count 172
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 398 place count 192 transition count 167
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 408 place count 187 transition count 167
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 532 place count 124 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 534 place count 123 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 536 place count 123 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 538 place count 121 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 121 transition count 107
Applied a total of 539 rules in 229 ms. Remains 121 /403 variables (removed 282) and now considering 107/374 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 121/403 places, 107/374 transitions.
// Phase 1: matrix 107 rows 121 cols
[2024-05-25 15:26:23] [INFO ] Computed 52 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 64077 resets, run finished after 2327 ms. (steps per millisecond=429 ) properties (out of 2) seen :2
FORMULA BusinessProcesses-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11774 ms.

BK_STOP 1716650785694

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="BusinessProcesses-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is BusinessProcesses-PT-09, 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 r065-tajo-171620414900321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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