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.r526-tall-171679094300236.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 ltsminxred
Input is SafeBus-COL-15, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r526-tall-171679094300236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717219341178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 05:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:22:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:22:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:22:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 576 ms
[2024-06-01 05:22:22] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2024-06-01 05:22:22] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 23 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:22:23] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-06-01 05:22:23] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2024-06-01 05:22:23] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 113 ms.
[2024-06-01 05:22:23] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 30 places and 30 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.23231KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1276 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1286 ms. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1014 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-06-01 05:22:25] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-06-01 05:22:25] [INFO ] Computed 65 invariants in 73 ms
[2024-06-01 05:22:27] [INFO ] Implicit Places using invariants in 1529 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1571 ms to find 15 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4756
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4756
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 30 rules in 1161 ms. Remains 576 /591 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
[2024-06-01 05:22:28] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-06-01 05:22:28] [INFO ] Computed 50 invariants in 37 ms
[2024-06-01 05:22:29] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-06-01 05:22:29] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 05:22:29] [INFO ] Invariant cache hit.
[2024-06-01 05:22:29] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 05:22:35] [INFO ] Implicit Places using invariants and state equation in 6234 ms returned []
Implicit Place search using SMT with State Equation took 7444 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 576/606 places, 4756/4771 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 11193 ms. Remains : 576/606 places, 4756/4771 transitions.
Random walk for 1250000 steps, including 0 resets, run took 15741 ms (no deadlock found). (steps per millisecond=79 )
Random directed walk for 1250000 steps, including 0 resets, run took 11600 ms (no deadlock found). (steps per millisecond=107 )
[2024-06-01 05:23:03] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 05:23:03] [INFO ] Invariant cache hit.
[2024-06-01 05:23:03] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2024-06-01 05:23:05] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 1420 ms returned sat
[2024-06-01 05:23:06] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2024-06-01 05:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2024-06-01 05:23:07] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 84 ms returned sat
[2024-06-01 05:23:08] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2024-06-01 05:23:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 05:23:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 605 ms returned sat
[2024-06-01 05:23:09] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 22 ms to minimize.
[2024-06-01 05:23:12] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 3 ms to minimize.
[2024-06-01 05:23:13] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:23:13] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 14 ms to minimize.
[2024-06-01 05:23:14] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 2 ms to minimize.
[2024-06-01 05:23:14] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 2 ms to minimize.
[2024-06-01 05:23:14] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 2 ms to minimize.
[2024-06-01 05:23:14] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-06-01 05:23:15] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 1 ms to minimize.
[2024-06-01 05:23:15] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:23:15] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-06-01 05:23:15] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 2 ms to minimize.
[2024-06-01 05:23:16] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 2 ms to minimize.
[2024-06-01 05:23:17] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 2 ms to minimize.
[2024-06-01 05:23:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8412 ms
[2024-06-01 05:23:17] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 249 ms.
[2024-06-01 05:23:18] [INFO ] Added : 2 causal constraints over 2 iterations in 525 ms. Result :sat
Parikh directed walk for 48800 steps, including 1000 resets, run took 733 ms. (steps per millisecond=66 )
Random directed walk for 500003 steps, including 0 resets, run took 4635 ms (no deadlock found). (steps per millisecond=107 )
Random walk for 500000 steps, including 0 resets, run took 6062 ms (no deadlock found). (steps per millisecond=82 )
Random directed walk for 500000 steps, including 0 resets, run took 4542 ms (no deadlock found). (steps per millisecond=110 )
Random walk for 500000 steps, including 0 resets, run took 6128 ms (no deadlock found). (steps per millisecond=81 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 994 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 05:23:41] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 05:23:41] [INFO ] Invariant cache hit.
[2024-06-01 05:23:42] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2024-06-01 05:23:42] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 05:23:42] [INFO ] Invariant cache hit.
[2024-06-01 05:23:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 05:23:49] [INFO ] Implicit Places using invariants and state equation in 6636 ms returned []
Implicit Place search using SMT with State Equation took 7852 ms to find 0 implicit places.
[2024-06-01 05:23:49] [INFO ] Redundant transitions in 364 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 05:23:49] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 05:23:49] [INFO ] Invariant cache hit.
[2024-06-01 05:23:49] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 15 solved, 4726 unsolved
SMT process timed out in 60998ms, After SMT, problems are : Problem set: 15 solved, 4726 unsolved
Search for dead transitions found 15 dead transitions in 61070ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 576/576 places, 4741/4756 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1014 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2024-06-01 05:24:51] [INFO ] Redundant transitions in 298 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 71646 ms. Remains : 576/576 places, 4741/4756 transitions.
Random walk for 1250000 steps, including 0 resets, run took 16151 ms (no deadlock found). (steps per millisecond=77 )
Random directed walk for 1250000 steps, including 0 resets, run took 12012 ms (no deadlock found). (steps per millisecond=104 )
[2024-06-01 05:25:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 05:25:19] [INFO ] Invariant cache hit.
[2024-06-01 05:25:20] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2024-06-01 05:25:21] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 908 ms returned sat
[2024-06-01 05:25:22] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2024-06-01 05:25:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:25:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2024-06-01 05:25:23] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 321 ms returned sat
[2024-06-01 05:25:24] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2024-06-01 05:25:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 05:25:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 338 ms returned sat
[2024-06-01 05:25:25] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-06-01 05:25:25] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2024-06-01 05:25:25] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2024-06-01 05:25:26] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2024-06-01 05:25:26] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 2 ms to minimize.
[2024-06-01 05:25:26] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 2 ms to minimize.
[2024-06-01 05:25:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1539 ms
[2024-06-01 05:25:26] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 191 ms.
[2024-06-01 05:25:26] [INFO ] Added : 1 causal constraints over 1 iterations in 377 ms. Result :sat
Parikh directed walk for 56600 steps, including 1000 resets, run took 812 ms. (steps per millisecond=69 )
Random directed walk for 500000 steps, including 0 resets, run took 4761 ms (no deadlock found). (steps per millisecond=105 )
Random walk for 500000 steps, including 0 resets, run took 6434 ms (no deadlock found). (steps per millisecond=77 )
Random directed walk for 500000 steps, including 0 resets, run took 4785 ms (no deadlock found). (steps per millisecond=104 )
Random walk for 500000 steps, including 0 resets, run took 5967 ms (no deadlock found). (steps per millisecond=83 )
[2024-06-01 05:25:50] [INFO ] Flatten gal took : 474 ms
[2024-06-01 05:25:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2024-06-01 05:25:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 606 places, 4771 transitions and 34129 arcs took 33 ms.
Total runtime 208128 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ReachabilityDeadlock

BK_STOP 1717219550702

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2024
property name is ReachabilityDeadlock
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SafeBus-COL-15"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is SafeBus-COL-15, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r526-tall-171679094300236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-15.tgz
mv SafeBus-COL-15 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;