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

About the Execution of Smart+red for Diffusion2D-PT-D30N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
574.228 60856.00 79116.00 750.20 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 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.r139-smll-167819422100189.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 smartxred
Input is Diffusion2D-PT-D30N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819422100189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 04:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 04:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 Diffusion2D-PT-D30N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678334558019

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N010
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 04:02:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:02:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:02:42] [INFO ] Load time of PNML (sax parser for PT used): 727 ms
[2023-03-09 04:02:42] [INFO ] Transformed 900 places.
[2023-03-09 04:02:42] [INFO ] Transformed 6844 transitions.
[2023-03-09 04:02:42] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 942 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 04:02:42] [INFO ] Computed 1 place invariants in 145 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :50
FORMULA Diffusion2D-PT-D30N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :7
[2023-03-09 04:02:42] [INFO ] Invariant cache hit.
[2023-03-09 04:02:43] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2023-03-09 04:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:45] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2023-03-09 04:02:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:47] [INFO ] [Nat]Absence check using state equation in 1913 ms returned sat
[2023-03-09 04:02:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 776 ms.
[2023-03-09 04:02:49] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:50] [INFO ] [Real]Absence check using state equation in 1698 ms returned sat
[2023-03-09 04:02:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:02:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:52] [INFO ] [Nat]Absence check using state equation in 1650 ms returned sat
[2023-03-09 04:02:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 677 ms.
[2023-03-09 04:02:54] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:55] [INFO ] [Real]Absence check using state equation in 1607 ms returned sat
[2023-03-09 04:02:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 577 ms.
[2023-03-09 04:02:56] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:02:58] [INFO ] [Real]Absence check using state equation in 1752 ms returned sat
[2023-03-09 04:02:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:02:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:00] [INFO ] [Nat]Absence check using state equation in 1897 ms returned sat
[2023-03-09 04:03:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 583 ms.
[2023-03-09 04:03:01] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:03] [INFO ] [Real]Absence check using state equation in 1995 ms returned sat
[2023-03-09 04:03:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:03:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:05] [INFO ] [Nat]Absence check using state equation in 1912 ms returned sat
[2023-03-09 04:03:06] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 625 ms.
[2023-03-09 04:03:07] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-09 04:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:09] [INFO ] [Real]Absence check using state equation in 2058 ms returned sat
[2023-03-09 04:03:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 718 ms.
[2023-03-09 04:03:10] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2023-03-09 04:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:12] [INFO ] [Real]Absence check using state equation in 1643 ms returned sat
[2023-03-09 04:03:13] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 629 ms.
[2023-03-09 04:03:13] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:15] [INFO ] [Real]Absence check using state equation in 1928 ms returned sat
[2023-03-09 04:03:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:03:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 04:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:17] [INFO ] [Nat]Absence check using state equation in 1953 ms returned sat
[2023-03-09 04:03:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 630 ms.
[2023-03-09 04:03:18] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:20] [INFO ] [Real]Absence check using state equation in 2017 ms returned sat
[2023-03-09 04:03:21] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 555 ms.
[2023-03-09 04:03:21] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 04:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:23] [INFO ] [Real]Absence check using state equation in 1729 ms returned sat
[2023-03-09 04:03:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:03:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:25] [INFO ] [Nat]Absence check using state equation in 1860 ms returned sat
[2023-03-09 04:03:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 492 ms.
[2023-03-09 04:03:26] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 04:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:28] [INFO ] [Real]Absence check using state equation in 1684 ms returned sat
[2023-03-09 04:03:29] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 692 ms.
[2023-03-09 04:03:29] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:31] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2023-03-09 04:03:32] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 730 ms.
[2023-03-09 04:03:32] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 04:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:34] [INFO ] [Real]Absence check using state equation in 1717 ms returned sat
[2023-03-09 04:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:03:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 04:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:03:36] [INFO ] [Nat]Absence check using state equation in 1778 ms returned sat
[2023-03-09 04:03:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 566 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[0, 0, 1, 0, 0, 2, 1, 0, 1, 0, 1, 7, 8]
Support contains 13 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6646 edges and 900 vertex of which 887 / 900 are part of one of the 1 SCC in 26 ms
Free SCC test removed 886 places
Drop transitions removed 6646 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 6814 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 14 transition count 24
Applied a total of 7 rules in 75 ms. Remains 14 /900 variables (removed 886) and now considering 24/6844 (removed 6820) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 14/900 places, 24/6844 transitions.
// Phase 1: matrix 24 rows 14 cols
[2023-03-09 04:03:37] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 13) seen :130
FORMULA Diffusion2D-PT-D30N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 56596 ms.
ITS solved all properties within timeout

BK_STOP 1678334618875

--------------------
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="Diffusion2D-PT-D30N010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Diffusion2D-PT-D30N010, 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 r139-smll-167819422100189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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