About the Execution of GreatSPN+red for DBSingleClientW-PT-d2m09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11563.779 | 278456.00 | 491885.00 | 567.90 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r100-tall-171624200800367.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 greatspnxred
Input is DBSingleClientW-PT-d2m09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200800367
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K 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.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:51 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 1716365510147
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:11:51] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-22 08:11:51] [INFO ] Transformed 4763 places.
[2024-05-22 08:11:51] [INFO ] Transformed 2478 transitions.
[2024-05-22 08:11:51] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 323 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 94 ms. Remains 1137 /4763 variables (removed 3626) and now considering 2279/2478 (removed 199) transitions.
// Phase 1: matrix 2279 rows 1137 cols
[2024-05-22 08:11:51] [INFO ] Computed 2 invariants in 81 ms
[2024-05-22 08:11:52] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-05-22 08:11:52] [INFO ] Invariant cache hit.
[2024-05-22 08:11:53] [INFO ] State equation strengthened by 1389 read => feed constraints.
[2024-05-22 08:12:07] [INFO ] Implicit Places using invariants and state equation in 14650 ms returned []
Implicit Place search using SMT with State Equation took 15651 ms to find 0 implicit places.
Running 2278 sub problems to find dead transitions.
[2024-05-22 08:12:07] [INFO ] Invariant cache hit.
[2024-05-22 08:12:07] [INFO ] State equation strengthened by 1389 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30062 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
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 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)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 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)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 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)
(s211 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)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 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)
(s349 1)
(s350 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)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 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)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 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 1)
(s480 1)
(s481 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30043 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 87312ms problems are : Problem set: 0 solved, 2278 unsolved
Search for dead transitions found 0 dead transitions in 87361ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1137/4763 places, 2279/2478 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 103149 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 (9072 resets) in 6278 ms. (6 steps per ms) remains 1052/1133 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (12 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 12 ms. (9 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 25 ms. (4 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 13 ms. (8 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 13 ms. (8 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 21 ms. (5 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 11 ms. (10 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 13 ms. (8 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 120 steps (12 resets) in 10 ms. (10 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (10 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (10 resets) in 12 ms. (9 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (11 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (10 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 124 steps (9 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 16 ms. (7 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 122 steps (11 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 123 steps (11 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
BEST_FIRST walk for 121 steps (11 resets) in 8 ms. (13 steps per ms) remains 1052/1052 properties
Probabilistic random walk after 30000 steps, saw 13940 distinct states, run finished after 1046 ms. (steps per millisecond=28 ) properties seen :324
[2024-05-22 08:13:38] [INFO ] Invariant cache hit.
[2024-05-22 08:13:38] [INFO ] State equation strengthened by 1389 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 747/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 728 unsolved in 5022 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: 728/728 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 728 unsolved in 5016 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/728 constraints, Known Traps: 0/0 constraints]
After SMT, in 16564ms problems are : Problem set: 0 solved, 728 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 747 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2279/2279 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1077 transition count 2081
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1077 transition count 2081
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 138 place count 1077 transition count 2063
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 178 place count 1037 transition count 2023
Iterating global reduction 1 with 40 rules applied. Total rules applied 218 place count 1037 transition count 2023
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 245 place count 1010 transition count 1989
Iterating global reduction 1 with 27 rules applied. Total rules applied 272 place count 1010 transition count 1989
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 293 place count 1010 transition count 1968
Applied a total of 293 rules in 460 ms. Remains 1010 /1137 variables (removed 127) and now considering 1968/2279 (removed 311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 1010/1137 places, 1968/2279 transitions.
RANDOM walk for 2910314 steps (667797 resets) in 120004 ms. (24 steps per ms) remains 703/728 properties
BEST_FIRST walk for 4001 steps (176 resets) in 69 ms. (57 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (185 resets) in 59 ms. (66 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (167 resets) in 55 ms. (71 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (181 resets) in 51 ms. (76 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (172 resets) in 49 ms. (80 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (180 resets) in 51 ms. (76 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (171 resets) in 52 ms. (75 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (185 resets) in 53 ms. (74 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (199 resets) in 57 ms. (69 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (168 resets) in 53 ms. (74 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (180 resets) in 52 ms. (75 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (169 resets) in 50 ms. (78 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (166 resets) in 86 ms. (46 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (171 resets) in 59 ms. (66 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (205 resets) in 77 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (162 resets) in 81 ms. (48 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (181 resets) in 66 ms. (59 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (172 resets) in 62 ms. (63 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (183 resets) in 75 ms. (52 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (171 resets) in 83 ms. (47 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (181 resets) in 80 ms. (49 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (185 resets) in 75 ms. (52 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (160 resets) in 67 ms. (58 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (143 resets) in 55 ms. (71 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (170 resets) in 76 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (170 resets) in 66 ms. (59 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4001 steps (177 resets) in 71 ms. (55 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (168 resets) in 53 ms. (74 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (149 resets) in 59 ms. (66 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (186 resets) in 70 ms. (56 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (172 resets) in 76 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (169 resets) in 69 ms. (57 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (183 resets) in 77 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (162 resets) in 65 ms. (60 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (199 resets) in 80 ms. (49 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (155 resets) in 73 ms. (54 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (185 resets) in 68 ms. (58 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (189 resets) in 77 ms. (51 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (202 resets) in 69 ms. (57 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (185 resets) in 85 ms. (46 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4004 steps (183 resets) in 75 ms. (52 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (193 resets) in 70 ms. (56 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (156 resets) in 71 ms. (55 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (186 resets) in 78 ms. (50 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (172 resets) in 70 ms. (56 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (196 resets) in 67 ms. (58 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (189 resets) in 85 ms. (46 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (195 resets) in 81 ms. (48 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4003 steps (179 resets) in 50 ms. (78 steps per ms) remains 703/703 properties
BEST_FIRST walk for 4002 steps (178 resets) in 62 ms. (63 steps per ms) remains 703/703 properties
Probabilistic random walk after 1000001 steps, saw 395873 distinct states, run finished after 16399 ms. (steps per millisecond=60 ) properties seen :595
// Phase 1: matrix 1968 rows 1010 cols
[2024-05-22 08:14:42] [INFO ] Computed 2 invariants in 36 ms
[2024-05-22 08:14:42] [INFO ] State equation strengthened by 1161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 334/450 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 242/692 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:14:47] [INFO ] Deduced a trap composed of 263 places in 304 ms of which 39 ms to minimize.
[2024-05-22 08:14:47] [INFO ] Deduced a trap composed of 275 places in 262 ms of which 5 ms to minimize.
[2024-05-22 08:14:47] [INFO ] Deduced a trap composed of 274 places in 255 ms of which 6 ms to minimize.
[2024-05-22 08:14:48] [INFO ] Deduced a trap composed of 312 places in 226 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1080/1772 variables, 692/698 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1772 variables, 273/971 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1772 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1156/2928 variables, 293/1264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2928 variables, 863/2127 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2928 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 50/2978 variables, 25/2152 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2978 variables, 25/2177 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2978/2978 variables, and 2177 constraints, problems are : Problem set: 0 solved, 108 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, ReadFeed: 1161/1161 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 334/450 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 242/692 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:15:31] [INFO ] Deduced a trap composed of 284 places in 225 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1080/1772 variables, 692/699 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1772 variables, 273/972 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1772 variables, 11/983 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:15:39] [INFO ] Deduced a trap composed of 206 places in 202 ms of which 5 ms to minimize.
[2024-05-22 08:15:39] [INFO ] Deduced a trap composed of 253 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:15:39] [INFO ] Deduced a trap composed of 254 places in 173 ms of which 4 ms to minimize.
[2024-05-22 08:15:39] [INFO ] Deduced a trap composed of 257 places in 177 ms of which 4 ms to minimize.
[2024-05-22 08:15:39] [INFO ] Deduced a trap composed of 253 places in 172 ms of which 4 ms to minimize.
[2024-05-22 08:15:40] [INFO ] Deduced a trap composed of 207 places in 186 ms of which 4 ms to minimize.
[2024-05-22 08:15:40] [INFO ] Deduced a trap composed of 208 places in 185 ms of which 3 ms to minimize.
[2024-05-22 08:15:40] [INFO ] Deduced a trap composed of 253 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:15:40] [INFO ] Deduced a trap composed of 227 places in 178 ms of which 3 ms to minimize.
[2024-05-22 08:15:41] [INFO ] Deduced a trap composed of 253 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:15:41] [INFO ] Deduced a trap composed of 254 places in 164 ms of which 4 ms to minimize.
[2024-05-22 08:15:41] [INFO ] Deduced a trap composed of 298 places in 158 ms of which 4 ms to minimize.
[2024-05-22 08:15:41] [INFO ] Deduced a trap composed of 228 places in 179 ms of which 4 ms to minimize.
[2024-05-22 08:15:41] [INFO ] Deduced a trap composed of 272 places in 173 ms of which 4 ms to minimize.
[2024-05-22 08:15:42] [INFO ] Deduced a trap composed of 272 places in 161 ms of which 4 ms to minimize.
[2024-05-22 08:15:42] [INFO ] Deduced a trap composed of 320 places in 157 ms of which 4 ms to minimize.
[2024-05-22 08:15:42] [INFO ] Deduced a trap composed of 316 places in 152 ms of which 4 ms to minimize.
[2024-05-22 08:15:42] [INFO ] Deduced a trap composed of 253 places in 158 ms of which 4 ms to minimize.
[2024-05-22 08:15:42] [INFO ] Deduced a trap composed of 301 places in 171 ms of which 4 ms to minimize.
[2024-05-22 08:15:42] [INFO ] Deduced a trap composed of 297 places in 169 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1772 variables, 20/1003 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:15:48] [INFO ] Deduced a trap composed of 216 places in 181 ms of which 4 ms to minimize.
[2024-05-22 08:15:48] [INFO ] Deduced a trap composed of 261 places in 175 ms of which 4 ms to minimize.
[2024-05-22 08:15:49] [INFO ] Deduced a trap composed of 266 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:15:49] [INFO ] Deduced a trap composed of 305 places in 159 ms of which 4 ms to minimize.
[2024-05-22 08:15:49] [INFO ] Deduced a trap composed of 299 places in 162 ms of which 4 ms to minimize.
[2024-05-22 08:15:49] [INFO ] Deduced a trap composed of 298 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:15:50] [INFO ] Deduced a trap composed of 227 places in 165 ms of which 4 ms to minimize.
[2024-05-22 08:15:50] [INFO ] Deduced a trap composed of 275 places in 169 ms of which 4 ms to minimize.
[2024-05-22 08:15:50] [INFO ] Deduced a trap composed of 271 places in 172 ms of which 4 ms to minimize.
[2024-05-22 08:15:50] [INFO ] Deduced a trap composed of 275 places in 178 ms of which 6 ms to minimize.
[2024-05-22 08:15:50] [INFO ] Deduced a trap composed of 271 places in 170 ms of which 4 ms to minimize.
[2024-05-22 08:15:51] [INFO ] Deduced a trap composed of 317 places in 164 ms of which 4 ms to minimize.
[2024-05-22 08:15:51] [INFO ] Deduced a trap composed of 220 places in 195 ms of which 4 ms to minimize.
[2024-05-22 08:15:51] [INFO ] Deduced a trap composed of 231 places in 182 ms of which 4 ms to minimize.
[2024-05-22 08:15:51] [INFO ] Deduced a trap composed of 227 places in 187 ms of which 4 ms to minimize.
[2024-05-22 08:15:52] [INFO ] Deduced a trap composed of 268 places in 174 ms of which 3 ms to minimize.
[2024-05-22 08:15:52] [INFO ] Deduced a trap composed of 273 places in 171 ms of which 4 ms to minimize.
[2024-05-22 08:15:52] [INFO ] Deduced a trap composed of 268 places in 167 ms of which 4 ms to minimize.
[2024-05-22 08:15:52] [INFO ] Deduced a trap composed of 273 places in 168 ms of which 4 ms to minimize.
[2024-05-22 08:15:52] [INFO ] Deduced a trap composed of 318 places in 162 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1772 variables, 20/1023 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:15:59] [INFO ] Deduced a trap composed of 235 places in 178 ms of which 4 ms to minimize.
[2024-05-22 08:15:59] [INFO ] Deduced a trap composed of 283 places in 168 ms of which 4 ms to minimize.
[2024-05-22 08:15:59] [INFO ] Deduced a trap composed of 279 places in 172 ms of which 4 ms to minimize.
[2024-05-22 08:15:59] [INFO ] Deduced a trap composed of 283 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:15:59] [INFO ] Deduced a trap composed of 279 places in 166 ms of which 4 ms to minimize.
[2024-05-22 08:16:00] [INFO ] Deduced a trap composed of 325 places in 150 ms of which 5 ms to minimize.
[2024-05-22 08:16:00] [INFO ] Deduced a trap composed of 320 places in 161 ms of which 4 ms to minimize.
[2024-05-22 08:16:00] [INFO ] Deduced a trap composed of 318 places in 157 ms of which 4 ms to minimize.
[2024-05-22 08:16:00] [INFO ] Deduced a trap composed of 316 places in 152 ms of which 4 ms to minimize.
[2024-05-22 08:16:00] [INFO ] Deduced a trap composed of 318 places in 155 ms of which 4 ms to minimize.
[2024-05-22 08:16:01] [INFO ] Deduced a trap composed of 315 places in 161 ms of which 4 ms to minimize.
[2024-05-22 08:16:01] [INFO ] Deduced a trap composed of 316 places in 168 ms of which 4 ms to minimize.
[2024-05-22 08:16:01] [INFO ] Deduced a trap composed of 228 places in 179 ms of which 4 ms to minimize.
[2024-05-22 08:16:02] [INFO ] Deduced a trap composed of 228 places in 178 ms of which 4 ms to minimize.
[2024-05-22 08:16:02] [INFO ] Deduced a trap composed of 277 places in 162 ms of which 4 ms to minimize.
[2024-05-22 08:16:02] [INFO ] Deduced a trap composed of 283 places in 161 ms of which 4 ms to minimize.
[2024-05-22 08:16:02] [INFO ] Deduced a trap composed of 255 places in 179 ms of which 4 ms to minimize.
[2024-05-22 08:16:02] [INFO ] Deduced a trap composed of 255 places in 158 ms of which 4 ms to minimize.
[2024-05-22 08:16:03] [INFO ] Deduced a trap composed of 276 places in 156 ms of which 5 ms to minimize.
[2024-05-22 08:16:03] [INFO ] Deduced a trap composed of 279 places in 165 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1772 variables, 20/1043 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:16:10] [INFO ] Deduced a trap composed of 317 places in 171 ms of which 4 ms to minimize.
[2024-05-22 08:16:10] [INFO ] Deduced a trap composed of 310 places in 189 ms of which 4 ms to minimize.
[2024-05-22 08:16:10] [INFO ] Deduced a trap composed of 311 places in 170 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1772 variables, 3/1046 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1772/2978 variables, and 1046 constraints, problems are : Problem set: 0 solved, 108 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 692/1010 constraints, ReadFeed: 273/1161 constraints, PredecessorRefiner: 11/108 constraints, Known Traps: 68/68 constraints]
After SMT, in 90821ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1968/1968 transitions.
Graph (complete) has 3639 edges and 1010 vertex of which 1009 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 1009 transition count 1951
Discarding 280 places :
Symmetric choice reduction at 1 with 280 rule applications. Total rules 298 place count 729 transition count 1179
Iterating global reduction 1 with 280 rules applied. Total rules applied 578 place count 729 transition count 1179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 586 place count 729 transition count 1171
Discarding 225 places :
Symmetric choice reduction at 2 with 225 rule applications. Total rules 811 place count 504 transition count 946
Iterating global reduction 2 with 225 rules applied. Total rules applied 1036 place count 504 transition count 946
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1048 place count 504 transition count 934
Discarding 175 places :
Symmetric choice reduction at 3 with 175 rule applications. Total rules 1223 place count 329 transition count 684
Iterating global reduction 3 with 175 rules applied. Total rules applied 1398 place count 329 transition count 684
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 1566 place count 329 transition count 516
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1585 place count 310 transition count 490
Iterating global reduction 4 with 19 rules applied. Total rules applied 1604 place count 310 transition count 490
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1610 place count 310 transition count 484
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1621 place count 299 transition count 473
Iterating global reduction 5 with 11 rules applied. Total rules applied 1632 place count 299 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1633 place count 299 transition count 472
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1643 place count 289 transition count 462
Iterating global reduction 6 with 10 rules applied. Total rules applied 1653 place count 289 transition count 462
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1666 place count 289 transition count 449
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1670 place count 285 transition count 423
Iterating global reduction 7 with 4 rules applied. Total rules applied 1674 place count 285 transition count 423
Applied a total of 1674 rules in 144 ms. Remains 285 /1010 variables (removed 725) and now considering 423/1968 (removed 1545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 285/1010 places, 423/1968 transitions.
RANDOM walk for 4000000 steps (918936 resets) in 37022 ms. (108 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1807 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1767 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1817 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1739 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1737 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1854 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1771 resets) in 108 ms. (367 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1800 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1743 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1789 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1807 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1788 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1822 resets) in 109 ms. (363 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1719 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1783 resets) in 108 ms. (367 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1796 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1801 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1804 resets) in 102 ms. (388 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1718 resets) in 102 ms. (388 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1756 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1763 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1777 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1828 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1826 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1781 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1864 resets) in 109 ms. (363 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1814 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1802 resets) in 109 ms. (363 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1765 resets) in 108 ms. (367 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1711 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1798 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1812 resets) in 103 ms. (384 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1764 resets) in 108 ms. (366 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1723 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1799 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1804 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1800 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1780 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1800 resets) in 109 ms. (363 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 108 ms. (367 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1759 resets) in 102 ms. (388 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1801 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1805 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1797 resets) in 107 ms. (370 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1815 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1785 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1791 resets) in 108 ms. (367 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1754 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1792 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
Finished probabilistic random walk after 361084 steps, run visited all 108 properties in 3895 ms. (steps per millisecond=92 )
Probabilistic random walk after 361084 steps, saw 144283 distinct states, run finished after 3911 ms. (steps per millisecond=92 ) properties seen :108
Able to resolve query QuasiLiveness after proving 1134 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 277244 ms.
ITS solved all properties within timeout
BK_STOP 1716365788603
--------------------
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 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-d2m09"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d2m09, 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 r100-tall-171624200800367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m09.tgz
mv DBSingleClientW-PT-d2m09 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 '
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 ;