About the Execution of GreatSPN+red for MAPK-PT-02560
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611500477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MAPK-PT-02560, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611500477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 07:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 07:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25K May 18 16:42 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 MAPK-PT-02560-UpperBounds-00
FORMULA_NAME MAPK-PT-02560-UpperBounds-01
FORMULA_NAME MAPK-PT-02560-UpperBounds-02
FORMULA_NAME MAPK-PT-02560-UpperBounds-03
FORMULA_NAME MAPK-PT-02560-UpperBounds-04
FORMULA_NAME MAPK-PT-02560-UpperBounds-05
FORMULA_NAME MAPK-PT-02560-UpperBounds-06
FORMULA_NAME MAPK-PT-02560-UpperBounds-07
FORMULA_NAME MAPK-PT-02560-UpperBounds-08
FORMULA_NAME MAPK-PT-02560-UpperBounds-09
FORMULA_NAME MAPK-PT-02560-UpperBounds-10
FORMULA_NAME MAPK-PT-02560-UpperBounds-11
FORMULA_NAME MAPK-PT-02560-UpperBounds-12
FORMULA_NAME MAPK-PT-02560-UpperBounds-13
FORMULA_NAME MAPK-PT-02560-UpperBounds-14
FORMULA_NAME MAPK-PT-02560-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716560357011
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-02560
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 14:19:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 14:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:19:18] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-24 14:19:18] [INFO ] Transformed 22 places.
[2024-05-24 14:19:18] [INFO ] Transformed 30 transitions.
[2024-05-24 14:19:18] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 1280, 0, 0, 640, 0, 2560, 0, 0, 0, 0, 1920] 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:[0, 0, 0, 0, 0, 1280, 0, 0, 640, 0, 2560, 0, 0, 0, 0, 1920] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 14:19:18] [INFO ] Computed 7 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1280, 0, 0, 640, 0, 2560, 0, 0, 0, 0, 1920] Max Struct:[1920, 1920, 1920, 640, 1280, 1280, 1920, 1280, 640, 1280, 2560, 1280, 2560, 1280, 1280, 1920]
FORMULA MAPK-PT-02560-UpperBounds-15 1920 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-10 2560 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-08 640 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-05 1280 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10264 steps (2 resets) in 9 ms. (1026 steps per ms)
FORMULA MAPK-PT-02560-UpperBounds-03 640 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (22 resets) in 88 ms. (1236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 16, 4, 7, 115, 640, 5, 27, 1280, 27, 640] Max Struct:[1920, 1920, 1920, 1280, 1920, 1280, 1280, 1280, 2560, 1280, 1280]
[2024-05-24 14:19:18] [INFO ] Invariant cache hit.
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 14:19:18] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2024-05-24 14:19:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 14:19:18] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 14:19:18] [INFO ] Added : 15 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 14:19:18] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 14:19:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 14:19:18] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2024-05-24 14:19:18] [INFO ] Added : 12 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 7 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 14:19:19] [INFO ] Added : 15 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 16 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 16 causal constraints over 5 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 16 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 7 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 18 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 16 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 21 causal constraints over 7 iterations in 24 ms. Result :sat
Minimization took 15 ms.
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 14:19:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 14:19:19] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2024-05-24 14:19:19] [INFO ] Added : 16 causal constraints over 5 iterations in 14 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 16, 4, 7, 115, 640, 5, 27, 1280, 27, 640] Max Struct:[1920, 1920, 1920, 1280, 1920, 1280, 1280, 1280, 2560, 1280, 1280]
FORMULA MAPK-PT-02560-UpperBounds-14 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-13 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-12 2560 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-11 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-07 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-09 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-06 1920 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-04 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1920, 1915, 1917] Max Struct:[1920, 1920, 1920]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 12 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 9 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 30 place count 9 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 33 place count 8 transition count 10
Applied a total of 33 rules in 78 ms. Remains 8 /22 variables (removed 14) and now considering 10/30 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 8/22 places, 10/30 transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 14:19:25] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1920, 1915, 1917] Max Struct:[1920, 1920, 1920]
FORMULA MAPK-PT-02560-UpperBounds-00 1920 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1001747 steps (2 resets) in 154 ms. (6462 steps per ms)
FORMULA MAPK-PT-02560-UpperBounds-02 1920 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-02560-UpperBounds-01 1920 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 237 ms. (4201 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 8074 ms.
ITS solved all properties within timeout
BK_STOP 1716560366346
--------------------
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="MAPK-PT-02560"
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 MAPK-PT-02560, 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 r223-tall-171649611500477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-02560.tgz
mv MAPK-PT-02560 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 ;