About the Execution of 2022-gold for PolyORBLF-PT-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
658.476 | 48216.00 | 59288.00 | 2331.20 | 6 5 1 1 1 1 1 1 4 1 4 3 4 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r319-tall-167873969900078.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PolyORBLF-PT-S06J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900078
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Feb 26 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 26 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 463K Feb 26 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Feb 26 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Feb 26 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 544K Feb 26 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 26 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11M Mar 5 18:23 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 PolyORBLF-PT-S06J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678874685724
Running Version 202205111006
[2023-03-15 10:04:47] [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]
[2023-03-15 10:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:04:47] [INFO ] Load time of PNML (sax parser for PT used): 569 ms
[2023-03-15 10:04:47] [INFO ] Transformed 700 places.
[2023-03-15 10:04:48] [INFO ] Transformed 10740 transitions.
[2023-03-15 10:04:48] [INFO ] Parsed PT model containing 700 places and 10740 transitions in 761 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Normalized transition count is 2634 out of 2670 initially.
// Phase 1: matrix 2634 rows 700 cols
[2023-03-15 10:04:48] [INFO ] Computed 58 place invariants in 194 ms
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 59 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :19
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :19
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :24
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :26
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :24
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :23
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :22
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :27
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :26
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :25
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :27
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :28
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :22
[2023-03-15 10:04:49] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2023-03-15 10:04:49] [INFO ] Computed 58 place invariants in 102 ms
[2023-03-15 10:04:51] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned sat
[2023-03-15 10:04:51] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 33 ms returned unsat
[2023-03-15 10:04:51] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-15 10:04:51] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 39 ms returned sat
[2023-03-15 10:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:04:55] [INFO ] [Real]Absence check using state equation in 4672 ms returned sat
[2023-03-15 10:04:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:04:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-15 10:04:56] [INFO ] [Nat]Absence check using 22 positive and 36 generalized place invariants in 34 ms returned sat
[2023-03-15 10:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:01] [INFO ] [Nat]Absence check using state equation in 4903 ms returned unknown
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 36 ms returned unsat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 25 ms returned unsat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 20 ms returned unsat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 21 ms returned unsat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned unsat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-15 10:05:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 34 ms returned sat
[2023-03-15 10:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:06] [INFO ] [Real]Absence check using state equation in 4901 ms returned unknown
[2023-03-15 10:05:06] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-15 10:05:06] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 29 ms returned unsat
[2023-03-15 10:05:06] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-15 10:05:06] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 27 ms returned unsat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 19 ms returned unsat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 18 ms returned unsat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 20 ms returned unsat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive place invariants in 20 ms returned sat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 8 ms returned unsat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive place invariants in 30 ms returned sat
[2023-03-15 10:05:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, -1, 1, 1, 1, 1, 1, -1, 1, 4, 3, 4, 1, 1, 1] Max seen :[6, 5, 1, 1, 1, 1, 1, 3, 1, 4, 3, 4, 1, 1, 1]
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 700 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 640 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 114 place count 640 transition count 2532
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 282 place count 556 transition count 2532
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 424 place count 485 transition count 2461
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 436 place count 485 transition count 2449
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 448 place count 473 transition count 2449
Applied a total of 448 rules in 429 ms. Remains 473 /700 variables (removed 227) and now considering 2449/2670 (removed 221) transitions.
[2023-03-15 10:05:07] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)
// Phase 1: matrix 2413 rows 473 cols
[2023-03-15 10:05:08] [INFO ] Computed 52 place invariants in 64 ms
[2023-03-15 10:05:09] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 473/700 places, 1531/2670 transitions.
Applied a total of 0 rules in 36 ms. Remains 473 /473 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 473/700 places, 1531/2670 transitions.
Normalized transition count is 1495 out of 1531 initially.
// Phase 1: matrix 1495 rows 473 cols
[2023-03-15 10:05:09] [INFO ] Computed 52 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 10892 resets, run finished after 7555 ms. (steps per millisecond=132 ) properties (out of 2) seen :9
Incomplete Best-First random walk after 1000000 steps, including 1242 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties (out of 2) seen :9
Incomplete Best-First random walk after 1000001 steps, including 3416 resets, run finished after 2465 ms. (steps per millisecond=405 ) properties (out of 2) seen :9
[2023-03-15 10:05:21] [INFO ] Flow matrix only has 1495 transitions (discarded 36 similar events)
// Phase 1: matrix 1495 rows 473 cols
[2023-03-15 10:05:21] [INFO ] Computed 52 place invariants in 27 ms
[2023-03-15 10:05:22] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 10:05:22] [INFO ] [Real]Absence check using 22 positive and 30 generalized place invariants in 20 ms returned sat
[2023-03-15 10:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:24] [INFO ] [Real]Absence check using state equation in 2176 ms returned sat
[2023-03-15 10:05:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:05:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-15 10:05:24] [INFO ] [Nat]Absence check using 22 positive and 30 generalized place invariants in 21 ms returned sat
[2023-03-15 10:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:05:29] [INFO ] [Nat]Absence check using state equation in 5197 ms returned sat
[2023-03-15 10:05:29] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 10:05:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 10:05:33] [INFO ] [Nat]Added 168 Read/Feed constraints in 3761 ms returned sat
[2023-03-15 10:05:33] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 3 ms to minimize.
[2023-03-15 10:05:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 409 ms
[2023-03-15 10:05:33] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-15 10:05:33] [INFO ] [Real]Absence check using 22 positive and 30 generalized place invariants in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : [5, 4] Max seen :[5, 4]
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 46613 ms.
BK_STOP 1678874733940
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is PolyORBLF-PT-S06J06T06, 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 r319-tall-167873969900078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T06.tgz
mv PolyORBLF-PT-S06J06T06 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 '
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 ;