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.r492-smll-171636266300158.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 EisenbergMcGuire-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-13
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-14
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717221804080

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:03:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:03:27] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-06-01 06:03:27] [INFO ] Transformed 196 places.
[2024-06-01 06:03:27] [INFO ] Transformed 448 transitions.
[2024-06-01 06:03:27] [INFO ] Found NUPN structural information;
[2024-06-01 06:03:27] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2105 ms. (18 steps per ms) remains 4/15 properties
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 687 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
[2024-06-01 06:03:28] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2024-06-01 06:03:28] [INFO ] Computed 13 invariants in 27 ms
[2024-06-01 06:03:28] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-06 is UNSAT
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 151/189 variables, 9/47 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 151/198 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/198 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/196 variables, 4/202 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 7/209 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 20 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/211 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/211 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 284/480 variables, 196/407 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 112/519 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/480 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 519 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1399 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 133/138 variables, 6/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 133/144 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/144 variables, 3/147 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 6/153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 2/157 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 1/158 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 213/357 variables, 144/302 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 24/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/367 variables, 4/330 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 4/334 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/335 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 43/378 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/378 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 14/381 variables, 6/384 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/381 variables, 6/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/381 variables, 5/395 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/381 variables, 0/395 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 39/420 variables, 1/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 39/435 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/422 variables, 1/436 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/422 variables, 2/438 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/422 variables, 1/439 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/422 variables, 0/439 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/423 variables, 1/440 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/423 variables, 1/441 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/423 variables, 2/443 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/423 variables, 1/444 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/423 variables, 0/444 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 57/480 variables, 42/486 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/480 variables, 40/526 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/480 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 0/480 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 526 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1404 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 2973ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 152 ms.
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 8 place count 192 transition count 394
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 108 place count 142 transition count 394
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 130 transition count 346
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 130 transition count 346
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 156 place count 118 transition count 334
Applied a total of 156 rules in 163 ms. Remains 118 /196 variables (removed 78) and now considering 334/448 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 118/196 places, 334/448 transitions.
RANDOM walk for 40000 steps (8 resets) in 378 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18948 steps, run visited all 1 properties in 135 ms. (steps per millisecond=140 )
Probabilistic random walk after 18948 steps, saw 5922 distinct states, run finished after 142 ms. (steps per millisecond=133 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 5361 ms.
ITS solved all properties within timeout

BK_STOP 1717221811963

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-04, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266300158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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