About the Execution of 2024-gold for Diffusion2D-PT-D20N010
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075900061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Diffusion2D-PT-D20N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748605313341
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:41:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:41:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:41:56] [INFO ] Load time of PNML (sax parser for PT used): 390 ms
[2025-05-30 11:41:56] [INFO ] Transformed 400 places.
[2025-05-30 11:41:56] [INFO ] Transformed 2964 transitions.
[2025-05-30 11:41:56] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 623 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 41 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2964 rows 400 cols
[2025-05-30 11:41:56] [INFO ] Computed 1 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 10001 steps (2 resets) in 45 ms. (217 steps per ms)
FORMULA Diffusion2D-PT-D20N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 71 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 9, 1, 1, 9, 9, 6, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10]
[2025-05-30 11:41:56] [INFO ] Invariant cache hit.
[2025-05-30 11:41:57] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2025-05-30 11:41:58] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2025-05-30 11:41:59] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 413 ms.
[2025-05-30 11:41:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:41:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:41:59] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2025-05-30 11:42:00] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 318 ms.
Minimization took 546 ms.
[2025-05-30 11:42:01] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:42:01] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2025-05-30 11:42:02] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 223 ms.
[2025-05-30 11:42:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:03] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2025-05-30 11:42:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 267 ms.
Minimization took 559 ms.
[2025-05-30 11:42:04] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:04] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2025-05-30 11:42:05] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 254 ms.
[2025-05-30 11:42:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-05-30 11:42:05] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2025-05-30 11:42:06] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 309 ms.
Minimization took 539 ms.
[2025-05-30 11:42:06] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:07] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2025-05-30 11:42:07] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 180 ms.
[2025-05-30 11:42:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-30 11:42:08] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2025-05-30 11:42:09] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 243 ms.
Minimization took 539 ms.
[2025-05-30 11:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:10] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2025-05-30 11:42:11] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 269 ms.
[2025-05-30 11:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:42:11] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2025-05-30 11:42:12] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 254 ms.
Minimization took 558 ms.
[2025-05-30 11:42:12] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:13] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2025-05-30 11:42:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 249 ms.
[2025-05-30 11:42:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:15] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2025-05-30 11:42:15] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 217 ms.
Minimization took 539 ms.
[2025-05-30 11:42:15] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2025-05-30 11:42:16] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2025-05-30 11:42:17] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 283 ms.
[2025-05-30 11:42:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-05-30 11:42:18] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2025-05-30 11:42:18] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 289 ms.
Minimization took 539 ms.
[2025-05-30 11:42:19] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:19] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2025-05-30 11:42:20] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 303 ms.
[2025-05-30 11:42:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-30 11:42:21] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2025-05-30 11:42:21] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 286 ms.
Minimization took 558 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 9, 1, 1, 9, 9, 6, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 9, 1, 1, 9, 9, 6, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10]
Support contains 8 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2848 edges and 400 vertex of which 392 / 400 are part of one of the 1 SCC in 10 ms
Free SCC test removed 391 places
Drop transitions (Empty/Sink Transition effects.) removed 2848 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 2948 transitions.
Applied a total of 1 rules in 50 ms. Remains 9 /400 variables (removed 391) and now considering 16/2964 (removed 2948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 9/400 places, 16/2964 transitions.
// Phase 1: matrix 16 rows 9 cols
[2025-05-30 11:42:22] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 9, 1, 1, 9, 9, 6, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (2 resets) in 361 ms. (2762 steps per ms)
FORMULA Diffusion2D-PT-D20N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D20N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 307 ms. (3246 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 )
[2025-05-30 11:42:23] [INFO ] Flatten gal took : 244 ms
[2025-05-30 11:42:23] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:42:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1921723820694249771.gal : 9 ms
[2025-05-30 11:42:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8301799475579707493.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1921723820694249771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8301799475579707493.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 27666 ms.
BK_STOP 1748605343183
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-D20N010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Diffusion2D-PT-D20N010, 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 r069-smll-174854075900061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N010.tgz
mv Diffusion2D-PT-D20N010 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.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 ;