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.r311-tall-171662336400342.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 RERS2020-PT-pb102, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336400342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 71M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 70M 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

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

=== Now, execution of the tool begins

BK_START 1716727489585

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb102
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 12:44:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 12:44:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 12:44:53] [INFO ] Load time of PNML (sax parser for PT used): 2195 ms
[2024-05-26 12:44:53] [INFO ] Transformed 1276 places.
[2024-05-26 12:44:53] [INFO ] Transformed 125387 transitions.
[2024-05-26 12:44:53] [INFO ] Found NUPN structural information;
[2024-05-26 12:44:53] [INFO ] Parsed PT model containing 1276 places and 125387 transitions and 499222 arcs in 2775 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2767 transitions
Reduce redundant transitions removed 2767 transitions.
RANDOM walk for 40000 steps (9 resets) in 6247 ms. (6 steps per ms) remains 12/16 properties
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 728 ms. (54 steps per ms) remains 11/12 properties
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (10 resets) in 666 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 1225 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 695 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 533 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 635 ms. (62 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 506 ms. (78 steps per ms) remains 10/11 properties
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 690 ms. (57 steps per ms) remains 10/10 properties
[2024-05-26 12:44:58] [INFO ] Flow matrix only has 94419 transitions (discarded 28201 similar events)
// Phase 1: matrix 94419 rows 1276 cols
[2024-05-26 12:44:58] [INFO ] Computed 13 invariants in 544 ms
[2024-05-26 12:45:05] [INFO ] State equation strengthened by 3015 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem RERS2020-PT-pb102-ReachabilityCardinality-2024-04 is UNSAT
FORMULA RERS2020-PT-pb102-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1088/1271 variables, 7/190 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1271 variables, 1088/1278 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1271 variables, 1/1279 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/1279 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 5/1276 variables, 5/1284 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 5/1289 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1276 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SMT process timed out in 12577ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 1276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1276/1276 places, 122620/122620 transitions.
Ensure Unique test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 2013 rules applied. Total rules applied 2013 place count 1270 transition count 120613
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 2018 place count 1267 transition count 120611
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2018 place count 1267 transition count 120610
Deduced a syphon composed of 1 places in 171 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2020 place count 1266 transition count 120610
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2022 place count 1264 transition count 120608
Iterating global reduction 2 with 2 rules applied. Total rules applied 2024 place count 1264 transition count 120608
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 49 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 2084 place count 1234 transition count 120578
Ensure Unique test removed 1620 transitions
Reduce isomorphic transitions removed 1620 transitions.
Iterating post reduction 2 with 1620 rules applied. Total rules applied 3704 place count 1234 transition count 118958
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 47 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3706 place count 1233 transition count 118957
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3707 place count 1233 transition count 118956
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 45 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3715 place count 1229 transition count 118957
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3718 place count 1229 transition count 118954
Free-agglomeration rule applied 37 times.
Iterating global reduction 5 with 37 rules applied. Total rules applied 3755 place count 1229 transition count 118917
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 3827 place count 1192 transition count 118882
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3828 place count 1192 transition count 118881
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3830 place count 1191 transition count 118880
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3831 place count 1191 transition count 118879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3832 place count 1190 transition count 118879
Free-agglomeration rule (complex) applied 48 times with reduction of 2085 identical transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 3880 place count 1190 transition count 127775
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 1289 transitions
Reduce isomorphic transitions removed 1315 transitions.
Iterating post reduction 8 with 1363 rules applied. Total rules applied 5243 place count 1142 transition count 126460
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 5250 place count 1142 transition count 126460
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 5253 place count 1142 transition count 126457
Applied a total of 5253 rules in 9089 ms. Remains 1142 /1276 variables (removed 134) and now considering 126457/122620 (removed -3837) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9111 ms. Remains : 1142/1276 places, 126457/122620 transitions.
RANDOM walk for 40000 steps (8 resets) in 5182 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 457 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 467 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 461 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 470 ms. (84 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 463 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 488 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 465 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 619 ms. (64 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 14077 steps, run timeout after 6003 ms. (steps per millisecond=2 ) properties seen :0 out of 9
Probabilistic random walk after 14077 steps, saw 10510 distinct states, run finished after 6007 ms. (steps per millisecond=2 ) properties seen :0
[2024-05-26 12:45:28] [INFO ] Flow matrix only has 99821 transitions (discarded 26636 similar events)
// Phase 1: matrix 99821 rows 1142 cols
[2024-05-26 12:45:29] [INFO ] Computed 7 invariants in 598 ms
[2024-05-26 12:45:35] [INFO ] State equation strengthened by 3359 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1026/1142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1142 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100963/100963 variables, and 1149 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45065 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1142/1142 constraints, ReadFeed: 0/3359 constraints, PredecessorRefiner: 9/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1026/1142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 12:46:33] [INFO ] Deduced a trap composed of 57 places in 12574 ms of which 61 ms to minimize.
[2024-05-26 12:46:45] [INFO ] Deduced a trap composed of 115 places in 11717 ms of which 10 ms to minimize.
[2024-05-26 12:46:58] [INFO ] Deduced a trap composed of 282 places in 12180 ms of which 9 ms to minimize.
[2024-05-26 12:47:09] [INFO ] Deduced a trap composed of 170 places in 11357 ms of which 9 ms to minimize.
SMT process timed out in 100971ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 1142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1142/1142 places, 126457/126457 transitions.
Applied a total of 0 rules in 665 ms. Remains 1142 /1142 variables (removed 0) and now considering 126457/126457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 1142/1142 places, 126457/126457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1142/1142 places, 126457/126457 transitions.
Applied a total of 0 rules in 635 ms. Remains 1142 /1142 variables (removed 0) and now considering 126457/126457 (removed 0) transitions.
[2024-05-26 12:47:11] [INFO ] Flow matrix only has 99821 transitions (discarded 26636 similar events)
[2024-05-26 12:47:11] [INFO ] Invariant cache hit.
[2024-05-26 12:47:23] [INFO ] Implicit Places using invariants in 12176 ms returned []
Implicit Place search using SMT only with invariants took 12184 ms to find 0 implicit places.
Running 126456 sub problems to find dead transitions.
[2024-05-26 12:47:24] [INFO ] Flow matrix only has 99821 transitions (discarded 26636 similar events)
[2024-05-26 12:47:24] [INFO ] Invariant cache hit.
[2024-05-26 12:47:30] [INFO ] State equation strengthened by 3359 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS2020-PT-pb102

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...

BK_TIME_CONFINEMENT_REACHED

--------------------
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="RERS2020-PT-pb102"
export BK_EXAMINATION="ReachabilityCardinality"
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 RERS2020-PT-pb102, 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 r311-tall-171662336400342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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