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.r223-tall-171649611400407.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 greatspnxred
Input is LeafsetExtension-PT-S64C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611400407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716552986298

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 12:16:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 12:16:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:16:28] [INFO ] Load time of PNML (sax parser for PT used): 683 ms
[2024-05-24 12:16:28] [INFO ] Transformed 21462 places.
[2024-05-24 12:16:28] [INFO ] Transformed 21129 transitions.
[2024-05-24 12:16:28] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 892 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1199 resets) in 3440 ms. (11 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (20 resets) in 401 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (40 resets) in 397 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 955 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (43 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 12:16:33] [INFO ] Computed 333 invariants in 2647 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/207 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20073/20280 variables, 120/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20280/42591 variables, and 140 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5152 ms.
Refiners :[Positive P Invariants (semi-flows): 20/67 constraints, Generalized P Invariants (flows): 120/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/207 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20073/20280 variables, 120/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 12:18:03] [INFO ] Deduced a trap composed of 328 places in 80290 ms of which 931 ms to minimize.
SMT process timed out in 93094ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 187 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 11346 are kept as prefixes of interest. Removing 10116 places using SCC suffix rule.72 ms
Discarding 10116 places :
Also discarding 4528 output transitions
Drop transitions (Output transitions of discarded places.) removed 4528 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1321 transitions
Reduce isomorphic transitions removed 1321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4026 transitions
Trivial Post-agglo rules discarded 4026 transitions
Performed 4026 trivial Post agglomeration. Transition count delta: 4026
Iterating post reduction 0 with 5347 rules applied. Total rules applied 5348 place count 11346 transition count 11254
Reduce places removed 4027 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 4039 rules applied. Total rules applied 9387 place count 7319 transition count 11242
Reduce places removed 12 places and 0 transitions.
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Iterating post reduction 2 with 910 rules applied. Total rules applied 10297 place count 7307 transition count 10344
Reduce places removed 898 places and 0 transitions.
Iterating post reduction 3 with 898 rules applied. Total rules applied 11195 place count 6409 transition count 10344
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 11195 place count 6409 transition count 10262
Deduced a syphon composed of 82 places in 5 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 11359 place count 6327 transition count 10262
Discarding 2703 places :
Symmetric choice reduction at 4 with 2703 rule applications. Total rules 14062 place count 3624 transition count 7559
Iterating global reduction 4 with 2703 rules applied. Total rules applied 16765 place count 3624 transition count 7559
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 16795 place count 3594 transition count 7529
Iterating global reduction 4 with 30 rules applied. Total rules applied 16825 place count 3594 transition count 7529
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 16849 place count 3594 transition count 7505
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 16873 place count 3570 transition count 7505
Partial Free-agglomeration rule applied 358 times.
Drop transitions (Partial Free agglomeration) removed 358 transitions
Iterating global reduction 5 with 358 rules applied. Total rules applied 17231 place count 3570 transition count 7505
Applied a total of 17231 rules in 4168 ms. Remains 3570 /21462 variables (removed 17892) and now considering 7505/21129 (removed 13624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4180 ms. Remains : 3570/21462 places, 7505/21129 transitions.
RANDOM walk for 40000 steps (2303 resets) in 1518 ms. (26 steps per ms) remains 8/10 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (30 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (52 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (47 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (48 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (52 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
[2024-05-24 12:18:08] [INFO ] Flow matrix only has 6343 transitions (discarded 1162 similar events)
// Phase 1: matrix 6343 rows 3570 cols
[2024-05-24 12:18:08] [INFO ] Computed 122 invariants in 64 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1180/1364 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1364 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/1365 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 3487/4852 variables, 1365/1413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4852 variables, 0/1413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 4001/8853 variables, 1146/2559 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8853 variables, 54/2613 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8853 variables, 0/2613 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1008/9861 variables, 20/2633 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9861 variables, 1006/3639 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9861 variables, 0/3639 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 52/9913 variables, 53/3692 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/9913 variables, 0/3692 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/9913 variables, 0/3692 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9913/9913 variables, and 3692 constraints, problems are : Problem set: 1 solved, 7 unsolved in 9737 ms.
Refiners :[Generalized P Invariants (flows): 122/122 constraints, State Equation: 3570/3570 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1080/1232 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1232 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/1233 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3087/4320 variables, 1233/1275 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4320 variables, 0/1275 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 4292/8612 variables, 1047/2322 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8612 variables, 17/2339 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8612 variables, 7/2346 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8612 variables, 0/2346 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1168/9780 variables, 63/2409 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9780 variables, 1155/3564 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/9780 variables, 0/3564 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 133/9913 variables, 135/3699 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/9913 variables, 0/3699 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/9913 variables, 0/3699 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9913/9913 variables, and 3699 constraints, problems are : Problem set: 1 solved, 7 unsolved in 20645 ms.
Refiners :[Generalized P Invariants (flows): 122/122 constraints, State Equation: 3570/3570 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 30587ms problems are : Problem set: 1 solved, 7 unsolved
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 196 ms.
All properties solved without resorting to model-checking.
Total runtime 131953 ms.
ITS solved all properties within timeout

BK_STOP 1716553119479

--------------------
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 ReachabilityFireability -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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is LeafsetExtension-PT-S64C4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611400407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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