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.r516-tajo-171654446900325.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 ltsminxred
Input is PolyORBLF-PT-S06J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 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-S06J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717255792911

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 15:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:29:54] [INFO ] Load time of PNML (sax parser for PT used): 512 ms
[2024-06-01 15:29:54] [INFO ] Transformed 632 places.
[2024-06-01 15:29:55] [INFO ] Transformed 10500 transitions.
[2024-06-01 15:29:55] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 745 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 10, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 10, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 15:29:55] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-06-01 15:29:55] [INFO ] Computed 54 invariants in 161 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 10, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
RANDOM walk for 10000 steps (70 resets) in 182 ms. (54 steps per ms)
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140010 steps (400 resets) in 694 ms. (201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 10, 6, 1, 1, 1, 5, 1, 1, 1, 1, 1, 4, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 15:29:56] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 15:29:56] [INFO ] Invariant cache hit.
[2024-06-01 15:29:56] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-06-01 15:29:56] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 17 ms returned unsat
[2024-06-01 15:29:56] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 15:29:56] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 28 ms returned unsat
[2024-06-01 15:29:56] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 15:29:56] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 33 ms returned unsat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 29 ms returned unsat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 30 ms returned unsat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:29:57] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 81 ms returned sat
[2024-06-01 15:29:59] [INFO ] [Real]Absence check using state equation in 1806 ms returned sat
[2024-06-01 15:29:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:29:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:29:59] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 36 ms returned sat
[2024-06-01 15:30:01] [INFO ] [Nat]Absence check using state equation in 1634 ms returned sat
[2024-06-01 15:30:01] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:30:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:30:02] [INFO ] [Nat]Added 168 Read/Feed constraints in 1067 ms returned unknown
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 21 ms returned unsat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 15 ms returned unsat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 48 ms returned unsat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 15:30:02] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 42 ms returned unsat
[2024-06-01 15:30:03] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-06-01 15:30:03] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 31 ms returned unsat
[2024-06-01 15:30:03] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-06-01 15:30:03] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned unsat
[2024-06-01 15:30:03] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-06-01 15:30:03] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 10, 6, 1, 1, 1, 5, 1, 1, 1, 1, 1, 4, 1] Max Struct:[4, 10, 6, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 4, 1]
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 6 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 114 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 258 place count 500 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 402 place count 428 transition count 2232
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 428 transition count 2220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 426 place count 416 transition count 2220
Applied a total of 426 rules in 536 ms. Remains 416 /632 variables (removed 216) and now considering 2220/2430 (removed 210) transitions.
Running 2214 sub problems to find dead transitions.
[2024-06-01 15:30:03] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
// Phase 1: matrix 2184 rows 416 cols
[2024-06-01 15:30:04] [INFO ] Computed 48 invariants in 115 ms
[2024-06-01 15:30:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 6 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 4 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:30:41] [INFO ] Deduced a trap composed of 62 places in 326 ms of which 2 ms to minimize.
[2024-06-01 15:30:41] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:30:41] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:30:41] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:30:42] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:30:43] [INFO ] Deduced a trap composed of 126 places in 582 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2600 variables, and 51 constraints, problems are : Problem set: 0 solved, 2214 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2214/870 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
[2024-06-01 15:30:54] [INFO ] Deduced a trap composed of 195 places in 464 ms of which 3 ms to minimize.
[2024-06-01 15:30:59] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 2 ms to minimize.
[2024-06-01 15:31:06] [INFO ] Deduced a trap composed of 109 places in 460 ms of which 3 ms to minimize.
[2024-06-01 15:31:07] [INFO ] Deduced a trap composed of 188 places in 449 ms of which 3 ms to minimize.
SMT process timed out in 63523ms, After SMT, problems are : Problem set: 0 solved, 2214 unsolved
Search for dead transitions found 0 dead transitions in 63573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64142 ms. Remains : 416/632 places, 2220/2430 transitions.
[2024-06-01 15:31:07] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 16:20:43] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
[2024-06-01 16:20:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (11594 resets) in 12012 ms. (83 steps per ms)
BEST_FIRST walk for 1000000 steps (8368 resets) in 2814 ms. (355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 16:20:58] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
[2024-06-01 16:20:58] [INFO ] [Real]Absence check using 20 positive place invariants in 82 ms returned sat
[2024-06-01 16:20:58] [INFO ] [Real]Absence check using 20 positive and 28 generalized place invariants in 167 ms returned sat
[2024-06-01 16:21:02] [INFO ] [Real]Absence check using state equation in 4073 ms returned sat
[2024-06-01 16:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:21:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2024-06-01 16:21:02] [INFO ] [Nat]Absence check using 20 positive and 28 generalized place invariants in 18 ms returned sat
[2024-06-01 16:21:05] [INFO ] [Nat]Absence check using state equation in 2564 ms returned sat
[2024-06-01 16:21:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 16:21:06] [INFO ] [Nat]Added 168 Read/Feed constraints in 687 ms returned sat
[2024-06-01 16:21:06] [INFO ] Deduced a trap composed of 42 places in 496 ms of which 3 ms to minimize.
[2024-06-01 16:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 587 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[5]
FORMULA PolyORBLF-PT-S06J04T06-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3072535 ms.
ITS solved all properties within timeout

BK_STOP 1717258866911

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-S06J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S06J04T06, 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 r516-tajo-171654446900325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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