fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856419800085
Last Updated
May 14, 2023

About the Execution of Marcie+red for IBM5964-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
266.623 5730.00 9800.00 172.60 0 0 0 1 3 1 0 0 0 0 0 0 0 0 0 0 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856419800085.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 marciexred
Input is IBM5964-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 171K Mar 5 18:22 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 IBM5964-PT-none-UpperBounds-00
FORMULA_NAME IBM5964-PT-none-UpperBounds-01
FORMULA_NAME IBM5964-PT-none-UpperBounds-02
FORMULA_NAME IBM5964-PT-none-UpperBounds-03
FORMULA_NAME IBM5964-PT-none-UpperBounds-04
FORMULA_NAME IBM5964-PT-none-UpperBounds-05
FORMULA_NAME IBM5964-PT-none-UpperBounds-06
FORMULA_NAME IBM5964-PT-none-UpperBounds-07
FORMULA_NAME IBM5964-PT-none-UpperBounds-08
FORMULA_NAME IBM5964-PT-none-UpperBounds-09
FORMULA_NAME IBM5964-PT-none-UpperBounds-10
FORMULA_NAME IBM5964-PT-none-UpperBounds-11
FORMULA_NAME IBM5964-PT-none-UpperBounds-12
FORMULA_NAME IBM5964-PT-none-UpperBounds-13
FORMULA_NAME IBM5964-PT-none-UpperBounds-14
FORMULA_NAME IBM5964-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679447805882

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 01:16:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 01:16:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:16:47] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-22 01:16:47] [INFO ] Transformed 263 places.
[2023-03-22 01:16:47] [INFO ] Transformed 139 transitions.
[2023-03-22 01:16:47] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 139 rows 263 cols
[2023-03-22 01:16:47] [INFO ] Computed 128 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 212 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :5
[2023-03-22 01:16:47] [INFO ] Invariant cache hit.
[2023-03-22 01:16:47] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 39 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-22 01:16:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 21 ms returned unsat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 18 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 01:16:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 9 ms returned unsat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 15 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 01:16:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 21 ms returned unsat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 17 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 15 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 18 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 27 ms returned sat
[2023-03-22 01:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 01:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 13 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-22 01:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 14 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-22 01:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 16 ms returned unsat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 21 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-22 01:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 11 ms returned unsat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 13 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-22 01:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 19 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-22 01:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 15 ms returned sat
[2023-03-22 01:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 01:16:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 12 ms returned unsat
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 15 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-22 01:16:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 13 ms returned unsat
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 56 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-22 01:16:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 5 ms returned unsat
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 17 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-22 01:16:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:50] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 1, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max seen :[0, 0, 0, 1, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA IBM5964-PT-none-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBM5964-PT-none-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3305 ms.
ITS solved all properties within timeout

BK_STOP 1679447811612

--------------------
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.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="IBM5964-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is IBM5964-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 r234-tall-167856419800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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