About the Execution of ITS-Tools for FlexibleBarrier-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
377.703 | 13446.00 | 36888.00 | 30.30 | 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/mcc2024-input.r189-tall-171640616900018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
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 r189-tall-171640616900018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 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 1716472357286
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 13:52:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 13:52:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:52:38] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-23 13:52:38] [INFO ] Transformed 542 places.
[2024-05-23 13:52:38] [INFO ] Transformed 621 transitions.
[2024-05-23 13:52:38] [INFO ] Found NUPN structural information;
[2024-05-23 13:52:38] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 214 ms.
Graph (trivial) has 522 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 5 ms
Free SCC test removed 32 places
Structural test allowed to assert that 164 places are NOT stable. Took 32 ms.
Ensure Unique test removed 33 transitions
Reduce redundant transitions removed 33 transitions.
[2024-05-23 13:52:39] [INFO ] Flatten gal took : 220 ms
[2024-05-23 13:52:39] [INFO ] Flatten gal took : 67 ms
[2024-05-23 13:52:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7992095847507493804.gal : 81 ms
[2024-05-23 13:52:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4758050440046316064.prop : 4 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/ReachabilityCardinality7992095847507493804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4758050440046316064.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4758050440046316064.prop.
RANDOM walk for 40000 steps (993 resets) in 3385 ms. (11 steps per ms) remains 210/378 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 4 ms. (80 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 210/210 properties
SDD proceeding with computation,378 properties remain. new max is 4
SDD size :1 after 5
[2024-05-23 13:52:39] [INFO ] Flow matrix only has 583 transitions (discarded 5 similar events)
SDD proceeding with computation,378 properties remain. new max is 8
SDD size :5 after 19
// Phase 1: matrix 583 rows 510 cols
[2024-05-23 13:52:39] [INFO ] Computed 8 invariants in 22 ms
[2024-05-23 13:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,378 properties remain. new max is 16
SDD size :19 after 21
SDD proceeding with computation,378 properties remain. new max is 32
SDD size :21 after 231
SDD proceeding with computation,378 properties remain. new max is 64
SDD size :231 after 3395
SDD proceeding with computation,378 properties remain. new max is 128
SDD size :3395 after 1.52598e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 300/510 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 300/518 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1093 variables, and 518 constraints, problems are : Problem set: 0 solved, 210 unsolved in 5035 ms.
Refiners :[Domain max(s): 510/510 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/510 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 300/510 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 300/518 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-23 13:52:46] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 30 ms to minimize.
[2024-05-23 13:52:46] [INFO ] Deduced a trap composed of 209 places in 212 ms of which 4 ms to minimize.
[2024-05-23 13:52:46] [INFO ] Deduced a trap composed of 189 places in 183 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 197 places in 178 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 197 places in 169 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 194 places in 168 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 214 places in 160 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 199 places in 154 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 203 places in 136 ms of which 3 ms to minimize.
[2024-05-23 13:52:47] [INFO ] Deduced a trap composed of 190 places in 142 ms of which 3 ms to minimize.
[2024-05-23 13:52:48] [INFO ] Deduced a trap composed of 212 places in 147 ms of which 2 ms to minimize.
[2024-05-23 13:52:48] [INFO ] Deduced a trap composed of 195 places in 163 ms of which 3 ms to minimize.
[2024-05-23 13:52:48] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 2 ms to minimize.
[2024-05-23 13:52:48] [INFO ] Deduced a trap composed of 192 places in 158 ms of which 3 ms to minimize.
[2024-05-23 13:52:48] [INFO ] Deduced a trap composed of 191 places in 131 ms of which 2 ms to minimize.
[2024-05-23 13:52:48] [INFO ] Deduced a trap composed of 185 places in 137 ms of which 2 ms to minimize.
[2024-05-23 13:52:49] [INFO ] Deduced a trap composed of 183 places in 137 ms of which 3 ms to minimize.
[2024-05-23 13:52:49] [INFO ] Deduced a trap composed of 201 places in 128 ms of which 2 ms to minimize.
[2024-05-23 13:52:49] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 3 ms to minimize.
[2024-05-23 13:52:49] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/538 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-23 13:52:49] [INFO ] Deduced a trap composed of 123 places in 83 ms of which 2 ms to minimize.
[2024-05-23 13:52:49] [INFO ] Deduced a trap composed of 105 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/1093 variables, and 540 constraints, problems are : Problem set: 0 solved, 210 unsolved in 5017 ms.
Refiners :[Domain max(s): 510/510 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/510 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/210 constraints, Known Traps: 22/22 constraints]
After SMT, in 10211ms problems are : Problem set: 0 solved, 210 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 210 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 588/588 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 510 transition count 495
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 180 place count 423 transition count 495
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 180 place count 423 transition count 492
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 420 transition count 492
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 242 place count 364 transition count 436
Iterating global reduction 2 with 56 rules applied. Total rules applied 298 place count 364 transition count 436
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 309 place count 353 transition count 425
Iterating global reduction 2 with 11 rules applied. Total rules applied 320 place count 353 transition count 425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 323 place count 353 transition count 422
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 387 place count 321 transition count 390
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 321 transition count 383
Free-agglomeration rule applied 84 times.
Iterating global reduction 4 with 84 rules applied. Total rules applied 478 place count 321 transition count 299
Reduce places removed 84 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 574 place count 237 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 575 place count 236 transition count 286
Applied a total of 575 rules in 188 ms. Remains 236 /510 variables (removed 274) and now considering 286/588 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 236/510 places, 286/588 transitions.
RANDOM walk for 45414 steps (0 resets) in 665 ms. (68 steps per ms) remains 0/210 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 380 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 12287 ms.
BK_STOP 1716472370732
--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="itstools"
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 itstools"
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 r189-tall-171640616900018"
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 '
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 ;