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.r289-tajo-171654445100069.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 greatspnxred
Input is Planning-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445100069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 model.pnml
-rw-r--r-- 1 mcc users 1 May 18 16:43 unfinite

--------------------
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 Planning-PT-none-UpperBounds-00
FORMULA_NAME Planning-PT-none-UpperBounds-01
FORMULA_NAME Planning-PT-none-UpperBounds-02
FORMULA_NAME Planning-PT-none-UpperBounds-03
FORMULA_NAME Planning-PT-none-UpperBounds-04
FORMULA_NAME Planning-PT-none-UpperBounds-05
FORMULA_NAME Planning-PT-none-UpperBounds-06
FORMULA_NAME Planning-PT-none-UpperBounds-07
FORMULA_NAME Planning-PT-none-UpperBounds-08
FORMULA_NAME Planning-PT-none-UpperBounds-09
FORMULA_NAME Planning-PT-none-UpperBounds-10
FORMULA_NAME Planning-PT-none-UpperBounds-11
FORMULA_NAME Planning-PT-none-UpperBounds-12
FORMULA_NAME Planning-PT-none-UpperBounds-13
FORMULA_NAME Planning-PT-none-UpperBounds-14
FORMULA_NAME Planning-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716844328097

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Planning-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:12:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 21:12:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:12:09] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-27 21:12:09] [INFO ] Transformed 126 places.
[2024-05-27 21:12:09] [INFO ] Transformed 128 transitions.
[2024-05-27 21:12:09] [INFO ] Parsed PT model containing 126 places and 128 transitions and 652 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 2 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0] Max Struct:[+inf, +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:[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-27 21:12:09] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 124 cols
[2024-05-27 21:12:09] [INFO ] Computed 42 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0] Max Struct:[+inf, 1, +inf, +inf, 1, 7, +inf, +inf, 1, 1, +inf, +inf, 2, 1, 1, 1]
FORMULA Planning-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 136 ms. (72 steps per ms)
FORMULA Planning-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Planning-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 156 ms. (573 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 51, 53, 1, 2, 52, 2, 53, 1] Max Struct:[+inf, +inf, +inf, 7, +inf, +inf, +inf, +inf, 2]
[2024-05-27 21:12:10] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2024-05-27 21:12:10] [INFO ] Invariant cache hit.
[2024-05-27 21:12:10] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2024-05-27 21:12:10] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 21:12:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-27 21:12:10] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-27 21:12:10] [INFO ] [Real]Added 32 Read/Feed constraints in 26 ms returned sat
[2024-05-27 21:12:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned sat
[2024-05-27 21:12:10] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 21 ms returned sat
[2024-05-27 21:12:11] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-27 21:12:11] [INFO ] Added : 16 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 37 ms.
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Added 32 Read/Feed constraints in 21 ms returned sat
[2024-05-27 21:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 17 ms returned sat
[2024-05-27 21:12:11] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-27 21:12:11] [INFO ] Added : 16 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 14 ms.
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Added 32 Read/Feed constraints in 2 ms returned sat
[2024-05-27 21:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 0 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:12:11] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 21:12:11] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 11 ms.
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned unsat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:12:11] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Added 32 Read/Feed constraints in 33 ms returned sat
[2024-05-27 21:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 21:12:12] [INFO ] Added : 16 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 15 ms.
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 21:12:12] [INFO ] Added : 13 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 21:12:12] [INFO ] Added : 16 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 13 ms.
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 2 ms returned sat
[2024-05-27 21:12:12] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 21:12:12] [INFO ] Added : 7 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-27 21:12:12] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[11, 51, 53, 1, 2, 52, 2, 53, 1] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, 1]
FORMULA Planning-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 53, 54, 4, 54, 4, 54] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 128/128 transitions.
Graph (trivial) has 40 edges and 124 vertex of which 28 / 124 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 336 edges and 110 vertex of which 51 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.2 ms
Discarding 59 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (trivial) has 6 edges and 47 vertex of which 4 / 47 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 45 transition count 53
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 34 place count 43 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 41 transition count 48
Applied a total of 37 rules in 35 ms. Remains 41 /124 variables (removed 83) and now considering 48/128 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 41/124 places, 48/128 transitions.
[2024-05-27 21:12:13] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {15=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {16=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :[2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-27 21:12:13] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2024-05-27 21:12:13] [INFO ] Computed 15 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1827 ms. (547 steps per ms)
FORMULA Planning-PT-none-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Planning-PT-none-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 5471 ms.
ITS solved all properties within timeout

BK_STOP 1716844335288

--------------------
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="Planning-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Planning-PT-none, 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 r289-tajo-171654445100069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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