About the Execution of 2024-gold for PolyORBLF-PT-S04J04T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15689.710 | 116273.00 | 168630.00 | 465.50 | F | normal |
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.r168-tall-174881266800297.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 PolyORBLF-PT-S04J04T10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266800297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 32K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 415K 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 19K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 467K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748900012088
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:33:33] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2025-06-02 21:33:33] [INFO ] Transformed 870 places.
[2025-06-02 21:33:33] [INFO ] Transformed 5034 transitions.
[2025-06-02 21:33:33] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 452 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 870/870 places, 5034/5034 transitions.
Ensure Unique test removed 4 places
Ensure Unique test removed 2710 transitions
Reduce isomorphic transitions removed 2710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 2804 rules applied. Total rules applied 2804 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 2894 place count 776 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 2894 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 10 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 3094 place count 676 transition count 2134
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 3294 place count 576 transition count 2034
Applied a total of 3294 rules in 192 ms. Remains 576 /870 variables (removed 294) and now considering 2034/5034 (removed 3000) transitions.
Running 2030 sub problems to find dead transitions.
[2025-06-02 21:33:34] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 576 cols
[2025-06-02 21:33:34] [INFO ] Computed 54 invariants in 120 ms
[2025-06-02 21:33:34] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2570 variables, and 49 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2025-06-02 21:34:10] [INFO ] Deduced a trap composed of 47 places in 394 ms of which 30 ms to minimize.
[2025-06-02 21:34:10] [INFO ] Deduced a trap composed of 46 places in 345 ms of which 3 ms to minimize.
[2025-06-02 21:34:11] [INFO ] Deduced a trap composed of 46 places in 425 ms of which 18 ms to minimize.
[2025-06-02 21:34:11] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 3 ms to minimize.
[2025-06-02 21:34:11] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2025-06-02 21:34:11] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2025-06-02 21:34:12] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2025-06-02 21:34:12] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2025-06-02 21:34:12] [INFO ] Deduced a trap composed of 206 places in 366 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2570 variables, and 58 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 9/9 constraints]
After SMT, in 51267ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 51321ms
[2025-06-02 21:34:25] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2025-06-02 21:34:25] [INFO ] Invariant cache hit.
[2025-06-02 21:34:26] [INFO ] Implicit Places using invariants in 807 ms returned [108, 183, 232, 233, 257, 331, 348, 412, 476, 570]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 821 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 566/870 places, 2034/5034 transitions.
Applied a total of 0 rules in 13 ms. Remains 566 /566 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 52409 ms. Remains : 566/870 places, 2034/5034 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (9 resets) in 5498 ms. (7 steps per ms) remains 572/2030 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
[2025-06-02 21:34:27] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 566 cols
[2025-06-02 21:34:28] [INFO ] Computed 44 invariants in 62 ms
[2025-06-02 21:34:28] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Problem qltransition_0 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 8548ms, After SMT, problems are : Problem set: 0 solved, 572 unsolved
Fused 572 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 2034/2034 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 560 transition count 2028
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 560 transition count 2028
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 560 transition count 2018
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 550 transition count 2018
Applied a total of 32 rules in 241 ms. Remains 550 /566 variables (removed 16) and now considering 2018/2034 (removed 16) transitions.
Running 2014 sub problems to find dead transitions.
[2025-06-02 21:34:36] [INFO ] Flow matrix only has 1978 transitions (discarded 40 similar events)
// Phase 1: matrix 1978 rows 550 cols
[2025-06-02 21:34:36] [INFO ] Computed 44 invariants in 45 ms
[2025-06-02 21:34:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2014 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2014 unsolved
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 1 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 0 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:35:07] [INFO ] Deduced a trap composed of 45 places in 367 ms of which 4 ms to minimize.
[2025-06-02 21:35:07] [INFO ] Deduced a trap composed of 213 places in 321 ms of which 4 ms to minimize.
[2025-06-02 21:35:08] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 4 ms to minimize.
[2025-06-02 21:35:08] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/2528 variables, and 51 constraints, problems are : Problem set: 0 solved, 2014 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/550 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2014/2014 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2014 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2014 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2014 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2014 unsolved
[2025-06-02 21:35:21] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2025-06-02 21:35:21] [INFO ] Deduced a trap composed of 280 places in 355 ms of which 4 ms to minimize.
[2025-06-02 21:35:22] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 3 ms to minimize.
[2025-06-02 21:35:22] [INFO ] Deduced a trap composed of 215 places in 254 ms of which 2 ms to minimize.
[2025-06-02 21:35:24] [INFO ] Deduced a trap composed of 245 places in 384 ms of which 3 ms to minimize.
[2025-06-02 21:35:24] [INFO ] Deduced a trap composed of 249 places in 417 ms of which 3 ms to minimize.
[2025-06-02 21:35:25] [INFO ] Deduced a trap composed of 198 places in 367 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/2528 variables, and 58 constraints, problems are : Problem set: 0 solved, 2014 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/550 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2014 constraints, Known Traps: 18/18 constraints]
After SMT, in 51481ms problems are : Problem set: 0 solved, 2014 unsolved
Search for dead transitions found 0 dead transitions in 51504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51752 ms. Remains : 550/566 places, 2018/2034 transitions.
Total runtime 114973 ms.
ITS solved all properties within timeout
BK_STOP 1748900128361
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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="PolyORBLF-PT-S04J04T10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S04J04T10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266800297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;