About the Execution of 2024-gold for Philosophers-PT-000500
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266000020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Philosophers-PT-000500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000020
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 661K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 303K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 255K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 982K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 182K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 863K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.7M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 658K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.1M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Philosophers-PT-000500-UpperBounds-00
FORMULA_NAME Philosophers-PT-000500-UpperBounds-01
FORMULA_NAME Philosophers-PT-000500-UpperBounds-02
FORMULA_NAME Philosophers-PT-000500-UpperBounds-03
FORMULA_NAME Philosophers-PT-000500-UpperBounds-04
FORMULA_NAME Philosophers-PT-000500-UpperBounds-05
FORMULA_NAME Philosophers-PT-000500-UpperBounds-06
FORMULA_NAME Philosophers-PT-000500-UpperBounds-07
FORMULA_NAME Philosophers-PT-000500-UpperBounds-08
FORMULA_NAME Philosophers-PT-000500-UpperBounds-09
FORMULA_NAME Philosophers-PT-000500-UpperBounds-10
FORMULA_NAME Philosophers-PT-000500-UpperBounds-11
FORMULA_NAME Philosophers-PT-000500-UpperBounds-12
FORMULA_NAME Philosophers-PT-000500-UpperBounds-13
FORMULA_NAME Philosophers-PT-000500-UpperBounds-14
FORMULA_NAME Philosophers-PT-000500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748889411197
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 18:36:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:36:52] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2025-06-02 18:36:52] [INFO ] Transformed 2500 places.
[2025-06-02 18:36:52] [INFO ] Transformed 2500 transitions.
[2025-06-02 18:36:52] [INFO ] Found NUPN structural information;
[2025-06-02 18:36:52] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[500, 500, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0] Max Struct:[500, 500, 500, 500, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Philosophers-PT-000500-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[500, 500, 1, 1, 1, 1, 1]
// Phase 1: matrix 2500 rows 2500 cols
[2025-06-02 18:36:53] [INFO ] Computed 1000 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[500, 500, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 807 ms. (12 steps per ms)
FORMULA Philosophers-PT-000500-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000500-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000500-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000500-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000500-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 503 ms. (39 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[262, 83] Max Struct:[500, 500]
[2025-06-02 18:36:54] [INFO ] Invariant cache hit.
[2025-06-02 18:36:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 232 ms returned sat
[2025-06-02 18:36:56] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2025-06-02 18:36:56] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 133 ms.
[2025-06-02 18:36:58] [INFO ] Added : 40 causal constraints over 8 iterations in 1401 ms. Result :sat
Minimization took 1394 ms.
[2025-06-02 18:37:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 234 ms returned sat
[2025-06-02 18:37:01] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2025-06-02 18:37:01] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 129 ms.
[2025-06-02 18:37:03] [INFO ] Added : 84 causal constraints over 17 iterations in 2435 ms. Result :sat
Minimization took 674 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[262, 83] Max Struct:[500, 500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[262, 83] Max Struct:[500, 500]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 500 times.
Iterating global reduction 0 with 500 rules applied. Total rules applied 500 place count 2500 transition count 2000
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 1000 place count 2000 transition count 2000
Applied a total of 1000 rules in 488 ms. Remains 2000 /2500 variables (removed 500) and now considering 2000/2500 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 2000/2500 places, 2000/2500 transitions.
// Phase 1: matrix 2000 rows 2000 cols
[2025-06-02 18:37:04] [INFO ] Computed 1000 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[262, 83] Max Struct:[500, 500]
RANDOM walk for 362447 steps (164 resets) in 30001 ms. (12 steps per ms)
FORMULA Philosophers-PT-000500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 177017 steps (0 resets) in 5015 ms. (35 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[121] Max Struct:[500]
[2025-06-02 18:37:40] [INFO ] Invariant cache hit.
[2025-06-02 18:37:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 203 ms returned sat
[2025-06-02 18:37:41] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2025-06-02 18:37:41] [INFO ] Computed and/alt/rep : 1000/1500/1000 causal constraints (skipped 0 transitions) in 115 ms.
[2025-06-02 18:37:42] [INFO ] Added : 48 causal constraints over 10 iterations in 1265 ms. Result :sat
Minimization took 516 ms.
[2025-06-02 18:37:43] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : Max Seen:[121] Max Struct:[500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[219] Max Struct:[500]
Support contains 500 out of 2000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2000/2000 places, 2000/2000 transitions.
Free-agglomeration rule (complex) applied 500 times.
Iterating global reduction 0 with 500 rules applied. Total rules applied 500 place count 2000 transition count 1500
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1500 place count 1500 transition count 1000
Applied a total of 1500 rules in 180 ms. Remains 1500 /2000 variables (removed 500) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 1500/2000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2025-06-02 18:37:53] [INFO ] Computed 1000 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[219] Max Struct:[500]
RANDOM walk for 410185 steps (1 resets) in 30001 ms. (13 steps per ms)
BEST_FIRST walk for 169492 steps (0 resets) in 5004 ms. (33 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[222] Max Struct:[500]
[2025-06-02 18:38:28] [INFO ] Invariant cache hit.
[2025-06-02 18:38:28] [INFO ] [Real]Absence check using 1000 positive place invariants in 226 ms returned sat
[2025-06-02 18:38:29] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2025-06-02 18:38:29] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 48 ms.
[2025-06-02 18:38:29] [INFO ] Added : 0 causal constraints over 0 iterations in 152 ms. Result :sat
Minimization took 413 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[222] Max Struct:[500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[250] Max Struct:[500]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 49 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 59 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-06-02 18:38:31] [INFO ] Invariant cache hit.
[2025-06-02 18:38:32] [INFO ] Implicit Places using invariants in 1052 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 485, 486, 487, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508]
Discarding 500 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 500 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1143 ms. Remains : 1000/1500 places, 1000/1000 transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2025-06-02 18:38:32] [INFO ] Computed 500 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[250] Max Struct:[500]
RANDOM walk for 557679 steps (1 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 214972 steps (0 resets) in 5004 ms. (42 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[250] Max Struct:[500]
[2025-06-02 18:39:07] [INFO ] Invariant cache hit.
[2025-06-02 18:39:07] [INFO ] [Real]Absence check using 500 positive place invariants in 152 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[250] Max Struct:[250]
FORMULA Philosophers-PT-000500-UpperBounds-06 250 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 18:39:08] [INFO ] Flatten gal took : 170 ms
[2025-06-02 18:39:08] [INFO ] Flatten gal took : 93 ms
[2025-06-02 18:39:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10421030511375660970.gal : 91 ms
[2025-06-02 18:39:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1100680541095353465.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10421030511375660970.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1100680541095353465.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 136226 ms.
BK_STOP 1748889548865
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="Philosophers-PT-000500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Philosophers-PT-000500, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-174881266000020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000500.tgz
mv Philosophers-PT-000500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;