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.r482-tall-171624201800362.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 DBSingleClientW-PT-d2m08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201800362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-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 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717179535176

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d2m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:18:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:18:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:18:56] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-31 18:18:56] [INFO ] Transformed 4763 places.
[2024-05-31 18:18:56] [INFO ] Transformed 2478 transitions.
[2024-05-31 18:18:56] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 317 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 4763/4763 places, 2478/2478 transitions.
Reduce places removed 3626 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 3825 rules applied. Total rules applied 3825 place count 1137 transition count 2279
Applied a total of 3825 rules in 93 ms. Remains 1137 /4763 variables (removed 3626) and now considering 2279/2478 (removed 199) transitions.
// Phase 1: matrix 2279 rows 1137 cols
[2024-05-31 18:18:56] [INFO ] Computed 2 invariants in 100 ms
[2024-05-31 18:18:57] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-31 18:18:57] [INFO ] Invariant cache hit.
[2024-05-31 18:18:58] [INFO ] State equation strengthened by 1389 read => feed constraints.
[2024-05-31 18:19:11] [INFO ] Implicit Places using invariants and state equation in 13306 ms returned []
Implicit Place search using SMT with State Equation took 14300 ms to find 0 implicit places.
Running 2278 sub problems to find dead transitions.
[2024-05-31 18:19:11] [INFO ] Invariant cache hit.
[2024-05-31 18:19:11] [INFO ] State equation strengthened by 1389 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 2278/2270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 8/2270 constraints, Known Traps: 0/0 constraints]
After SMT, in 86107ms problems are : Problem set: 0 solved, 2278 unsolved
Search for dead transitions found 0 dead transitions in 86147ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1137/4763 places, 2279/2478 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 100592 ms. Remains : 1137/4763 places, 2279/2478 transitions.
Discarding 1145 transitions out of 2279. Remains 1134
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9198 resets) in 4431 ms. (9 steps per ms) remains 1058/1133 properties
BEST_FIRST walk for 124 steps (9 resets) in 16 ms. (7 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 13 ms. (8 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (9 resets) in 17 ms. (6 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (9 resets) in 27 ms. (4 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (10 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 12 ms. (9 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (11 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 120 steps (12 resets) in 14 ms. (8 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 12 ms. (9 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 14 ms. (8 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (12 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (12 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (10 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (11 resets) in 17 ms. (6 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (12 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (11 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (9 resets) in 6 ms. (17 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (11 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 124 steps (10 resets) in 11 ms. (10 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (11 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 120 steps (12 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1058/1058 properties
BEST_FIRST walk for 121 steps (11 resets) in 8 ms. (13 steps per ms) remains 1058/1058 properties
Probabilistic random walk after 30000 steps, saw 13951 distinct states, run finished after 1190 ms. (steps per millisecond=25 ) properties seen :327
[2024-05-31 18:20:40] [INFO ] Invariant cache hit.
[2024-05-31 18:20:40] [INFO ] State equation strengthened by 1389 read => feed constraints.
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 750/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 731 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 731/731 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 731 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s5 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s86 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s249 1)
(s250 1)
(s256 1)
(s258 1)
(s260 1)
(s262 1)
(s264 1)
(s266 1)
(s268 1)
(s270 1)
(s272 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s304 1)
(s305 1)
(s306 1)
(s309 1)
(s311 1)
(s314 1)
(s316 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s327 1)
(s328 1)
(s329 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s375 1)
(s377 1)
(s379 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s418 1)
(s419 1)
(s423 1)
(s424 1)
(s425 1)
(s428 1)
(s429 1)
(s433 1)
(s434 1)
(s435 1)
(s438 1)
(s439 1)
(s443 1)
(s444 1)
(s447 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 731 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 0/731 constraints, Known Traps: 0/0 constraints]
After SMT, in 16662ms problems are : Problem set: 0 solved, 731 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 750 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2279/2279 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1076 transition count 2080
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1076 transition count 2080
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 140 place count 1076 transition count 2062
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 181 place count 1035 transition count 2021
Iterating global reduction 1 with 41 rules applied. Total rules applied 222 place count 1035 transition count 2021
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 249 place count 1008 transition count 1987
Iterating global reduction 1 with 27 rules applied. Total rules applied 276 place count 1008 transition count 1987
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 297 place count 1008 transition count 1966
Applied a total of 297 rules in 414 ms. Remains 1008 /1137 variables (removed 129) and now considering 1966/2279 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 1008/1137 places, 1966/2279 transitions.
RANDOM walk for 2422044 steps (555701 resets) in 120004 ms. (20 steps per ms) remains 707/731 properties
BEST_FIRST walk for 4004 steps (170 resets) in 73 ms. (54 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (187 resets) in 65 ms. (60 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (176 resets) in 79 ms. (50 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4001 steps (169 resets) in 58 ms. (67 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (177 resets) in 64 ms. (61 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (164 resets) in 73 ms. (54 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (172 resets) in 81 ms. (48 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (164 resets) in 73 ms. (54 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (174 resets) in 82 ms. (48 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (200 resets) in 64 ms. (61 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4001 steps (171 resets) in 63 ms. (62 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (177 resets) in 64 ms. (61 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (167 resets) in 88 ms. (44 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (184 resets) in 88 ms. (44 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (167 resets) in 87 ms. (45 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4001 steps (177 resets) in 77 ms. (51 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4001 steps (175 resets) in 86 ms. (45 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (184 resets) in 55 ms. (71 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (175 resets) in 124 ms. (32 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (159 resets) in 61 ms. (64 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (179 resets) in 71 ms. (55 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (179 resets) in 81 ms. (48 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (182 resets) in 99 ms. (40 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (170 resets) in 51 ms. (76 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (199 resets) in 148 ms. (26 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (171 resets) in 109 ms. (36 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (186 resets) in 76 ms. (51 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (177 resets) in 74 ms. (53 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (179 resets) in 76 ms. (51 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (180 resets) in 73 ms. (54 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (188 resets) in 154 ms. (25 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (185 resets) in 97 ms. (40 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4001 steps (164 resets) in 83 ms. (47 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (182 resets) in 106 ms. (37 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (158 resets) in 79 ms. (50 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (162 resets) in 85 ms. (46 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (184 resets) in 97 ms. (40 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (173 resets) in 71 ms. (55 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (190 resets) in 89 ms. (44 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (187 resets) in 68 ms. (58 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (191 resets) in 68 ms. (58 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (161 resets) in 80 ms. (49 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (181 resets) in 74 ms. (53 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (159 resets) in 78 ms. (50 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (188 resets) in 75 ms. (52 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (189 resets) in 76 ms. (52 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4003 steps (171 resets) in 69 ms. (57 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (194 resets) in 75 ms. (52 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4002 steps (184 resets) in 83 ms. (47 steps per ms) remains 707/707 properties
BEST_FIRST walk for 4004 steps (194 resets) in 86 ms. (46 steps per ms) remains 707/707 properties
Probabilistic random walk after 1000001 steps, saw 395720 distinct states, run finished after 18521 ms. (steps per millisecond=53 ) properties seen :604
// Phase 1: matrix 1966 rows 1008 cols
[2024-05-31 18:21:47] [INFO ] Computed 2 invariants in 25 ms
[2024-05-31 18:21:47] [INFO ] State equation strengthened by 1160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 335/446 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 242/688 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 271 places in 300 ms of which 38 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 279 places in 247 ms of which 5 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 279 places in 259 ms of which 5 ms to minimize.
[2024-05-31 18:21:52] [INFO ] Deduced a trap composed of 279 places in 240 ms of which 5 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 280 places in 258 ms of which 5 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 280 places in 245 ms of which 5 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 271 places in 245 ms of which 4 ms to minimize.
[2024-05-31 18:21:53] [INFO ] Deduced a trap composed of 316 places in 229 ms of which 4 ms to minimize.
[2024-05-31 18:21:54] [INFO ] Deduced a trap composed of 290 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1070/1758 variables, 688/699 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 264/963 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1166/2924 variables, 295/1258 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2924 variables, 871/2129 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2924 variables, 0/2129 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 50/2974 variables, 25/2154 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2974 variables, 25/2179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2974/2974 variables, and 2179 constraints, problems are : Problem set: 0 solved, 103 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1008/1008 constraints, ReadFeed: 1160/1160 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 335/446 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 242/688 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:22:35] [INFO ] Deduced a trap composed of 309 places in 231 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1070/1758 variables, 688/700 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 264/964 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1758 variables, 11/975 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 152 places in 193 ms of which 5 ms to minimize.
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 148 places in 189 ms of which 4 ms to minimize.
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 149 places in 187 ms of which 4 ms to minimize.
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 199 places in 181 ms of which 4 ms to minimize.
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 199 places in 176 ms of which 4 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 195 places in 176 ms of which 4 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 195 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 4 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 207 places in 187 ms of which 4 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 207 places in 180 ms of which 4 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 4 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 251 places in 174 ms of which 4 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 244 places in 178 ms of which 4 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 245 places in 180 ms of which 3 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 239 places in 173 ms of which 5 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 243 places in 175 ms of which 4 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 244 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 218 places in 176 ms of which 4 ms to minimize.
[2024-05-31 18:22:46] [INFO ] Deduced a trap composed of 261 places in 169 ms of which 4 ms to minimize.
[2024-05-31 18:22:47] [INFO ] Deduced a trap composed of 257 places in 168 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1758 variables, 20/995 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:22:52] [INFO ] Deduced a trap composed of 194 places in 180 ms of which 4 ms to minimize.
[2024-05-31 18:22:52] [INFO ] Deduced a trap composed of 194 places in 173 ms of which 4 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 242 places in 190 ms of which 5 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 243 places in 170 ms of which 4 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 7 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 216 places in 188 ms of which 4 ms to minimize.
[2024-05-31 18:22:53] [INFO ] Deduced a trap composed of 217 places in 188 ms of which 5 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 216 places in 188 ms of which 4 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 217 places in 183 ms of which 4 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 263 places in 165 ms of which 6 ms to minimize.
[2024-05-31 18:22:54] [INFO ] Deduced a trap composed of 240 places in 170 ms of which 5 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 4 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 203 places in 191 ms of which 4 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 247 places in 169 ms of which 4 ms to minimize.
[2024-05-31 18:22:55] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 3 ms to minimize.
[2024-05-31 18:22:56] [INFO ] Deduced a trap composed of 208 places in 180 ms of which 4 ms to minimize.
[2024-05-31 18:22:56] [INFO ] Deduced a trap composed of 252 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:22:56] [INFO ] Deduced a trap composed of 245 places in 183 ms of which 4 ms to minimize.
[2024-05-31 18:22:57] [INFO ] Deduced a trap composed of 199 places in 196 ms of which 4 ms to minimize.
[2024-05-31 18:22:57] [INFO ] Deduced a trap composed of 200 places in 200 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1758 variables, 20/1015 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-31 18:23:02] [INFO ] Deduced a trap composed of 217 places in 176 ms of which 5 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 214 places in 201 ms of which 4 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 219 places in 169 ms of which 4 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 259 places in 171 ms of which 4 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 261 places in 165 ms of which 4 ms to minimize.
[2024-05-31 18:23:03] [INFO ] Deduced a trap composed of 262 places in 164 ms of which 4 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 217 places in 184 ms of which 10 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 4 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 259 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:23:04] [INFO ] Deduced a trap composed of 264 places in 179 ms of which 4 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 264 places in 180 ms of which 4 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 262 places in 183 ms of which 4 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 219 places in 193 ms of which 4 ms to minimize.
[2024-05-31 18:23:05] [INFO ] Deduced a trap composed of 218 places in 186 ms of which 5 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 219 places in 194 ms of which 5 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 176 places in 183 ms of which 4 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 224 places in 177 ms of which 4 ms to minimize.
[2024-05-31 18:23:06] [INFO ] Deduced a trap composed of 224 places in 171 ms of which 4 ms to minimize.
[2024-05-31 18:23:07] [INFO ] Deduced a trap composed of 271 places in 161 ms of which 4 ms to minimize.
[2024-05-31 18:23:07] [INFO ] Deduced a trap composed of 157 places in 190 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1758 variables, 20/1035 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1758 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 103 unsolved
SMT process timed out in 90901ms, After SMT, problems are : Problem set: 0 solved, 103 unsolved
Fused 103 Parikh solutions to 86 different solutions.
Parikh walk visited 0 properties in 1549 ms.
Support contains 111 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 1966/1966 transitions.
Graph (complete) has 3634 edges and 1008 vertex of which 1007 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 1007 transition count 1949
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 299 place count 726 transition count 1170
Iterating global reduction 1 with 281 rules applied. Total rules applied 580 place count 726 transition count 1170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 588 place count 726 transition count 1162
Discarding 226 places :
Symmetric choice reduction at 2 with 226 rule applications. Total rules 814 place count 500 transition count 936
Iterating global reduction 2 with 226 rules applied. Total rules applied 1040 place count 500 transition count 936
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1052 place count 500 transition count 924
Discarding 177 places :
Symmetric choice reduction at 3 with 177 rule applications. Total rules 1229 place count 323 transition count 672
Iterating global reduction 3 with 177 rules applied. Total rules applied 1406 place count 323 transition count 672
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 1574 place count 323 transition count 504
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1594 place count 303 transition count 473
Iterating global reduction 4 with 20 rules applied. Total rules applied 1614 place count 303 transition count 473
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1620 place count 303 transition count 467
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1632 place count 291 transition count 455
Iterating global reduction 5 with 12 rules applied. Total rules applied 1644 place count 291 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1645 place count 291 transition count 454
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1656 place count 280 transition count 443
Iterating global reduction 6 with 11 rules applied. Total rules applied 1667 place count 280 transition count 443
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1680 place count 280 transition count 430
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1684 place count 276 transition count 404
Iterating global reduction 7 with 4 rules applied. Total rules applied 1688 place count 276 transition count 404
Applied a total of 1688 rules in 117 ms. Remains 276 /1008 variables (removed 732) and now considering 404/1966 (removed 1562) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 276/1008 places, 404/1966 transitions.
RANDOM walk for 4000000 steps (919553 resets) in 37236 ms. (107 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1715 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1776 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 101 ms. (392 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1819 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1699 resets) in 99 ms. (400 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1802 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1822 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1794 resets) in 105 ms. (377 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1750 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1745 resets) in 100 ms. (396 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1766 resets) in 100 ms. (396 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1778 resets) in 105 ms. (377 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1784 resets) in 104 ms. (380 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1774 resets) in 103 ms. (384 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1811 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1742 resets) in 104 ms. (380 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1737 resets) in 100 ms. (396 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1753 resets) in 100 ms. (396 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1805 resets) in 103 ms. (384 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1806 resets) in 105 ms. (377 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1783 resets) in 101 ms. (392 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1749 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 108 ms. (367 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1745 resets) in 104 ms. (380 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 110 ms. (360 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1779 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1827 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (1833 resets) in 109 ms. (363 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1827 resets) in 105 ms. (377 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1707 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1742 resets) in 103 ms. (384 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1827 resets) in 104 ms. (380 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1809 resets) in 103 ms. (384 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1814 resets) in 108 ms. (367 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1801 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1780 resets) in 108 ms. (367 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1843 resets) in 108 ms. (367 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1744 resets) in 102 ms. (388 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1844 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (1769 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1781 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1807 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1773 resets) in 105 ms. (377 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1811 resets) in 106 ms. (373 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1770 resets) in 105 ms. (377 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1802 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 111 ms. (357 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1815 resets) in 107 ms. (370 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (3926 resets) in 156 ms. (254 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (3702 resets) in 153 ms. (259 steps per ms) remains 103/103 properties
Finished probabilistic random walk after 342472 steps, run visited all 103 properties in 3496 ms. (steps per millisecond=97 )
Probabilistic random walk after 342472 steps, saw 138423 distinct states, run finished after 3505 ms. (steps per millisecond=97 ) properties seen :103
Able to resolve query QuasiLiveness after proving 1134 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 279596 ms.
ITS solved all properties within timeout

BK_STOP 1717179815982

--------------------
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 QuasiLiveness -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="DBSingleClientW-PT-d2m08"
export BK_EXAMINATION="QuasiLiveness"
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 DBSingleClientW-PT-d2m08, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r482-tall-171624201800362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m08.tgz
mv DBSingleClientW-PT-d2m08 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;