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.r522-tall-171662354100468.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 ltsminxred
Input is RefineWMG-PT-050051, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662354100468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 13 05:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 05:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 05:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 05:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 110K 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 1717224534205

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RefineWMG-PT-050051
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:48:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 06:48:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:48:55] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 06:48:55] [INFO ] Transformed 254 places.
[2024-06-01 06:48:55] [INFO ] Transformed 203 transitions.
[2024-06-01 06:48:55] [INFO ] Parsed PT model containing 254 places and 203 transitions and 608 arcs in 164 ms.
Structural test allowed to assert that 100 places are NOT stable. Took 6 ms.
RANDOM walk for 40024 steps (8 resets) in 891 ms. (44 steps per ms) remains 144/154 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 10 ms. (36 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 23 ms. (16 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 15 ms. (25 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (4 resets) in 4 ms. (80 steps per ms) remains 144/144 properties
Interrupted probabilistic random walk after 97435 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 144
Probabilistic random walk after 97435 steps, saw 92151 distinct states, run finished after 3016 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 203 rows 254 cols
[2024-06-01 06:48:58] [INFO ] Computed 102 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/148 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 100/248 variables, 148/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 106/303 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 53/356 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5152 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/148 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 100/248 variables, 148/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 106/303 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 53/356 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 144/500 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 5)
(s4 0)
(s5 1)
(s6 50)
(s7 51)
(s8 0)
(s9 0)
(s10 1)
(s11 50)
(s12 51)
(s13 0)
(s14 0)
(s15 1)
(s16 50)
(s17 51)
(s18 0)
(s19 0)
(s20 1)
(s21 50)
(s22 51)
(s23 0)
(s24 0)
(s25 1)
(s26 50)
(s27 51)
(s28 0)
(s29 0)
(s30 1)
(s31 50)
(s32 51)
(s33 0)
(s34 0)
(s35 1)
(s36 50)
(s37 51)
(s38 0)
(s39 1)
(s40 1)
(s41 50)
(s42 51)
(s43 0)
(s44 0)
(s45 1)
(s46 50)
(s47 51)
(s48 0)
(s49 0)
(s50 1)
(s51 50)
(s52 51)
(s53 0)
(s54 1)
(s55 1)
(s56 50)
(s57 51)
(s58 0)
(s59 0)
(s60 1)
(s61 50)
(s62 51)
(s63 0)
(s64 0)
(s65 1)
(s66 50)
(s67 51)
(s68 0)
(s69 0)
(s70 1)
(s71 50)
(s72 51)
(s73 0)
(s74 0)
(s75 1)
(s76 50)
(s77 51)
(s78 0)
(s79 0)
(s80 1)
(s81 50)
(s82 51)
(s83 0)
(s84 0)
(s85 1)
(s86 50)
(s87 51)
(s88 0)
(s89 1)
(s90 1)
(s91 50)
(s92 50)
(s93 1)
(s94 0)
(s95 1)
(s96 50)
(s97 51)
(s98 0)
(s99 0)
(s100 1)
(s101 50)
(s102 51)
(s103 0)
(s104 0)
(s105 1)
(s106 50)
(s107 51)
(s108 0)
(s109 0)
(s110 1)
(s111 50)
(s112 51)
(s113 0)
(s114 0)
(s115 1)
(s116 50)
(s117 51)
(s118 0)
(s119 0)
(s120 1)
(s121 50)
(s122 51)
(s123 0)
(s124 0)
(s125 1)
(s126 50)
(s127 51)
(s128 0)
(s129 0)
(s130 1)
(s131 50)
(s132 51)
(s133 0)
(s134 0)
(s135 1)
(s136 50)
(s137 51)
(s138 0)
(s139 0)
(s140 1)
(s141 50)
(s142 51)
(s143 0)
(s144 0)
(s145 1)
(s146 50)
(s147 51)
(s148 0)
(s149 0)
(s150 1)
(s151 50)
(s152 51)
(s153 0)
(s154 0)
(s155 1)
(s156 50)
(s157 51)
(s158 0)
(s159 0)
(s160 1)
(s161 50)
(s162 51)
(s163 0)
(s164 0)
(s165 1)
(s166 50)
(s167 51)
(s168 0)
(s169 0)
(s170 1)
(s171 50)
(s172 51)
(s173 0)
(s174 0)
(s175 1)
(s176 50)
(s177 51)
(s178 0)
(s179 0)
(s180 1)
(s181 50)
(s182 51)
(s183 0)
(s184 0)
(s185 1)
(s186 50)
(s187 51)
(s188 0)
(s189 0)
(s190 0)
(s191 51)
(s192 51)
(s193 0)
(s194 0)
(s195 1)
(s196 50)
(s197 51)
(s198 0)
(s199 0)
(s200 1)
(s201 50)
(s202 51)
(s203 0)
(s204 0)
(s205 1)
(s206 50)
(s207 51)
(s208 0)
(s209 0)
(s210 1)
(s211 50)
(s212 51)
(s213 0)
(s214 0)
(s215 1)
(s216 50)
(s217 51)
(s218 0)
(s219 0)
(s220 0)
(s221 51)
(s222 51)
(s223 0)
(s224 1)
(s225 1)
(s226 50)
(s227 51)
(s228 0)
(s229 1)
(s230 1)
(s231 50)
(s232 51)
(s233 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 500 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 10276ms problems are : Problem set: 0 solved, 144 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 102 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 2 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 154 transition count 103
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 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 150 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 150 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 149 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 59 place count 149 transition count 99
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 148 transition count 99
Applied a total of 61 rules in 35 ms. Remains 148 /254 variables (removed 106) and now considering 99/203 (removed 104) transitions.
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 148 cols
[2024-06-01 06:49:09] [INFO ] Computed 50 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/148 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/247 variables, 148/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 198 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2344 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/148 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/247 variables, 148/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 98/296 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 296 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2807 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5172ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5223 ms. Remains : 148/254 places, 99/203 transitions.
RANDOM walk for 2407 steps (0 resets) in 50 ms. (47 steps per ms) remains 0/144 properties
Able to resolve query StableMarking after proving 155 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 19215 ms.
ITS solved all properties within timeout

BK_STOP 1717224554586

--------------------
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 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="RefineWMG-PT-050051"
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 RefineWMG-PT-050051, 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 r522-tall-171662354100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;