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.r295-tall-167873948000501.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 lolaxred
Input is PolyORBLF-PT-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948000501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 15K Feb 26 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K Feb 26 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Feb 26 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 235K Feb 26 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 63K Feb 26 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 346K Feb 26 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:34 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 717K 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-S02J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678851860944

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=PolyORBLF-PT-S02J04T08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 03:44:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 03:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 03:44:22] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-15 03:44:22] [INFO ] Transformed 614 places.
[2023-03-15 03:44:22] [INFO ] Transformed 1242 transitions.
[2023-03-15 03:44:22] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Normalized transition count is 1098 out of 1114 initially.
// Phase 1: matrix 1098 rows 614 cols
[2023-03-15 03:44:22] [INFO ] Computed 50 place invariants in 74 ms
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :25
[2023-03-15 03:44:23] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2023-03-15 03:44:23] [INFO ] Computed 50 place invariants in 40 ms
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 22 ms returned unsat
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 17 ms returned unsat
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 7 ms returned unsat
[2023-03-15 03:44:23] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned unsat
[2023-03-15 03:44:24] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:24] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 8 ms returned unsat
[2023-03-15 03:44:24] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-15 03:44:24] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 18 ms returned sat
[2023-03-15 03:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:44:24] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2023-03-15 03:44:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:44:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-15 03:44:25] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 16 ms returned sat
[2023-03-15 03:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 03:44:26] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2023-03-15 03:44:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 03:44:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 2522 ms returned sat
[2023-03-15 03:44:28] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 4 ms to minimize.
[2023-03-15 03:44:29] [INFO ] Deduced a trap composed of 293 places in 303 ms of which 2 ms to minimize.
[2023-03-15 03:44:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 917 ms
[2023-03-15 03:44:29] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 77 ms.
[2023-03-15 03:44:30] [INFO ] Added : 15 causal constraints over 3 iterations in 596 ms. Result :unknown
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 7 ms returned unsat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 11 ms returned unsat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 8 ms returned unsat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 7 ms returned unsat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 7 ms returned unsat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 7 ms returned unsat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 18 ms returned sat
[2023-03-15 03:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:44:31] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-03-15 03:44:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:44:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-15 03:44:31] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned sat
[2023-03-15 03:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 03:44:35] [INFO ] [Nat]Absence check using state equation in 4300 ms returned sat
[2023-03-15 03:44:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 03:44:36] [INFO ] [Nat]Added 96 Read/Feed constraints in 611 ms returned unknown
[2023-03-15 03:44:36] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-15 03:44:36] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2, 1, 2, 1, -1, 1, 1, 1, 1, 1, 1, -1, 10] Max seen :[1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 10]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 612 transition count 1043
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 144 place count 541 transition count 979
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 272 place count 477 transition count 979
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 384 place count 421 transition count 923
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 399 place count 421 transition count 908
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 414 place count 406 transition count 908
Applied a total of 414 rules in 180 ms. Remains 406 /614 variables (removed 208) and now considering 908/1114 (removed 206) transitions.
[2023-03-15 03:44:36] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
// Phase 1: matrix 892 rows 406 cols
[2023-03-15 03:44:36] [INFO ] Computed 48 place invariants in 25 ms
[2023-03-15 03:44:37] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 406/614 places, 820/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 404 transition count 804
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 388 transition count 788
Applied a total of 18 rules in 29 ms. Remains 388 /406 variables (removed 18) and now considering 788/820 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 918 ms. Remains : 388/614 places, 788/1114 transitions.
Normalized transition count is 772 out of 788 initially.
// Phase 1: matrix 772 rows 388 cols
[2023-03-15 03:44:37] [INFO ] Computed 48 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 449 resets, run finished after 3961 ms. (steps per millisecond=252 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 182 resets, run finished after 1965 ms. (steps per millisecond=508 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 160 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 2) seen :4
[2023-03-15 03:44:45] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 388 cols
[2023-03-15 03:44:45] [INFO ] Computed 48 place invariants in 7 ms
[2023-03-15 03:44:45] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-15 03:44:45] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 8 ms returned unsat
[2023-03-15 03:44:45] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-15 03:44:45] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2] Max seen :[2, 2]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 22779 ms.
ITS solved all properties within timeout

BK_STOP 1678851886034

--------------------
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="PolyORBLF-PT-S02J04T08"
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 PolyORBLF-PT-S02J04T08, 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 r295-tall-167873948000501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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