About the Execution of LTSMin+red for BART-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14665.699 | 3600000.00 | 11300181.00 | 3658.50 | TFFFFFF?FFFTTFF? | 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.r468-smll-171620167800476.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 BART-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167800476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 66M
-rw-r--r-- 1 mcc users 1.3M Apr 12 23:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 23:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 12 21:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.4M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1008K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8M Apr 13 03:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14M Apr 13 03:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1M Apr 13 00:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 13 00:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 97K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.1M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-030-LTLFireability-00
FORMULA_NAME BART-PT-030-LTLFireability-01
FORMULA_NAME BART-PT-030-LTLFireability-02
FORMULA_NAME BART-PT-030-LTLFireability-03
FORMULA_NAME BART-PT-030-LTLFireability-04
FORMULA_NAME BART-PT-030-LTLFireability-05
FORMULA_NAME BART-PT-030-LTLFireability-06
FORMULA_NAME BART-PT-030-LTLFireability-07
FORMULA_NAME BART-PT-030-LTLFireability-08
FORMULA_NAME BART-PT-030-LTLFireability-09
FORMULA_NAME BART-PT-030-LTLFireability-10
FORMULA_NAME BART-PT-030-LTLFireability-11
FORMULA_NAME BART-PT-030-LTLFireability-12
FORMULA_NAME BART-PT-030-LTLFireability-13
FORMULA_NAME BART-PT-030-LTLFireability-14
FORMULA_NAME BART-PT-030-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717235602641
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:53:25] [INFO ] Load time of PNML (sax parser for PT used): 886 ms
[2024-06-01 09:53:25] [INFO ] Transformed 4170 places.
[2024-06-01 09:53:25] [INFO ] Transformed 6060 transitions.
[2024-06-01 09:53:25] [INFO ] Found NUPN structural information;
[2024-06-01 09:53:25] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 1143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 212 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2371 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 300 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2024-06-01 09:53:27] [INFO ] Computed 30 invariants in 108 ms
[2024-06-01 09:53:29] [INFO ] Implicit Places using invariants in 1940 ms returned []
[2024-06-01 09:53:29] [INFO ] Invariant cache hit.
[2024-06-01 09:53:33] [INFO ] Implicit Places using invariants and state equation in 4610 ms returned []
Implicit Place search using SMT with State Equation took 6611 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2024-06-01 09:53:33] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((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 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30191 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30105 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints]
After SMT, in 64060ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 64199ms
Finished structural reductions in LTL mode , in 1 iterations and 71174 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Support contains 2371 out of 3960 places after structural reductions.
[2024-06-01 09:54:39] [INFO ] Flatten gal took : 471 ms
[2024-06-01 09:54:39] [INFO ] Flatten gal took : 304 ms
[2024-06-01 09:54:40] [INFO ] Input system was already deterministic with 6060 transitions.
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40000 steps (8 resets) in 2444 ms. (16 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3964 ms. (10 steps per ms) remains 1/1 properties
[2024-06-01 09:54:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2070 variables, 2070/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2070 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1890/3960 variables, 30/2100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3960 variables, 1890/3990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3960 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10020/10020 variables, and 7950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4388 ms.
Refiners :[Domain max(s): 3960/3960 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 3960/3960 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2070 variables, 2070/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2070 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1890/3960 variables, 30/2100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3960 variables, 1890/3990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3960 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10020/10020 variables, and 7950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3929 ms.
Refiners :[Domain max(s): 3960/3960 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 3960/3960 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9158ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 95 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 14 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((p1&&(X(X(G(p3)))||p2)))))'
Support contains 2370 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 93 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
[2024-06-01 09:54:52] [INFO ] Invariant cache hit.
[2024-06-01 09:54:53] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2024-06-01 09:54:53] [INFO ] Invariant cache hit.
[2024-06-01 09:54:57] [INFO ] Implicit Places using invariants and state equation in 4376 ms returned []
Implicit Place search using SMT with State Equation took 5564 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2024-06-01 09:54:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30083 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 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 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30086 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints]
After SMT, in 63391ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 63449ms
Finished structural reductions in LTL mode , in 1 iterations and 69119 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Stuttering acceptance computed with spot in 637 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : BART-PT-030-LTLFireability-01
Entered a terminal (fully accepting) state of product in 135 steps with 0 reset in 20 ms.
FORMULA BART-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-01 finished in 69917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (p0 U G(p2))))'
Support contains 330 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1710 transitions
Trivial Post-agglo rules discarded 1710 transitions
Performed 1710 trivial Post agglomeration. Transition count delta: 1710
Iterating post reduction 0 with 1710 rules applied. Total rules applied 1710 place count 3960 transition count 4350
Reduce places removed 1710 places and 0 transitions.
Iterating post reduction 1 with 1710 rules applied. Total rules applied 3420 place count 2250 transition count 4350
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 3570 place count 2100 transition count 4200
Iterating global reduction 2 with 150 rules applied. Total rules applied 3720 place count 2100 transition count 4200
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 4620 place count 1650 transition count 3750
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4650 place count 1650 transition count 3720
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 4740 place count 1620 transition count 3660
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 4800 place count 1590 transition count 3630
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 4830 place count 1590 transition count 3600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 4890 place count 1560 transition count 3570
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 4920 place count 1560 transition count 3540
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 4980 place count 1530 transition count 3510
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 5040 place count 1530 transition count 3450
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 5100 place count 1500 transition count 3420
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 5160 place count 1500 transition count 3360
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 5220 place count 1470 transition count 3330
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 5280 place count 1470 transition count 3270
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 5340 place count 1440 transition count 3240
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 5400 place count 1440 transition count 3180
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 5460 place count 1410 transition count 3150
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 5520 place count 1410 transition count 3090
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 5580 place count 1380 transition count 3060
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 5640 place count 1380 transition count 3000
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 5700 place count 1350 transition count 2970
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 5760 place count 1350 transition count 2910
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 5820 place count 1320 transition count 2880
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 5880 place count 1320 transition count 2820
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 14 with 60 rules applied. Total rules applied 5940 place count 1290 transition count 2790
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 6000 place count 1290 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 15 with 60 rules applied. Total rules applied 6060 place count 1260 transition count 2700
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 6120 place count 1260 transition count 2640
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 6180 place count 1230 transition count 2610
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 6240 place count 1230 transition count 2550
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 6300 place count 1200 transition count 2520
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 6360 place count 1200 transition count 2460
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 18 with 60 rules applied. Total rules applied 6420 place count 1170 transition count 2430
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 6480 place count 1170 transition count 2370
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 6540 place count 1140 transition count 2340
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 6600 place count 1140 transition count 2280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 6660 place count 1110 transition count 2250
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 6720 place count 1110 transition count 2190
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 6780 place count 1080 transition count 2160
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 6840 place count 1080 transition count 2100
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 22 with 60 rules applied. Total rules applied 6900 place count 1050 transition count 2070
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 6960 place count 1050 transition count 2010
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 7020 place count 1020 transition count 1980
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 7080 place count 1020 transition count 1920
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 24 with 60 rules applied. Total rules applied 7140 place count 990 transition count 1890
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 7200 place count 990 transition count 1830
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 25 with 60 rules applied. Total rules applied 7260 place count 960 transition count 1800
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 25 with 30 rules applied. Total rules applied 7290 place count 960 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 26 with 60 rules applied. Total rules applied 7350 place count 930 transition count 1740
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 26 with 30 rules applied. Total rules applied 7380 place count 930 transition count 1710
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 27 with 60 rules applied. Total rules applied 7440 place count 900 transition count 1680
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 27 with 30 rules applied. Total rules applied 7470 place count 900 transition count 1650
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 28 with 60 rules applied. Total rules applied 7530 place count 870 transition count 1620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 7590 place count 870 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 29 with 60 rules applied. Total rules applied 7650 place count 840 transition count 1530
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 7710 place count 840 transition count 1470
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 30 with 60 rules applied. Total rules applied 7770 place count 810 transition count 1440
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 7830 place count 810 transition count 1380
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 31 with 60 rules applied. Total rules applied 7890 place count 780 transition count 1350
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 7950 place count 780 transition count 1290
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 32 with 60 rules applied. Total rules applied 8010 place count 750 transition count 1260
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 32 with 30 rules applied. Total rules applied 8040 place count 750 transition count 1230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 33 with 60 rules applied. Total rules applied 8100 place count 720 transition count 1200
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 8130 place count 720 transition count 1170
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 34 with 60 rules applied. Total rules applied 8190 place count 690 transition count 1140
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 8250 place count 690 transition count 1080
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 35 with 60 rules applied. Total rules applied 8310 place count 660 transition count 1050
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 8370 place count 660 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8400 place count 660 transition count 960
Partial Post-agglomeration rule applied 30 times.
Drop transitions (Partial Post agglomeration) removed 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8430 place count 660 transition count 960
Discarding 30 places :
Symmetric choice reduction at 36 with 30 rule applications. Total rules 8460 place count 630 transition count 930
Iterating global reduction 36 with 30 rules applied. Total rules applied 8490 place count 630 transition count 930
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 36 with 30 rules applied. Total rules applied 8520 place count 630 transition count 900
Applied a total of 8520 rules in 2502 ms. Remains 630 /3960 variables (removed 3330) and now considering 900/6060 (removed 5160) transitions.
// Phase 1: matrix 900 rows 630 cols
[2024-06-01 09:56:04] [INFO ] Computed 30 invariants in 5 ms
[2024-06-01 09:56:04] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 09:56:04] [INFO ] Invariant cache hit.
[2024-06-01 09:56:05] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-06-01 09:56:05] [INFO ] Redundant transitions in 60 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 09:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 660 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1530 variables, 600/1260 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1530 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 1260 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 630/3960 places, 900/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63366 ms. Remains : 630/3960 places, 900/6060 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), true, (NOT p2)]
Running random walk in product with property : BART-PT-030-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 977 ms.
Product exploration explored 100000 steps with 0 reset in 998 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 444 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p2), true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 999 ms. (40 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1205 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 636 ms. (62 steps per ms) remains 2/2 properties
[2024-06-01 09:57:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1530 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1530 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 660 constraints, problems are : Problem set: 0 solved, 2 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 662 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5494ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 330 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 900/900 transitions.
Applied a total of 0 rules in 16 ms. Remains 630 /630 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 630/630 places, 900/900 transitions.
RANDOM walk for 40000 steps (8 resets) in 1185 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5115 steps, run visited all 2 properties in 259 ms. (steps per millisecond=19 )
Probabilistic random walk after 5115 steps, saw 5087 distinct states, run finished after 270 ms. (steps per millisecond=18 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p1)))
Knowledge based reduction with 11 factoid took 624 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-02 finished in 76769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2040 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 3870 transition count 5970
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 3870 transition count 5970
Applied a total of 180 rules in 227 ms. Remains 3870 /3960 variables (removed 90) and now considering 5970/6060 (removed 90) transitions.
// Phase 1: matrix 5970 rows 3870 cols
[2024-06-01 09:57:18] [INFO ] Computed 30 invariants in 44 ms
[2024-06-01 09:57:19] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-06-01 09:57:19] [INFO ] Invariant cache hit.
[2024-06-01 09:57:23] [INFO ] Implicit Places using invariants and state equation in 3699 ms returned []
Implicit Place search using SMT with State Equation took 4422 ms to find 0 implicit places.
Running 4890 sub problems to find dead transitions.
[2024-06-01 09:57:23] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3840/9840 variables, and 0 constraints, problems are : Problem set: 0 solved, 4890 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3870 constraints, PredecessorRefiner: 4890/4890 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3840/9840 variables, and 0 constraints, problems are : Problem set: 0 solved, 4890 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3870 constraints, PredecessorRefiner: 0/4890 constraints, Known Traps: 0/0 constraints]
After SMT, in 63050ms problems are : Problem set: 0 solved, 4890 unsolved
Search for dead transitions found 0 dead transitions in 63106ms
Starting structural reductions in LTL mode, iteration 1 : 3870/3960 places, 5970/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67770 ms. Remains : 3870/3960 places, 5970/6060 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-05 finished in 67961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 30 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 1510 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2024-06-01 09:58:28] [INFO ] Computed 30 invariants in 15 ms
[2024-06-01 09:58:28] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 09:58:28] [INFO ] Invariant cache hit.
[2024-06-01 09:58:30] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2024-06-01 09:58:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 2490/2490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
Error getting values : (error "ParserException while parsing response: ((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 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 0/2490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61097ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 61126ms
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64558 ms. Remains : 1470/3960 places, 3570/6060 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-06
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 3 ms.
FORMULA BART-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-06 finished in 64711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 2070 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 3960 transition count 5970
Reduce places removed 90 places and 0 transitions.
Performed 780 Post agglomeration using F-continuation condition.Transition count delta: 780
Iterating post reduction 1 with 870 rules applied. Total rules applied 960 place count 3870 transition count 5190
Reduce places removed 780 places and 0 transitions.
Iterating post reduction 2 with 780 rules applied. Total rules applied 1740 place count 3090 transition count 5190
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1770 place count 3060 transition count 5160
Iterating global reduction 3 with 30 rules applied. Total rules applied 1800 place count 3060 transition count 5160
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 2040 place count 2940 transition count 5040
Applied a total of 2040 rules in 480 ms. Remains 2940 /3960 variables (removed 1020) and now considering 5040/6060 (removed 1020) transitions.
// Phase 1: matrix 5040 rows 2940 cols
[2024-06-01 09:59:31] [INFO ] Computed 30 invariants in 27 ms
[2024-06-01 09:59:32] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-01 09:59:32] [INFO ] Invariant cache hit.
[2024-06-01 09:59:35] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 3280 ms to find 0 implicit places.
[2024-06-01 09:59:35] [INFO ] Redundant transitions in 575 ms returned []
Running 3960 sub problems to find dead transitions.
[2024-06-01 09:59:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 3960/3960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 0/3960 constraints, Known Traps: 0/0 constraints]
After SMT, in 62138ms problems are : Problem set: 0 solved, 3960 unsolved
Search for dead transitions found 0 dead transitions in 62185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2940/3960 places, 5040/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66536 ms. Remains : 2940/3960 places, 5040/6060 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-030-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 1243 ms.
Product exploration explored 100000 steps with 0 reset in 1432 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 740 ms. (53 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3020 ms. (13 steps per ms) remains 1/1 properties
[2024-06-01 10:01:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2070 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 870/2940 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7980/7980 variables, and 2970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3195 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 2940/2940 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2070 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 870/2940 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5040/7980 variables, 2940/2970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7980 variables, 0/2970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7980/7980 variables, and 2970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4336 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 2940/2940 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8323ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2070 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 5040/5040 transitions.
Applied a total of 0 rules in 67 ms. Remains 2940 /2940 variables (removed 0) and now considering 5040/5040 (removed 0) transitions.
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:03] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:06] [INFO ] Implicit Places using invariants and state equation in 2759 ms returned []
Implicit Place search using SMT with State Equation took 3268 ms to find 0 implicit places.
[2024-06-01 10:02:06] [INFO ] Redundant transitions in 316 ms returned []
Running 3960 sub problems to find dead transitions.
[2024-06-01 10:02:06] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 3960/3960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 0/3960 constraints, Known Traps: 0/0 constraints]
After SMT, in 62584ms problems are : Problem set: 0 solved, 3960 unsolved
Search for dead transitions found 0 dead transitions in 62631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66299 ms. Remains : 2940/2940 places, 5040/5040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 617 ms. (64 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3480 ms. (11 steps per ms) remains 1/1 properties
[2024-06-01 10:04:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2070 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 870/2940 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7980/7980 variables, and 2970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3138 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 2940/2940 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2070 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 870/2940 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7980/7980 variables, and 2970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3040 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 2940/2940 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6961ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 110 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1249 ms.
Product exploration explored 100000 steps with 0 reset in 1380 ms.
Support contains 2070 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 5040/5040 transitions.
Applied a total of 0 rules in 63 ms. Remains 2940 /2940 variables (removed 0) and now considering 5040/5040 (removed 0) transitions.
[2024-06-01 10:04:32] [INFO ] Invariant cache hit.
[2024-06-01 10:04:33] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-01 10:04:33] [INFO ] Invariant cache hit.
[2024-06-01 10:04:36] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned []
Implicit Place search using SMT with State Equation took 3230 ms to find 0 implicit places.
[2024-06-01 10:04:36] [INFO ] Redundant transitions in 284 ms returned []
Running 3960 sub problems to find dead transitions.
[2024-06-01 10:04:36] [INFO ] Invariant cache hit.
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 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 3960/3960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3960 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 0/3960 constraints, Known Traps: 0/0 constraints]
After SMT, in 62102ms problems are : Problem set: 0 solved, 3960 unsolved
Search for dead transitions found 0 dead transitions in 62147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65737 ms. Remains : 2940/2940 places, 5040/5040 transitions.
Treatment of property BART-PT-030-LTLFireability-07 finished in 367714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(F(p2)||p1)))||F(p3)))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6054 edges and 3960 vertex of which 3564 / 3960 are part of one of the 27 SCC in 5 ms
Free SCC test removed 3537 places
Ensure Unique test removed 5427 transitions
Reduce isomorphic transitions removed 5427 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 218 rules applied. Total rules applied 219 place count 396 transition count 415
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 411 place count 204 transition count 415
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 411 place count 204 transition count 403
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 435 place count 192 transition count 403
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 453 place count 174 transition count 385
Iterating global reduction 2 with 18 rules applied. Total rules applied 471 place count 174 transition count 385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 474 place count 174 transition count 382
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 486 place count 162 transition count 370
Iterating global reduction 3 with 12 rules applied. Total rules applied 498 place count 162 transition count 370
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 507 place count 153 transition count 361
Iterating global reduction 3 with 9 rules applied. Total rules applied 516 place count 153 transition count 361
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 525 place count 144 transition count 352
Iterating global reduction 3 with 9 rules applied. Total rules applied 534 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 540 place count 138 transition count 346
Iterating global reduction 3 with 6 rules applied. Total rules applied 546 place count 138 transition count 346
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 552 place count 132 transition count 340
Iterating global reduction 3 with 6 rules applied. Total rules applied 558 place count 132 transition count 340
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 561 place count 129 transition count 337
Iterating global reduction 3 with 3 rules applied. Total rules applied 564 place count 129 transition count 337
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 606 place count 108 transition count 316
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 618 place count 108 transition count 304
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 630 place count 102 transition count 298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 642 place count 102 transition count 286
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 654 place count 96 transition count 280
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 666 place count 96 transition count 268
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 678 place count 90 transition count 262
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 690 place count 90 transition count 250
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 702 place count 84 transition count 244
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 714 place count 84 transition count 232
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 726 place count 78 transition count 226
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 738 place count 78 transition count 214
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 750 place count 72 transition count 208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 762 place count 72 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 774 place count 66 transition count 190
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 786 place count 66 transition count 178
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 798 place count 60 transition count 172
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 810 place count 60 transition count 160
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 822 place count 54 transition count 154
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 834 place count 54 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 846 place count 48 transition count 136
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 858 place count 48 transition count 124
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 870 place count 42 transition count 118
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 882 place count 42 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 894 place count 36 transition count 100
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 906 place count 36 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 16 with 12 rules applied. Total rules applied 918 place count 30 transition count 82
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 930 place count 30 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 17 with 12 rules applied. Total rules applied 942 place count 24 transition count 64
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 954 place count 24 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 18 with 12 rules applied. Total rules applied 966 place count 18 transition count 46
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 978 place count 18 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 990 place count 12 transition count 28
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 19 with 15 rules applied. Total rules applied 1005 place count 12 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 1011 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 3 Pre rules applied. Total rules applied 1011 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 1017 place count 6 transition count 7
Applied a total of 1017 rules in 115 ms. Remains 6 /3960 variables (removed 3954) and now considering 7/6060 (removed 6053) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-06-01 10:05:39] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 10:05:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 10:05:39] [INFO ] Invariant cache hit.
[2024-06-01 10:05:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-01 10:05:39] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:05:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/3960 places, 7/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 6/3960 places, 7/6060 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BART-PT-030-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA BART-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-08 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4046 place count 1892 transition count 3992
Iterating global reduction 0 with 90 rules applied. Total rules applied 4136 place count 1892 transition count 3992
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4226 place count 1802 transition count 3902
Iterating global reduction 0 with 90 rules applied. Total rules applied 4316 place count 1802 transition count 3902
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4406 place count 1712 transition count 3812
Iterating global reduction 0 with 90 rules applied. Total rules applied 4496 place count 1712 transition count 3812
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4586 place count 1622 transition count 3722
Iterating global reduction 0 with 90 rules applied. Total rules applied 4676 place count 1622 transition count 3722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4736 place count 1562 transition count 3662
Iterating global reduction 0 with 60 rules applied. Total rules applied 4796 place count 1562 transition count 3662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4856 place count 1502 transition count 3602
Iterating global reduction 0 with 60 rules applied. Total rules applied 4916 place count 1502 transition count 3602
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4946 place count 1472 transition count 3572
Iterating global reduction 0 with 30 rules applied. Total rules applied 4976 place count 1472 transition count 3572
Applied a total of 4976 rules in 1063 ms. Remains 1472 /3960 variables (removed 2488) and now considering 3572/6060 (removed 2488) transitions.
// Phase 1: matrix 3572 rows 1472 cols
[2024-06-01 10:05:40] [INFO ] Computed 30 invariants in 12 ms
[2024-06-01 10:05:40] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 10:05:40] [INFO ] Invariant cache hit.
[2024-06-01 10:05:42] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Running 2492 sub problems to find dead transitions.
[2024-06-01 10:05:42] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/5044 variables, and 0 constraints, problems are : Problem set: 0 solved, 2492 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1472 constraints, PredecessorRefiner: 2492/2492 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/5044 variables, and 0 constraints, problems are : Problem set: 0 solved, 2492 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1472 constraints, PredecessorRefiner: 0/2492 constraints, Known Traps: 0/0 constraints]
After SMT, in 61208ms problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 61238ms
Starting structural reductions in LTL mode, iteration 1 : 1472/3960 places, 3572/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64046 ms. Remains : 1472/3960 places, 3572/6060 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-10
Product exploration explored 100000 steps with 315 reset in 1203 ms.
Product exploration explored 100000 steps with 316 reset in 984 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-06-01 10:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/5044 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/30 constraints, State Equation: 100/1472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/5044 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/30 constraints, State Equation: 100/1472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 10:06:48] [INFO ] Invariant cache hit.
[2024-06-01 10:06:50] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-10 finished in 71033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4045 place count 1893 transition count 3993
Iterating global reduction 0 with 89 rules applied. Total rules applied 4134 place count 1893 transition count 3993
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4223 place count 1804 transition count 3904
Iterating global reduction 0 with 89 rules applied. Total rules applied 4312 place count 1804 transition count 3904
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4401 place count 1715 transition count 3815
Iterating global reduction 0 with 89 rules applied. Total rules applied 4490 place count 1715 transition count 3815
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4579 place count 1626 transition count 3726
Iterating global reduction 0 with 89 rules applied. Total rules applied 4668 place count 1626 transition count 3726
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4727 place count 1567 transition count 3667
Iterating global reduction 0 with 59 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4933 place count 1479 transition count 3579
Iterating global reduction 0 with 29 rules applied. Total rules applied 4962 place count 1479 transition count 3579
Applied a total of 4962 rules in 1026 ms. Remains 1479 /3960 variables (removed 2481) and now considering 3579/6060 (removed 2481) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2024-06-01 10:06:51] [INFO ] Computed 30 invariants in 12 ms
[2024-06-01 10:06:51] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 10:06:51] [INFO ] Invariant cache hit.
[2024-06-01 10:06:53] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Running 2499 sub problems to find dead transitions.
[2024-06-01 10:06:53] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 2499/2499 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2499 unsolved
Error getting values : (error "ParserException while parsing response: ((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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 0/2499 constraints, Known Traps: 0/0 constraints]
After SMT, in 61132ms problems are : Problem set: 0 solved, 2499 unsolved
Search for dead transitions found 0 dead transitions in 61161ms
Starting structural reductions in LTL mode, iteration 1 : 1479/3960 places, 3579/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64035 ms. Remains : 1479/3960 places, 3579/6060 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 3769 ms.
Product exploration explored 100000 steps with 50000 reset in 3774 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-12 finished in 72564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 1002 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2024-06-01 10:08:04] [INFO ] Computed 30 invariants in 12 ms
[2024-06-01 10:08:04] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 10:08:04] [INFO ] Invariant cache hit.
[2024-06-01 10:08:05] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2024-06-01 10:08:06] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 2490/2490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 0/2490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61147ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 61176ms
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64058 ms. Remains : 1470/3960 places, 3570/6060 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-13
Entered a terminal (fully accepting) state of product in 112 steps with 0 reset in 2 ms.
FORMULA BART-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-13 finished in 64261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p0))'
Support contains 1 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6058 edges and 3960 vertex of which 3828 / 3960 are part of one of the 29 SCC in 3 ms
Free SCC test removed 3799 places
Ensure Unique test removed 5829 transitions
Reduce isomorphic transitions removed 5829 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 157 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 157 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 165 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 182 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 222 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 226 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 234 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 242 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 246 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 250 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 254 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 258 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 262 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 266 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 270 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 274 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 278 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 282 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 286 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 290 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 294 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 298 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 302 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 306 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 310 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 314 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 318 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 322 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 326 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 330 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 334 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 338 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 342 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 346 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 350 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 355 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 357 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 357 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 359 place count 2 transition count 3
Applied a total of 359 rules in 35 ms. Remains 2 /3960 variables (removed 3958) and now considering 3/6060 (removed 6057) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 10:09:07] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 10:09:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:09:07] [INFO ] Invariant cache hit.
[2024-06-01 10:09:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 10:09:07] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 10:09:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 52ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3960 places, 3/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 2/3960 places, 3/6060 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-14 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3865 place count 1983 transition count 4083
Iterating global reduction 0 with 89 rules applied. Total rules applied 3954 place count 1983 transition count 4083
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4043 place count 1894 transition count 3994
Iterating global reduction 0 with 89 rules applied. Total rules applied 4132 place count 1894 transition count 3994
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4221 place count 1805 transition count 3905
Iterating global reduction 0 with 89 rules applied. Total rules applied 4310 place count 1805 transition count 3905
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4399 place count 1716 transition count 3816
Iterating global reduction 0 with 89 rules applied. Total rules applied 4488 place count 1716 transition count 3816
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4577 place count 1627 transition count 3727
Iterating global reduction 0 with 89 rules applied. Total rules applied 4666 place count 1627 transition count 3727
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4726 place count 1567 transition count 3667
Iterating global reduction 0 with 60 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4934 place count 1478 transition count 3578
Iterating global reduction 0 with 30 rules applied. Total rules applied 4964 place count 1478 transition count 3578
Applied a total of 4964 rules in 996 ms. Remains 1478 /3960 variables (removed 2482) and now considering 3578/6060 (removed 2482) transitions.
// Phase 1: matrix 3578 rows 1478 cols
[2024-06-01 10:09:08] [INFO ] Computed 30 invariants in 11 ms
[2024-06-01 10:09:08] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 10:09:08] [INFO ] Invariant cache hit.
[2024-06-01 10:09:10] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Running 2498 sub problems to find dead transitions.
[2024-06-01 10:09:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 2498/2498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 0/2498 constraints, Known Traps: 0/0 constraints]
After SMT, in 61089ms problems are : Problem set: 0 solved, 2498 unsolved
Search for dead transitions found 0 dead transitions in 61118ms
Starting structural reductions in LTL mode, iteration 1 : 1478/3960 places, 3578/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63899 ms. Remains : 1478/3960 places, 3578/6060 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-15
Product exploration explored 100000 steps with 4 reset in 584 ms.
Product exploration explored 100000 steps with 2 reset in 642 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 7596 steps (1 resets) in 58 ms. (128 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 1478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1478/1478 places, 3578/3578 transitions.
Applied a total of 0 rules in 51 ms. Remains 1478 /1478 variables (removed 0) and now considering 3578/3578 (removed 0) transitions.
[2024-06-01 10:10:14] [INFO ] Invariant cache hit.
[2024-06-01 10:10:15] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 10:10:15] [INFO ] Invariant cache hit.
[2024-06-01 10:10:16] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
Running 2498 sub problems to find dead transitions.
[2024-06-01 10:10:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 2498/2498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 0/2498 constraints, Known Traps: 0/0 constraints]
After SMT, in 61084ms problems are : Problem set: 0 solved, 2498 unsolved
Search for dead transitions found 0 dead transitions in 61113ms
Finished structural reductions in LTL mode , in 1 iterations and 63004 ms. Remains : 1478/1478 places, 3578/3578 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 8181 steps (2 resets) in 88 ms. (91 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 624 ms.
Product exploration explored 100000 steps with 2 reset in 713 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 1478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1478/1478 places, 3578/3578 transitions.
Graph (trivial) has 3574 edges and 1478 vertex of which 1421 / 1478 are part of one of the 29 SCC in 1 ms
Free SCC test removed 1392 places
Ensure Unique test removed 3416 transitions
Reduce isomorphic transitions removed 3416 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 58 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 58 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 31 place count 58 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 58 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 57 transition count 133
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 57 transition count 133
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 57 transition count 134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 56 place count 57 transition count 127
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 68 place count 45 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 45 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 45 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 45 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 44 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 44 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 44 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 44 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 43 transition count 109
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 43 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 43 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 43 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 94 place count 42 transition count 106
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 42 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 42 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 98 place count 42 transition count 104
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 99 place count 41 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 100 place count 41 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 101 place count 41 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 103 place count 41 transition count 101
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 104 place count 40 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 105 place count 40 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 106 place count 40 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 108 place count 40 transition count 98
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 109 place count 39 transition count 97
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 110 place count 39 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 111 place count 39 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 113 place count 39 transition count 95
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 114 place count 38 transition count 94
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 115 place count 38 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 116 place count 38 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 118 place count 38 transition count 92
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 119 place count 37 transition count 91
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 120 place count 37 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 121 place count 37 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 123 place count 37 transition count 89
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 124 place count 36 transition count 88
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 125 place count 36 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 126 place count 36 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 128 place count 36 transition count 86
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 129 place count 35 transition count 85
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 130 place count 35 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 131 place count 35 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 133 place count 35 transition count 83
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 134 place count 34 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 135 place count 34 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 136 place count 34 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 138 place count 34 transition count 80
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 139 place count 33 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 140 place count 33 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 141 place count 33 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 143 place count 33 transition count 77
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 144 place count 32 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 145 place count 32 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 146 place count 32 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 148 place count 32 transition count 74
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 149 place count 31 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 150 place count 31 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 151 place count 31 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 153 place count 31 transition count 71
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 154 place count 30 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 155 place count 30 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 156 place count 30 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 158 place count 30 transition count 68
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 159 place count 29 transition count 67
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 160 place count 29 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 161 place count 29 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 163 place count 29 transition count 65
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 164 place count 28 transition count 64
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 165 place count 28 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 166 place count 28 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 168 place count 28 transition count 62
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 169 place count 27 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 170 place count 27 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 171 place count 27 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 173 place count 27 transition count 59
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 174 place count 26 transition count 58
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 175 place count 26 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 176 place count 26 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 178 place count 26 transition count 56
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 179 place count 25 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 180 place count 25 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 181 place count 25 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 183 place count 25 transition count 53
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 184 place count 24 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 185 place count 24 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 186 place count 24 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 188 place count 24 transition count 50
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 189 place count 23 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 190 place count 23 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 191 place count 23 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 193 place count 23 transition count 47
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 194 place count 22 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 195 place count 22 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 196 place count 22 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 198 place count 22 transition count 44
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 199 place count 21 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 200 place count 21 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 201 place count 21 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 203 place count 21 transition count 41
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 204 place count 20 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 205 place count 20 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 206 place count 20 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 208 place count 20 transition count 38
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 209 place count 19 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 210 place count 19 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 211 place count 19 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 213 place count 19 transition count 35
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 214 place count 18 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 215 place count 18 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 216 place count 18 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 218 place count 18 transition count 32
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 219 place count 17 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 220 place count 17 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 221 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 223 place count 17 transition count 29
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 224 place count 16 transition count 28
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 225 place count 16 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 226 place count 16 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 228 place count 16 transition count 26
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 229 place count 15 transition count 25
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 230 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 231 place count 15 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 233 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 234 place count 14 transition count 22
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 235 place count 14 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 236 place count 14 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 238 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 239 place count 13 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 240 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 241 place count 13 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 243 place count 13 transition count 17
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 244 place count 12 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 245 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 246 place count 12 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 248 place count 12 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 248 place count 12 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 249 place count 12 transition count 14
Discarding 4 places :
Symmetric choice reduction at 37 with 4 rule applications. Total rules 253 place count 8 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 4 rules applied. Total rules applied 257 place count 8 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 37 with 1 rules applied. Total rules applied 258 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 258 place count 8 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 259 place count 8 transition count 9
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 261 place count 6 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 263 place count 6 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 263 rules in 62 ms. Remains 6 /1478 variables (removed 1472) and now considering 7/3578 (removed 3571) transitions.
[2024-06-01 10:11:21] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-06-01 10:11:21] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:11:21] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 5 ms to minimize.
Problem TDEAD3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem TDEAD1 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 2 solved, 2 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 2 solved, 2 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 129ms problems are : Problem set: 2 solved, 2 unsolved
Search for dead transitions found 2 dead transitions in 129ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 6/1478 places, 5/3578 transitions.
Graph (complete) has 4 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 4 /6 variables (removed 2) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/1478 places, 5/3578 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 4/1478 places, 5/3578 transitions.
Support contains 2 out of 1478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1478/1478 places, 3578/3578 transitions.
Applied a total of 0 rules in 163 ms. Remains 1478 /1478 variables (removed 0) and now considering 3578/3578 (removed 0) transitions.
// Phase 1: matrix 3578 rows 1478 cols
[2024-06-01 10:11:22] [INFO ] Computed 30 invariants in 12 ms
[2024-06-01 10:11:22] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 10:11:22] [INFO ] Invariant cache hit.
[2024-06-01 10:11:23] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
Running 2498 sub problems to find dead transitions.
[2024-06-01 10:11:23] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 2498/2498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 0/2498 constraints, Known Traps: 0/0 constraints]
After SMT, in 61121ms problems are : Problem set: 0 solved, 2498 unsolved
Search for dead transitions found 0 dead transitions in 61158ms
Finished structural reductions in LTL mode , in 1 iterations and 63163 ms. Remains : 1478/1478 places, 3578/3578 transitions.
Treatment of property BART-PT-030-LTLFireability-15 finished in 197657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Found a Shortening insensitive property : BART-PT-030-LTLFireability-15
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6055 edges and 3960 vertex of which 3810 / 3960 are part of one of the 29 SCC in 2 ms
Free SCC test removed 3781 places
Ensure Unique test removed 5805 transitions
Reduce isomorphic transitions removed 5805 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 151 transition count 152
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 182 place count 75 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 74 transition count 148
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 188 place count 73 transition count 146
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 190 place count 72 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 190 place count 72 transition count 141
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 198 place count 68 transition count 141
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 205 place count 61 transition count 134
Iterating global reduction 5 with 7 rules applied. Total rules applied 212 place count 61 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 214 place count 61 transition count 132
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 218 place count 57 transition count 128
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 57 transition count 128
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 225 place count 54 transition count 125
Iterating global reduction 6 with 3 rules applied. Total rules applied 228 place count 54 transition count 125
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 231 place count 51 transition count 122
Iterating global reduction 6 with 3 rules applied. Total rules applied 234 place count 51 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 236 place count 49 transition count 120
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 240 place count 47 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 47 transition count 118
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 46 transition count 117
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 46 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 258 place count 39 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 262 place count 39 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 266 place count 37 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 270 place count 37 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 274 place count 35 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 278 place count 35 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 282 place count 33 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 286 place count 33 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 290 place count 31 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 294 place count 31 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 298 place count 29 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 302 place count 29 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 306 place count 27 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 310 place count 27 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 314 place count 25 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 318 place count 25 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 322 place count 23 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 326 place count 23 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 330 place count 21 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 334 place count 21 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 338 place count 19 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 342 place count 19 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 346 place count 17 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 350 place count 17 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 354 place count 15 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 358 place count 15 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 362 place count 13 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 366 place count 13 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 370 place count 11 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 374 place count 11 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 378 place count 9 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 382 place count 9 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 386 place count 7 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 5 rules applied. Total rules applied 391 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 393 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 393 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 395 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 396 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 396 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 398 place count 4 transition count 5
Applied a total of 398 rules in 51 ms. Remains 4 /3960 variables (removed 3956) and now considering 5/6060 (removed 6055) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-06-01 10:12:25] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 10:12:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 10:12:25] [INFO ] Invariant cache hit.
[2024-06-01 10:12:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 10:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in LI_LTL mode, iteration 1 : 4/3960 places, 5/6060 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 179 ms. Remains : 4/3960 places, 5/6060 transitions.
Running random walk in product with property : BART-PT-030-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
Treatment of property BART-PT-030-LTLFireability-15 finished in 483 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 10:12:26] [INFO ] Flatten gal took : 196 ms
[2024-06-01 10:12:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 36 ms.
[2024-06-01 10:12:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3960 places, 6060 transitions and 12120 arcs took 31 ms.
Total runtime 1141733 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
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="BART-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BART-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167800476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-030.tgz
mv BART-PT-030 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;