About the Execution of LTSMin+red for PolyORBNT-PT-S05J60
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2628.907 | 58144.00 | 89437.00 | 50.40 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654456000293.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J60, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654456000293
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717270266687
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:31:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:31:08] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 19:31:08] [INFO ] Transformed 909 places.
[2024-06-01 19:31:08] [INFO ] Transformed 1970 transitions.
[2024-06-01 19:31:08] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 286 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 11 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2703 resets) in 3155 ms. (12 steps per ms) remains 87/907 properties
BEST_FIRST walk for 4004 steps (50 resets) in 51 ms. (77 steps per ms) remains 86/87 properties
BEST_FIRST walk for 4002 steps (65 resets) in 35 ms. (111 steps per ms) remains 84/86 properties
BEST_FIRST walk for 4004 steps (65 resets) in 33 ms. (117 steps per ms) remains 83/84 properties
BEST_FIRST walk for 4004 steps (80 resets) in 43 ms. (91 steps per ms) remains 82/83 properties
BEST_FIRST walk for 4004 steps (34 resets) in 23 ms. (166 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (36 resets) in 23 ms. (166 steps per ms) remains 81/82 properties
BEST_FIRST walk for 4004 steps (68 resets) in 27 ms. (143 steps per ms) remains 80/81 properties
BEST_FIRST walk for 4002 steps (49 resets) in 45 ms. (87 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (58 resets) in 23 ms. (166 steps per ms) remains 79/80 properties
BEST_FIRST walk for 4004 steps (40 resets) in 24 ms. (160 steps per ms) remains 76/79 properties
BEST_FIRST walk for 4004 steps (62 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (59 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (84 resets) in 28 ms. (138 steps per ms) remains 74/76 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (58 resets) in 30 ms. (129 steps per ms) remains 71/74 properties
BEST_FIRST walk for 4004 steps (75 resets) in 32 ms. (121 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (65 resets) in 38 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (59 resets) in 56 ms. (70 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (38 resets) in 24 ms. (160 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (89 resets) in 27 ms. (142 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (76 resets) in 28 ms. (138 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (55 resets) in 37 ms. (105 steps per ms) remains 67/71 properties
BEST_FIRST walk for 4003 steps (53 resets) in 27 ms. (142 steps per ms) remains 61/67 properties
BEST_FIRST walk for 4003 steps (72 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (36 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (36 resets) in 20 ms. (190 steps per ms) remains 58/61 properties
BEST_FIRST walk for 4004 steps (47 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (64 resets) in 24 ms. (160 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4002 steps (54 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (69 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (65 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 54/57 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 50/54 properties
BEST_FIRST walk for 4004 steps (63 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (63 resets) in 24 ms. (160 steps per ms) remains 47/50 properties
BEST_FIRST walk for 4004 steps (41 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (53 resets) in 18 ms. (210 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (65 resets) in 19 ms. (200 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (68 resets) in 25 ms. (154 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (51 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (73 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (66 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (47 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (47 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 42/45 properties
BEST_FIRST walk for 4004 steps (64 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (70 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (39 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (59 resets) in 28 ms. (138 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4002 steps (50 resets) in 21 ms. (181 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
[2024-06-01 19:31:10] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-06-01 19:31:10] [INFO ] Computed 142 invariants in 85 ms
[2024-06-01 19:31:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 226/265 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 277/542 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 185/727 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 168/895 variables, 31/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 13/908 variables, 13/142 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/908 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1311/2219 variables, 908/1050 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2219 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 1/2220 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1052 constraints, problems are : Problem set: 0 solved, 39 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 226/265 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 277/542 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 185/727 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 168/895 variables, 31/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 19:31:17] [INFO ] Deduced a trap composed of 24 places in 532 ms of which 51 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 13/908 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 908/2220 variables, and 143 constraints, problems are : Problem set: 0 solved, 39 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 10219ms problems are : Problem set: 0 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 904 transition count 1261
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 113 place count 850 transition count 1261
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 113 place count 850 transition count 1208
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 219 place count 797 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 220 place count 796 transition count 1207
Iterating global reduction 2 with 1 rules applied. Total rules applied 221 place count 796 transition count 1207
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 794 transition count 1205
Applied a total of 225 rules in 355 ms. Remains 794 /909 variables (removed 115) and now considering 1205/1315 (removed 110) transitions.
Running 1199 sub problems to find dead transitions.
[2024-06-01 19:31:20] [INFO ] Flow matrix only has 1201 transitions (discarded 4 similar events)
// Phase 1: matrix 1201 rows 794 cols
[2024-06-01 19:31:20] [INFO ] Computed 137 invariants in 70 ms
[2024-06-01 19:31:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/789 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-06-01 19:31:40] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 789/1995 variables, and 133 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/794 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/789 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-06-01 19:31:47] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:31:47] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/789 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/1995 variables, and 135 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/794 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 3/3 constraints]
After SMT, in 43779ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 43805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44186 ms. Remains : 794/909 places, 1205/1315 transitions.
RANDOM walk for 29462 steps (1499 resets) in 741 ms. (39 steps per ms) remains 0/39 properties
Able to resolve query StableMarking after proving 908 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 56781 ms.
ITS solved all properties within timeout
BK_STOP 1717270324831
--------------------
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 StableMarking -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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J60, 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 r518-tajo-171654456000293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 '
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 ;