Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r046-smll-165252115600004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is CloudDeployment-PT-2b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 8.2K Apr 30 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 166K May 10 09:33 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 CloudDeployment-PT-2b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652523373598

Running Version 0
[2022-05-14 10:16:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 10:16:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 10:16:17] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2022-05-14 10:16:17] [INFO ] Transformed 556 places.
[2022-05-14 10:16:17] [INFO ] Transformed 684 transitions.
[2022-05-14 10:16:17] [INFO ] Found NUPN structural information;
[2022-05-14 10:16:17] [INFO ] Parsed PT model containing 556 places and 684 transitions in 326 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 684 rows 556 cols
[2022-05-14 10:16:17] [INFO ] Computed 9 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 145 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :7
FORMULA CloudDeployment-PT-2b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :2
FORMULA CloudDeployment-PT-2b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :2
FORMULA CloudDeployment-PT-2b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 684 rows 556 cols
[2022-05-14 10:16:18] [INFO ] Computed 9 place invariants in 13 ms
[2022-05-14 10:16:18] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 34 ms returned sat
[2022-05-14 10:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:19] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2022-05-14 10:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:16:19] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 24 ms returned sat
[2022-05-14 10:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:20] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2022-05-14 10:16:20] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 85 ms.
[2022-05-14 10:16:24] [INFO ] Added : 275 causal constraints over 55 iterations in 4240 ms. Result :unknown
[2022-05-14 10:16:24] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 26 ms returned sat
[2022-05-14 10:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:25] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2022-05-14 10:16:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:16:25] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 27 ms returned sat
[2022-05-14 10:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:26] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2022-05-14 10:16:26] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 86 ms.
[2022-05-14 10:16:30] [INFO ] Added : 275 causal constraints over 55 iterations in 4256 ms. Result :unknown
[2022-05-14 10:16:30] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 29 ms returned sat
[2022-05-14 10:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:31] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-05-14 10:16:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:16:31] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 26 ms returned sat
[2022-05-14 10:16:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:31] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2022-05-14 10:16:31] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 89 ms.
[2022-05-14 10:16:36] [INFO ] Added : 285 causal constraints over 57 iterations in 4338 ms. Result :unknown
[2022-05-14 10:16:36] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 26 ms returned sat
[2022-05-14 10:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:36] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-05-14 10:16:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:16:36] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 17 ms returned sat
[2022-05-14 10:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:37] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-14 10:16:37] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 84 ms.
[2022-05-14 10:16:41] [INFO ] Added : 305 causal constraints over 61 iterations in 4572 ms. Result :unknown
[2022-05-14 10:16:42] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 27 ms returned sat
[2022-05-14 10:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:42] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-05-14 10:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:16:42] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 27 ms returned sat
[2022-05-14 10:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:16:43] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-05-14 10:16:43] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 75 ms.
[2022-05-14 10:16:47] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 64000 steps, including 977 resets, run finished after 213 ms. (steps per millisecond=300 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 556/556 places, 684/684 transitions.
Graph (trivial) has 562 edges and 556 vertex of which 161 / 556 are part of one of the 15 SCC in 13 ms
Free SCC test removed 146 places
Drop transitions removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (complete) has 929 edges and 410 vertex of which 394 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.7 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 394 transition count 274
Reduce places removed 205 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 207 rules applied. Total rules applied 422 place count 189 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 187 transition count 272
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 424 place count 187 transition count 264
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 440 place count 179 transition count 264
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 495 place count 124 transition count 209
Iterating global reduction 3 with 55 rules applied. Total rules applied 550 place count 124 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 552 place count 124 transition count 207
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 552 place count 124 transition count 200
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 566 place count 117 transition count 200
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 632 place count 84 transition count 167
Performed 14 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 660 place count 70 transition count 195
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 664 place count 70 transition count 191
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 686 place count 70 transition count 169
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 706 place count 70 transition count 147
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 254 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 43 rules applied. Total rules applied 749 place count 49 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 49 transition count 124
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 752 place count 47 transition count 118
Iterating global reduction 7 with 2 rules applied. Total rules applied 754 place count 47 transition count 118
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 766 place count 47 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 767 place count 46 transition count 105
Applied a total of 767 rules in 225 ms. Remains 46 /556 variables (removed 510) and now considering 105/684 (removed 579) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/556 places, 105/684 transitions.
Normalized transition count is 79 out of 105 initially.
// Phase 1: matrix 79 rows 46 cols
[2022-05-14 10:16:48] [INFO ] Computed 7 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 27996 resets, run finished after 1533 ms. (steps per millisecond=652 ) properties (out of 5) seen :5
FORMULA CloudDeployment-PT-2b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652523411331

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CloudDeployment-PT-2b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is CloudDeployment-PT-2b, 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 r046-smll-165252115600004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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