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-171654455700158.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 PolyORBLF-PT-S02J06T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K 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 1717269620556

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:20:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:20:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:20:22] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-06-01 19:20:22] [INFO ] Transformed 690 places.
[2024-06-01 19:20:22] [INFO ] Transformed 1434 transitions.
[2024-06-01 19:20:22] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 391 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (15 resets) in 3397 ms. (11 steps per ms) remains 18/690 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
[2024-06-01 19:20:24] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 19:20:24] [INFO ] Computed 54 invariants in 103 ms
[2024-06-01 19:20:24] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/628 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 59/687 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/688 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1290/1978 variables, 688/741 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1978 variables, 96/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1978 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/1980 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1980 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 840 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:20:31] [INFO ] Deduced a trap composed of 369 places in 458 ms of which 46 ms to minimize.
[2024-06-01 19:20:31] [INFO ] Deduced a trap composed of 484 places in 348 ms of which 6 ms to minimize.
[2024-06-01 19:20:32] [INFO ] Deduced a trap composed of 476 places in 886 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:20:33] [INFO ] Deduced a trap composed of 348 places in 232 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:20:34] [INFO ] Deduced a trap composed of 348 places in 204 ms of which 3 ms to minimize.
[2024-06-01 19:20:34] [INFO ] Deduced a trap composed of 348 places in 238 ms of which 5 ms to minimize.
SMT process timed out in 10428ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 450 place count 472 transition count 1074
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 466 place count 456 transition count 1074
Applied a total of 466 rules in 208 ms. Remains 456 /690 variables (removed 234) and now considering 1074/1306 (removed 232) transitions.
Running 1072 sub problems to find dead transitions.
[2024-06-01 19:20:34] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 456 cols
[2024-06-01 19:20:34] [INFO ] Computed 52 invariants in 33 ms
[2024-06-01 19:20:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 19:20:45] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:20:45] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:20:45] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:20:45] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:20:45] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:20:47] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:20:47] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 2 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:20:52] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 2 ms to minimize.
[2024-06-01 19:20:52] [INFO ] Deduced a trap composed of 150 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 8.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 8.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 2.0)
(s52 2.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 2.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 2.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 2.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 9.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1514 variables, and 60 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 19:20:59] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:20:59] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:21:00] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:21:00] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:21:00] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:21:00] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:21:01] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1514 variables, and 68 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 19/19 constraints]
After SMT, in 42841ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43088 ms. Remains : 456/690 places, 1074/1306 transitions.
RANDOM walk for 4000000 steps (1791 resets) in 49328 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (63 resets) in 1948 ms. (205 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (70 resets) in 2382 ms. (167 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (71 resets) in 1928 ms. (207 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (71 resets) in 2490 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (66 resets) in 2036 ms. (196 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (84 resets) in 2509 ms. (159 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (56 resets) in 1836 ms. (217 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (77 resets) in 1577 ms. (253 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (74 resets) in 2199 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (70 resets) in 1664 ms. (240 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (66 resets) in 2657 ms. (150 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (67 resets) in 1771 ms. (225 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (67 resets) in 2697 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (52 resets) in 2310 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (59 resets) in 1976 ms. (202 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (70 resets) in 2387 ms. (167 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (64 resets) in 1595 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (65 resets) in 2145 ms. (186 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 2475800 steps, run timeout after 87001 ms. (steps per millisecond=28 ) properties seen :0 out of 18
Probabilistic random walk after 2475800 steps, saw 1394881 distinct states, run finished after 87015 ms. (steps per millisecond=28 ) properties seen :0
[2024-06-01 19:23:14] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 19:23:14] [INFO ] Invariant cache hit.
[2024-06-01 19:23:14] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1058/1512 variables, 454/505 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1512 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1512 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/1514 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1514 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 604 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 45 places in 427 ms of which 1 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 2 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 2 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 2 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:23:19] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-06-01 19:23:19] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 6 ms to minimize.
[2024-06-01 19:23:19] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 3 ms to minimize.
[2024-06-01 19:23:19] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 194 places in 257 ms of which 3 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 199 places in 246 ms of which 3 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 152 places in 263 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1058/1512 variables, 454/520 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1512 variables, 96/616 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem smplace_98 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 35480ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 3066 ms.
Support contains 18 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 27 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 456/456 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 27 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-06-01 19:23:52] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 19:23:52] [INFO ] Invariant cache hit.
[2024-06-01 19:23:53] [INFO ] Implicit Places using invariants in 786 ms returned [43, 116, 194, 231, 308, 324, 381, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 808 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/456 places, 1074/1074 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 1070
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 1070
Applied a total of 8 rules in 63 ms. Remains 444 /448 variables (removed 4) and now considering 1070/1074 (removed 4) transitions.
[2024-06-01 19:23:53] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
// Phase 1: matrix 1054 rows 444 cols
[2024-06-01 19:23:53] [INFO ] Computed 44 invariants in 35 ms
[2024-06-01 19:23:54] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-06-01 19:23:54] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-06-01 19:23:54] [INFO ] Invariant cache hit.
[2024-06-01 19:23:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 19:24:02] [INFO ] Implicit Places using invariants and state equation in 7974 ms returned []
Implicit Place search using SMT with State Equation took 8836 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 444/456 places, 1070/1074 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9748 ms. Remains : 444/456 places, 1070/1074 transitions.
Total runtime 220653 ms.
ITS solved all properties within timeout

BK_STOP 1717269842796

--------------------
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="PolyORBLF-PT-S02J06T08"
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 PolyORBLF-PT-S02J06T08, 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-171654455700158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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 ;