About the Execution of ITS-Tools for StigmergyElection-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1095.531 | 15351.00 | 42146.00 | 122.40 | 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.r409-tall-171690547800238.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 StigmergyElection-PT-10a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-tall-171690547800238
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50M 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 1717102739379
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-30 20:59:00] [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-30 20:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 20:59:02] [INFO ] Load time of PNML (sax parser for PT used): 1881 ms
[2024-05-30 20:59:02] [INFO ] Transformed 142 places.
[2024-05-30 20:59:02] [INFO ] Transformed 50162 transitions.
[2024-05-30 20:59:02] [INFO ] Found NUPN structural information;
[2024-05-30 20:59:02] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2258 ms.
Structural test allowed to assert that 22 places are NOT stable. Took 37 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
[2024-05-30 20:59:04] [INFO ] Flatten gal took : 729 ms
[2024-05-30 20:59:05] [INFO ] Flatten gal took : 400 ms
[2024-05-30 20:59:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16729292626862292659.gal : 216 ms
[2024-05-30 20:59:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7678514786099693072.prop : 2 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/ReachabilityCardinality16729292626862292659.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7678514786099693072.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 ...329
RANDOM walk for 40000 steps (9 resets) in 9923 ms. (4 steps per ms) remains 14/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 114 ms. (347 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
[2024-05-30 20:59:06] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
// Phase 1: matrix 2208 rows 142 cols
Loading property file /tmp/ReachabilityCardinality7678514786099693072.prop.
[2024-05-30 20:59:06] [INFO ] Computed 11 invariants in 41 ms
[2024-05-30 20:59:06] [INFO ] State equation strengthened by 2095 read => feed constraints.
SDD proceeding with computation,120 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,120 properties remain. new max is 8
SDD size :3 after 17
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 76/85 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Invariant property smplace_68 does not hold.
Invariant property smplace_54 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_12 does not hold.
SDD proceeding with computation,115 properties remain. new max is 8
SDD size :17 after 244
Invariant property smplace_82 does not hold.
SDD proceeding with computation,114 properties remain. new max is 8
SDD size :244 after 1459
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 57/142 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 57/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Invariant property smplace_96 does not hold.
SDD proceeding with computation,113 properties remain. new max is 8
SDD size :1459 after 2188
At refinement iteration 8 (OVERLAPS) 2207/2349 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Invariant property smplace_124 does not hold.
Invariant property smplace_110 does not hold.
SDD proceeding with computation,111 properties remain. new max is 8
SDD size :2188 after 19684
Invariant property smplace_138 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_102 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_74 does not hold.
Invariant property smplace_67 does not hold.
Invariant property smplace_64 does not hold.
Invariant property smplace_60 does not hold.
At refinement iteration 9 (INCLUDED_ONLY) 0/2349 variables, 2094/2389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Invariant property smplace_53 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_39 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_4 does not hold.
SDD proceeding with computation,94 properties remain. new max is 8
SDD size :19684 after 60079
Invariant property smplace_52 does not hold.
Invariant property smplace_50 does not hold.
SDD proceeding with computation,92 properties remain. new max is 8
SDD size :60079 after 60081
Invariant property smplace_38 does not hold.
Invariant property smplace_36 does not hold.
SDD proceeding with computation,90 properties remain. new max is 8
SDD size :60081 after 60083
Invariant property smplace_24 does not hold.
Invariant property smplace_22 does not hold.
SDD proceeding with computation,88 properties remain. new max is 8
SDD size :60083 after 60085
At refinement iteration 10 (INCLUDED_ONLY) 0/2349 variables, 0/2389 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Invariant property smplace_10 does not hold.
Invariant property smplace_8 does not hold.
SDD proceeding with computation,86 properties remain. new max is 8
SDD size :60085 after 60087
At refinement iteration 11 (OVERLAPS) 1/2350 variables, 1/2390 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2350 variables, 0/2390 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2350 variables, 0/2390 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 2390 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1807 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 142/142 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 65/71 variables, 5/11 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 65/76 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-30 20:59:09] [INFO ] Deduced a trap composed of 12 places in 372 ms of which 10 ms to minimize.
[2024-05-30 20:59:09] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 2 ms to minimize.
[2024-05-30 20:59:09] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 1 ms to minimize.
[2024-05-30 20:59:10] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2024-05-30 20:59:10] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2024-05-30 20:59:10] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2024-05-30 20:59:10] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-30 20:59:10] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2024-05-30 20:59:11] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 0 ms to minimize.
[2024-05-30 20:59:11] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 1 ms to minimize.
[2024-05-30 20:59:11] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 0 ms to minimize.
[2024-05-30 20:59:11] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2024-05-30 20:59:11] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2024-05-30 20:59:11] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
Invariant property smplace_119 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_77 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_49 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_21 does not hold.
Invariant property smplace_7 does not hold.
SDD proceeding with computation,77 properties remain. new max is 8
SDD size :60087 after 60598
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/96 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-30 20:59:12] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 4 ms to minimize.
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 3/99 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-30 20:59:13] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
SMT process timed out in 7288ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Graph (complete) has 501 edges and 142 vertex of which 134 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.21 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 134 transition count 2179
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 114 transition count 2149
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 112 place count 104 transition count 2149
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 112 place count 104 transition count 2132
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 146 place count 87 transition count 2132
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 163 place count 70 transition count 2115
Iterating global reduction 3 with 17 rules applied. Total rules applied 180 place count 70 transition count 2115
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 197 place count 53 transition count 2098
Iterating global reduction 3 with 17 rules applied. Total rules applied 214 place count 53 transition count 2098
Ensure Unique test removed 1028 transitions
Reduce isomorphic transitions removed 1028 transitions.
Iterating post reduction 3 with 1028 rules applied. Total rules applied 1242 place count 53 transition count 1070
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1262 place count 43 transition count 1060
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1272 place count 33 transition count 1050
Iterating global reduction 4 with 10 rules applied. Total rules applied 1282 place count 33 transition count 1050
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1284 place count 33 transition count 1048
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1286 place count 33 transition count 1048
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1287 place count 32 transition count 1047
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1288 place count 31 transition count 1047
Performed 10 Post agglomeration using F-continuation condition with reduction of 1011 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 1313 place count 16 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1323 place count 16 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1325 place count 16 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1327 place count 16 transition count 14
Applied a total of 1327 rules in 791 ms. Remains 16 /142 variables (removed 126) and now considering 14/2238 (removed 2224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 800 ms. Remains : 16/142 places, 14/2238 transitions.
RANDOM walk for 169 steps (33 resets) in 7 ms. (21 steps per ms) remains 0/6 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 121 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
Total runtime 14151 ms.
BK_STOP 1717102754730
--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../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="StigmergyElection-PT-10a"
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 StigmergyElection-PT-10a, 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 r409-tall-171690547800238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10a.tgz
mv StigmergyElection-PT-10a 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 ;