Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r192-tall-167838876700293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is FlexibleBarrier-PT-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r192-tall-167838876700293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678580745758

Running Version 202205111006
[2023-03-12 00:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-12 00:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:25:47] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-12 00:25:47] [INFO ] Transformed 542 places.
[2023-03-12 00:25:47] [INFO ] Transformed 621 transitions.
[2023-03-12 00:25:47] [INFO ] Found NUPN structural information;
[2023-03-12 00:25:47] [INFO ] Parsed PT model containing 542 places and 621 transitions in 228 ms.
Graph (trivial) has 522 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 12 ms
Free SCC test removed 32 places
Structural test allowed to assert that 164 places are NOT stable. Took 26 ms.
Ensure Unique test removed 33 transitions
Reduce redundant transitions removed 33 transitions.
Incomplete random walk after 10000 steps, including 247 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 378) seen :110
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 268) seen :0
Running SMT prover for 268 properties.
[2023-03-12 00:25:48] [INFO ] Flow matrix only has 583 transitions (discarded 5 similar events)
// Phase 1: matrix 583 rows 510 cols
[2023-03-12 00:25:48] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-12 00:25:52] [INFO ] After 3984ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:268
[2023-03-12 00:25:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 30 ms returned sat
[2023-03-12 00:26:03] [INFO ] After 5974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :268
[2023-03-12 00:26:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 00:26:09] [INFO ] After 6078ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :268
[2023-03-12 00:26:09] [INFO ] Deduced a trap composed of 193 places in 220 ms of which 5 ms to minimize.
[2023-03-12 00:26:10] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 3 ms to minimize.
[2023-03-12 00:26:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 552 ms
[2023-03-12 00:26:10] [INFO ] Deduced a trap composed of 122 places in 211 ms of which 2 ms to minimize.
[2023-03-12 00:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-12 00:26:10] [INFO ] Deduced a trap composed of 204 places in 219 ms of which 2 ms to minimize.
[2023-03-12 00:26:11] [INFO ] Deduced a trap composed of 179 places in 199 ms of which 0 ms to minimize.
[2023-03-12 00:26:11] [INFO ] Deduced a trap composed of 183 places in 177 ms of which 0 ms to minimize.
[2023-03-12 00:26:11] [INFO ] Deduced a trap composed of 200 places in 154 ms of which 1 ms to minimize.
[2023-03-12 00:26:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 897 ms
[2023-03-12 00:26:11] [INFO ] Deduced a trap composed of 196 places in 143 ms of which 1 ms to minimize.
[2023-03-12 00:26:11] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 1 ms to minimize.
[2023-03-12 00:26:12] [INFO ] Deduced a trap composed of 203 places in 128 ms of which 1 ms to minimize.
[2023-03-12 00:26:12] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 0 ms to minimize.
[2023-03-12 00:26:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 670 ms
[2023-03-12 00:26:12] [INFO ] Deduced a trap composed of 157 places in 109 ms of which 0 ms to minimize.
[2023-03-12 00:26:12] [INFO ] Deduced a trap composed of 170 places in 105 ms of which 1 ms to minimize.
[2023-03-12 00:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-03-12 00:26:13] [INFO ] Deduced a trap composed of 198 places in 147 ms of which 1 ms to minimize.
[2023-03-12 00:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-12 00:26:13] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 1 ms to minimize.
[2023-03-12 00:26:13] [INFO ] Deduced a trap composed of 202 places in 198 ms of which 0 ms to minimize.
[2023-03-12 00:26:14] [INFO ] Deduced a trap composed of 218 places in 140 ms of which 0 ms to minimize.
[2023-03-12 00:26:14] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 1 ms to minimize.
[2023-03-12 00:26:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 754 ms
[2023-03-12 00:26:14] [INFO ] Deduced a trap composed of 193 places in 161 ms of which 0 ms to minimize.
[2023-03-12 00:26:14] [INFO ] Deduced a trap composed of 221 places in 140 ms of which 0 ms to minimize.
[2023-03-12 00:26:14] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 1 ms to minimize.
[2023-03-12 00:26:14] [INFO ] Deduced a trap composed of 194 places in 118 ms of which 2 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Deduced a trap composed of 155 places in 120 ms of which 1 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Deduced a trap composed of 183 places in 110 ms of which 1 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Deduced a trap composed of 185 places in 243 ms of which 1 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Deduced a trap composed of 200 places in 128 ms of which 0 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Deduced a trap composed of 177 places in 114 ms of which 1 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Deduced a trap composed of 161 places in 132 ms of which 1 ms to minimize.
[2023-03-12 00:26:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1641 ms
[2023-03-12 00:26:16] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 1 ms to minimize.
[2023-03-12 00:26:16] [INFO ] Deduced a trap composed of 200 places in 157 ms of which 1 ms to minimize.
[2023-03-12 00:26:16] [INFO ] Deduced a trap composed of 192 places in 268 ms of which 1 ms to minimize.
[2023-03-12 00:26:16] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 1 ms to minimize.
[2023-03-12 00:26:17] [INFO ] Deduced a trap composed of 174 places in 179 ms of which 1 ms to minimize.
[2023-03-12 00:26:17] [INFO ] Deduced a trap composed of 211 places in 135 ms of which 2 ms to minimize.
[2023-03-12 00:26:17] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 0 ms to minimize.
[2023-03-12 00:26:17] [INFO ] Deduced a trap composed of 184 places in 124 ms of which 1 ms to minimize.
[2023-03-12 00:26:17] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 0 ms to minimize.
[2023-03-12 00:26:17] [INFO ] Deduced a trap composed of 178 places in 130 ms of which 0 ms to minimize.
[2023-03-12 00:26:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 00:26:17] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:268
Fused 268 Parikh solutions to 264 different solutions.
Parikh walk visited 1 properties in 1468 ms.
Support contains 267 out of 510 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 510/510 places, 588/588 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 510 transition count 514
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 142 place count 442 transition count 514
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 168 place count 416 transition count 488
Iterating global reduction 2 with 26 rules applied. Total rules applied 194 place count 416 transition count 488
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 198 place count 412 transition count 484
Iterating global reduction 2 with 4 rules applied. Total rules applied 202 place count 412 transition count 484
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 262 place count 382 transition count 454
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 269 place count 382 transition count 447
Free-agglomeration rule applied 87 times.
Iterating global reduction 3 with 87 rules applied. Total rules applied 356 place count 382 transition count 360
Reduce places removed 87 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 448 place count 295 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 449 place count 294 transition count 354
Applied a total of 449 rules in 138 ms. Remains 294 /510 variables (removed 216) and now considering 354/588 (removed 234) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/510 places, 354/588 transitions.
Finished random walk after 17046 steps, including 0 resets, run visited all 267 properties in 977 ms. (steps per millisecond=17 )
Able to resolve query StableMarking after proving 380 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 33294 ms.

BK_STOP 1678580780595

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is FlexibleBarrier-PT-06b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r192-tall-167838876700293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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