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-171620167200179.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 AutoFlight-PT-24b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167200179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 538K 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 AutoFlight-PT-24b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717193918916

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:18:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:41] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-31 22:18:42] [INFO ] Transformed 2230 places.
[2024-05-31 22:18:42] [INFO ] Transformed 2228 transitions.
[2024-05-31 22:18:42] [INFO ] Found NUPN structural information;
[2024-05-31 22:18:42] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 887 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-24b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 306 places :
Symmetric choice reduction at 0 with 306 rule applications. Total rules 306 place count 1924 transition count 1922
Iterating global reduction 0 with 306 rules applied. Total rules applied 612 place count 1924 transition count 1922
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 659 place count 1924 transition count 1875
Discarding 137 places :
Symmetric choice reduction at 1 with 137 rule applications. Total rules 796 place count 1787 transition count 1738
Iterating global reduction 1 with 137 rules applied. Total rules applied 933 place count 1787 transition count 1738
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 956 place count 1764 transition count 1715
Iterating global reduction 1 with 23 rules applied. Total rules applied 979 place count 1764 transition count 1715
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 1000 place count 1743 transition count 1694
Iterating global reduction 1 with 21 rules applied. Total rules applied 1021 place count 1743 transition count 1694
Applied a total of 1021 rules in 1542 ms. Remains 1743 /2230 variables (removed 487) and now considering 1694/2228 (removed 534) transitions.
// Phase 1: matrix 1694 rows 1743 cols
[2024-05-31 22:18:44] [INFO ] Computed 148 invariants in 62 ms
[2024-05-31 22:18:46] [INFO ] Implicit Places using invariants in 1955 ms returned []
[2024-05-31 22:18:46] [INFO ] Invariant cache hit.
[2024-05-31 22:18:50] [INFO ] Implicit Places using invariants and state equation in 4194 ms returned []
Implicit Place search using SMT with State Equation took 6213 ms to find 0 implicit places.
Running 1693 sub problems to find dead transitions.
[2024-05-31 22:18:50] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1742/3437 variables, and 0 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1743 constraints, PredecessorRefiner: 1693/1693 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1742/3437 variables, and 0 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1743 constraints, PredecessorRefiner: 0/1693 constraints, Known Traps: 0/0 constraints]
After SMT, in 61010ms problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 61085ms
Starting structural reductions in LTL mode, iteration 1 : 1743/2230 places, 1694/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68904 ms. Remains : 1743/2230 places, 1694/2228 transitions.
Support contains 30 out of 1743 places after structural reductions.
[2024-05-31 22:19:52] [INFO ] Flatten gal took : 221 ms
[2024-05-31 22:19:52] [INFO ] Flatten gal took : 127 ms
[2024-05-31 22:19:52] [INFO ] Input system was already deterministic with 1694 transitions.
Support contains 27 out of 1743 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (36 resets) in 2313 ms. (17 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2024-05-31 22:19:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 141/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1476/1620 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1620 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/1743 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1743 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1694/3437 variables, 1743/1891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3437 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3437 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1891 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1743/1743 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 141/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1476/1620 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 59 places in 639 ms of which 110 ms to minimize.
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1620 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1620 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 123/1743 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:19:57] [INFO ] Deduced a trap composed of 21 places in 613 ms of which 10 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 27 places in 715 ms of which 9 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 15 places in 587 ms of which 9 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 47 places in 730 ms of which 12 ms to minimize.
[2024-05-31 22:20:00] [INFO ] Deduced a trap composed of 33 places in 874 ms of which 9 ms to minimize.
SMT process timed out in 7073ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1743 transition count 1067
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 700 rules applied. Total rules applied 1327 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1376 place count 1068 transition count 993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1377 place count 1067 transition count 993
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1377 place count 1067 transition count 794
Deduced a syphon composed of 199 places in 9 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1775 place count 868 transition count 794
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1783 place count 860 transition count 786
Iterating global reduction 4 with 8 rules applied. Total rules applied 1791 place count 860 transition count 786
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1791 place count 860 transition count 782
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1799 place count 856 transition count 782
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 2 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 4 with 682 rules applied. Total rules applied 2481 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2576 place count 515 transition count 298
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2671 place count 420 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2672 place count 419 transition count 297
Reduce places removed 117 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 5 with 311 rules applied. Total rules applied 2983 place count 302 transition count 103
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 6 with 194 rules applied. Total rules applied 3177 place count 108 transition count 103
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 3177 place count 108 transition count 67
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 3249 place count 72 transition count 67
Applied a total of 3249 rules in 615 ms. Remains 72 /1743 variables (removed 1671) and now considering 67/1694 (removed 1627) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 72/1743 places, 67/1694 transitions.
RANDOM walk for 178 steps (3 resets) in 12 ms. (13 steps per ms) remains 0/2 properties
FORMULA AutoFlight-PT-24b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-24b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 429 stabilizing places and 429 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' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1732 transition count 1683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1732 transition count 1683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1732 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 1727 transition count 1677
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1726 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1725 transition count 1675
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1725 transition count 1675
Applied a total of 37 rules in 851 ms. Remains 1725 /1743 variables (removed 18) and now considering 1675/1694 (removed 19) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-31 22:20:02] [INFO ] Computed 148 invariants in 37 ms
[2024-05-31 22:20:03] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2024-05-31 22:20:03] [INFO ] Invariant cache hit.
[2024-05-31 22:20:07] [INFO ] Implicit Places using invariants and state equation in 3772 ms returned []
Implicit Place search using SMT with State Equation took 4844 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-31 22:20:07] [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 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1674/1674 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60718ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1743 places, 1675/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66420 ms. Remains : 1725/1743 places, 1675/1694 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01
Product exploration explored 100000 steps with 93 reset in 742 ms.
Product exploration explored 100000 steps with 94 reset in 525 ms.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (36 resets) in 550 ms. (72 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
[2024-05-31 22:21:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 326/330 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1272/1602 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1602 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 123/1725 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1675/3400 variables, 1725/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3400/3400 variables, and 1873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1725/1725 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 326/330 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1272/1602 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:21:12] [INFO ] Deduced a trap composed of 59 places in 392 ms of which 6 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 67 places in 312 ms of which 5 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 66 places in 351 ms of which 6 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 68 places in 357 ms of which 7 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 70 places in 374 ms of which 7 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 69 places in 376 ms of which 6 ms to minimize.
[2024-05-31 22:21:15] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 6 ms to minimize.
[2024-05-31 22:21:15] [INFO ] Deduced a trap composed of 81 places in 366 ms of which 6 ms to minimize.
[2024-05-31 22:21:15] [INFO ] Deduced a trap composed of 73 places in 369 ms of which 6 ms to minimize.
[2024-05-31 22:21:16] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 6 ms to minimize.
[2024-05-31 22:21:16] [INFO ] Deduced a trap composed of 75 places in 372 ms of which 7 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 6 ms to minimize.
SMT process timed out in 6797ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1725 transition count 1052
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 695 rules applied. Total rules applied 1318 place count 1102 transition count 980
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1367 place count 1054 transition count 979
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1368 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1766 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2442 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2537 place count 516 transition count 299
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2632 place count 421 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2633 place count 420 transition count 298
Reduce places removed 92 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 5 with 228 rules applied. Total rules applied 2861 place count 328 transition count 162
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 6 with 136 rules applied. Total rules applied 2997 place count 192 transition count 162
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 2997 place count 192 transition count 132
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3057 place count 162 transition count 132
Applied a total of 3057 rules in 223 ms. Remains 162 /1725 variables (removed 1563) and now considering 132/1675 (removed 1543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 162/1725 places, 132/1675 transitions.
RANDOM walk for 40000 steps (543 resets) in 796 ms. (50 steps per ms) remains 1/3 properties
BEST_FIRST walk for 9750 steps (5 resets) in 27 ms. (348 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 424 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Applied a total of 0 rules in 107 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2024-05-31 22:21:18] [INFO ] Invariant cache hit.
[2024-05-31 22:21:18] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-05-31 22:21:18] [INFO ] Invariant cache hit.
[2024-05-31 22:21:22] [INFO ] Implicit Places using invariants and state equation in 3222 ms returned []
Implicit Place search using SMT with State Equation took 3997 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-31 22:21:22] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 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)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1674/1674 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1674 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Finished structural reductions in LTL mode , in 1 iterations and 64634 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 232 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (36 resets) in 342 ms. (116 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
[2024-05-31 22:22:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 326/330 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1272/1602 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1602 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 123/1725 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1675/3400 variables, 1725/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3400/3400 variables, and 1873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1725/1725 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 326/330 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1272/1602 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 59 places in 342 ms of which 6 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 67 places in 339 ms of which 6 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 66 places in 340 ms of which 6 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 6 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 70 places in 339 ms of which 6 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 69 places in 328 ms of which 6 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 6 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 81 places in 377 ms of which 6 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 73 places in 347 ms of which 6 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 79 places in 319 ms of which 7 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 75 places in 353 ms of which 5 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 6 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 72 places in 359 ms of which 6 ms to minimize.
SMT process timed out in 7341ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1725 transition count 1052
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 695 rules applied. Total rules applied 1318 place count 1102 transition count 980
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1367 place count 1054 transition count 979
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1368 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1766 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2442 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2537 place count 516 transition count 299
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2632 place count 421 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2633 place count 420 transition count 298
Reduce places removed 92 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 5 with 228 rules applied. Total rules applied 2861 place count 328 transition count 162
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 6 with 136 rules applied. Total rules applied 2997 place count 192 transition count 162
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 2997 place count 192 transition count 132
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3057 place count 162 transition count 132
Applied a total of 3057 rules in 321 ms. Remains 162 /1725 variables (removed 1563) and now considering 132/1675 (removed 1543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 162/1725 places, 132/1675 transitions.
RANDOM walk for 40000 steps (569 resets) in 295 ms. (135 steps per ms) remains 1/3 properties
BEST_FIRST walk for 9019 steps (9 resets) in 33 ms. (265 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 396 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 94 reset in 387 ms.
Product exploration explored 100000 steps with 93 reset in 462 ms.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Applied a total of 0 rules in 119 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2024-05-31 22:22:33] [INFO ] Invariant cache hit.
[2024-05-31 22:22:34] [INFO ] Implicit Places using invariants in 1090 ms returned []
[2024-05-31 22:22:34] [INFO ] Invariant cache hit.
[2024-05-31 22:22:37] [INFO ] Implicit Places using invariants and state equation in 3283 ms returned []
Implicit Place search using SMT with State Equation took 4394 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-31 22:22:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1674/1674 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Finished structural reductions in LTL mode , in 1 iterations and 65067 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 216724 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)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1742 transition count 1064
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 702 rules applied. Total rules applied 1331 place count 1113 transition count 991
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1379 place count 1065 transition count 991
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1379 place count 1065 transition count 793
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1775 place count 867 transition count 793
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1784 place count 858 transition count 784
Iterating global reduction 3 with 9 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1793 place count 858 transition count 779
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1803 place count 853 transition count 779
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2556 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2580 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2580 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2628 place count 416 transition count 342
Applied a total of 2628 rules in 209 ms. Remains 416 /1743 variables (removed 1327) and now considering 342/1694 (removed 1352) transitions.
// Phase 1: matrix 342 rows 416 cols
[2024-05-31 22:23:38] [INFO ] Computed 100 invariants in 4 ms
[2024-05-31 22:23:38] [INFO ] Implicit Places using invariants in 500 ms returned [169, 243, 317, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 503 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/1743 places, 342/1694 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 366 transition count 318
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 365 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 364 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 363 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 362 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 361 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 360 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 359 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 358 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 357 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 356 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 355 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 354 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 353 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 352 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 352 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 351 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 351 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 350 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 350 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 349 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 349 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 348 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 348 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 347 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 347 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 346 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 346 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 345 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 345 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 344 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 344 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 343 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 343 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 342 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 342 transition count 294
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 0 with 4 rules applied. Total rules applied 100 place count 340 transition count 292
Applied a total of 100 rules in 163 ms. Remains 340 /390 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 340 cols
[2024-05-31 22:23:39] [INFO ] Computed 74 invariants in 7 ms
[2024-05-31 22:23:39] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-31 22:23:39] [INFO ] Invariant cache hit.
[2024-05-31 22:23:39] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1743 places, 292/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1748 ms. Remains : 340/1743 places, 292/1694 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-02
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-02 finished in 1858 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 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1733 transition count 1684
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1733 transition count 1684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1733 transition count 1683
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 1730 transition count 1680
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1728 transition count 1678
Applied a total of 31 rules in 498 ms. Remains 1728 /1743 variables (removed 15) and now considering 1678/1694 (removed 16) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-31 22:23:40] [INFO ] Computed 148 invariants in 9 ms
[2024-05-31 22:23:41] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-31 22:23:41] [INFO ] Invariant cache hit.
[2024-05-31 22:23:44] [INFO ] Implicit Places using invariants and state equation in 3237 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:23:44] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1743 places, 1678/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65032 ms. Remains : 1728/1743 places, 1678/1694 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-03
Product exploration explored 100000 steps with 94 reset in 490 ms.
Product exploration explored 100000 steps with 93 reset in 448 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (36 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249337 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249337 steps, saw 156717 distinct states, run finished after 3007 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-31 22:24:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 111/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1492/1605 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1728 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1728 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1678/3406 variables, 1728/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 1876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1728/1728 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) 111/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1492/1605 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:24:51] [INFO ] Deduced a trap composed of 76 places in 392 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1728 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:24:52] [INFO ] Deduced a trap composed of 25 places in 799 ms of which 14 ms to minimize.
[2024-05-31 22:24:53] [INFO ] Deduced a trap composed of 23 places in 801 ms of which 10 ms to minimize.
[2024-05-31 22:24:54] [INFO ] Deduced a trap composed of 17 places in 774 ms of which 10 ms to minimize.
[2024-05-31 22:24:54] [INFO ] Deduced a trap composed of 19 places in 765 ms of which 10 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 1)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 1)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 1)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 1)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 1)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 1)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 1)
(s616 1)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 1)
(s638 0)
(s639 0)
(s640 0)
(s641 1)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 1)
(s655 0)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 1)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 1)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 1)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 1)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 1)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 1)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 1)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 1)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 1)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 1)
(s782 0)
(s783 0)
(s784 1)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 1)
(s795 1)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 1)
(s808 0)
(s809 0)
(s810 0)
(s811 1)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 1)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 1)
(s827 0)
(s828 0)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 1)
(s843 0)
(s844 0)
(s845 0)
(s846 1)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 1)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 1)
(s860 1)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 1)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 1)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 1)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 1)
(s894 0)
(s895 0)
(s896 1)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 1)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 1)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 1)
(s919 0)
(s920 0)
(s921 1)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 1)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 1)
(s938 1)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 1)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 1)
(s957 0)
(s958 0)
(s959 0)
(s960 1)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 1)
(s972 0)
(s973 1)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 1)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 1)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/3406 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 6285ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1728 transition count 1052
Reduce places removed 626 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 698 rules applied. Total rules applied 1324 place count 1102 transition count 980
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1372 place count 1054 transition count 980
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1372 place count 1054 transition count 781
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1770 place count 855 transition count 781
Performed 338 Post agglomeration using F-continuation condition with reduction of 46 identical transitions.
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2446 place count 517 transition count 397
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 2448 place count 517 transition count 395
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 3 with 4 rules applied. Total rules applied 2452 place count 515 transition count 393
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2548 place count 515 transition count 297
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2644 place count 419 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2645 place count 418 transition count 296
Reduce places removed 118 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 4 with 325 rules applied. Total rules applied 2970 place count 300 transition count 89
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 5 with 207 rules applied. Total rules applied 3177 place count 93 transition count 89
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 3177 place count 93 transition count 60
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 3235 place count 64 transition count 60
Applied a total of 3235 rules in 167 ms. Remains 64 /1728 variables (removed 1664) and now considering 60/1678 (removed 1618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 64/1728 places, 60/1678 transitions.
RANDOM walk for 36 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-03 finished in 75955 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 6 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 625 transitions
Trivial Post-agglo rules discarded 625 transitions
Performed 625 trivial Post agglomeration. Transition count delta: 625
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 1742 transition count 1068
Reduce places removed 625 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 698 rules applied. Total rules applied 1323 place count 1117 transition count 995
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1373 place count 1069 transition count 993
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1375 place count 1067 transition count 993
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1375 place count 1067 transition count 793
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1775 place count 867 transition count 793
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1784 place count 858 transition count 784
Iterating global reduction 4 with 9 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1793 place count 858 transition count 779
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1803 place count 853 transition count 779
Performed 332 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 332 places in 0 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 4 with 664 rules applied. Total rules applied 2467 place count 521 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2468 place count 520 transition count 398
Reduce places removed 28 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 42 rules applied. Total rules applied 2510 place count 492 transition count 384
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2524 place count 478 transition count 384
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 2524 place count 478 transition count 370
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2552 place count 464 transition count 370
Applied a total of 2552 rules in 180 ms. Remains 464 /1743 variables (removed 1279) and now considering 370/1694 (removed 1324) transitions.
// Phase 1: matrix 370 rows 464 cols
[2024-05-31 22:24:56] [INFO ] Computed 120 invariants in 2 ms
[2024-05-31 22:24:56] [INFO ] Implicit Places using invariants in 377 ms returned [386, 392, 398, 404, 408, 412, 416, 420, 424, 428, 432, 436, 440, 444, 448, 458, 463]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 379 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 447/1743 places, 370/1694 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 432 transition count 355
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 432 transition count 355
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 52 place count 421 transition count 344
Applied a total of 52 rules in 25 ms. Remains 421 /447 variables (removed 26) and now considering 344/370 (removed 26) transitions.
// Phase 1: matrix 344 rows 421 cols
[2024-05-31 22:24:56] [INFO ] Computed 103 invariants in 2 ms
[2024-05-31 22:24:56] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-31 22:24:56] [INFO ] Invariant cache hit.
[2024-05-31 22:24:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-31 22:24:58] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned [174, 176, 178, 180, 182, 184, 186, 188, 190]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 1837 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 412/1743 places, 344/1694 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 412 transition count 335
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 403 transition count 335
Applied a total of 18 rules in 12 ms. Remains 403 /412 variables (removed 9) and now considering 335/344 (removed 9) transitions.
// Phase 1: matrix 335 rows 403 cols
[2024-05-31 22:24:58] [INFO ] Computed 94 invariants in 2 ms
[2024-05-31 22:24:58] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-31 22:24:58] [INFO ] Invariant cache hit.
[2024-05-31 22:24:59] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-31 22:25:00] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 403/1743 places, 335/1694 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4435 ms. Remains : 403/1743 places, 335/1694 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-04
Product exploration explored 100000 steps with 1278 reset in 493 ms.
Product exploration explored 100000 steps with 1283 reset in 665 ms.
Computed a total of 21 stabilizing places and 10 stable transitions
Computed a total of 21 stabilizing places and 10 stable transitions
Detected a total of 21/403 stabilizing places and 10/335 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 373 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 901 steps (10 resets) in 8 ms. (100 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (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 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 522 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 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 335/335 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-31 22:25:02] [INFO ] Invariant cache hit.
[2024-05-31 22:25:03] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-31 22:25:03] [INFO ] Invariant cache hit.
[2024-05-31 22:25:03] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-31 22:25:04] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
[2024-05-31 22:25:04] [INFO ] Redundant transitions in 22 ms returned []
Running 316 sub problems to find dead transitions.
[2024-05-31 22:25:04] [INFO ] Invariant cache hit.
[2024-05-31 22:25:04] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 3/403 variables, 93/94 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-05-31 22:25:12] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 3 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 7 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 335/738 variables, 403/500 constraints. Problems are: Problem set: 0 solved, 316 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 107/607 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/738 variables, and 607 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 403/403 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 3/403 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-05-31 22:25:41] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 335/738 variables, 403/501 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 107/608 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 316/924 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 924 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 403/403 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 4/4 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62284 ms. Remains : 403/403 places, 335/335 transitions.
Computed a total of 21 stabilizing places and 10 stable transitions
Computed a total of 21 stabilizing places and 10 stable transitions
Detected a total of 21/403 stabilizing places and 10/335 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 365 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 130 steps (1 resets) in 6 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (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 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 486 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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))]
Product exploration explored 100000 steps with 1282 reset in 418 ms.
Product exploration explored 100000 steps with 1290 reset in 477 ms.
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 335/335 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-31 22:26:07] [INFO ] Invariant cache hit.
[2024-05-31 22:26:07] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-31 22:26:07] [INFO ] Invariant cache hit.
[2024-05-31 22:26:07] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-31 22:26:09] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
[2024-05-31 22:26:09] [INFO ] Redundant transitions in 5 ms returned []
Running 316 sub problems to find dead transitions.
[2024-05-31 22:26:09] [INFO ] Invariant cache hit.
[2024-05-31 22:26:09] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 3/403 variables, 93/94 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-05-31 22:26:15] [INFO ] Deduced a trap composed of 152 places in 121 ms of which 3 ms to minimize.
[2024-05-31 22:26:17] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 3 ms to minimize.
[2024-05-31 22:26:18] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 335/738 variables, 403/500 constraints. Problems are: Problem set: 0 solved, 316 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 107/607 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/738 variables, and 607 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 403/403 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 3/403 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-05-31 22:26:45] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 335/738 variables, 403/501 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 107/608 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 316/924 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 924 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 403/403 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 4/4 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62069 ms. Remains : 403/403 places, 335/335 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-04 finished in 133322 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 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1731 transition count 1682
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1731 transition count 1682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1731 transition count 1681
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 1726 transition count 1676
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1725 transition count 1675
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1725 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1724 transition count 1674
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 551 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-31 22:27:09] [INFO ] Computed 148 invariants in 10 ms
[2024-05-31 22:27:10] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-31 22:27:10] [INFO ] Invariant cache hit.
[2024-05-31 22:27:14] [INFO ] Implicit Places using invariants and state equation in 3446 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-31 22:27:14] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65347 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 463 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 28 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-05 finished in 66486 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))||(p1 U (p2||G(p1)))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1732 transition count 1683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1732 transition count 1683
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1727 transition count 1678
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1727 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1726 transition count 1677
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1726 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1725 transition count 1676
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1725 transition count 1676
Applied a total of 36 rules in 588 ms. Remains 1725 /1743 variables (removed 18) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1725 cols
[2024-05-31 22:28:16] [INFO ] Computed 148 invariants in 7 ms
[2024-05-31 22:28:17] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-31 22:28:17] [INFO ] Invariant cache hit.
[2024-05-31 22:28:20] [INFO ] Implicit Places using invariants and state equation in 3313 ms returned []
Implicit Place search using SMT with State Equation took 4334 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2024-05-31 22:28:20] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/3401 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 1675/1675 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1675 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 1724/3401 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 0/1675 constraints, Known Traps: 0/0 constraints]
After SMT, in 60476ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65422 ms. Remains : 1725/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-06
Product exploration explored 100000 steps with 1004 reset in 287 ms.
Product exploration explored 100000 steps with 995 reset in 309 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 9 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (36 resets) in 618 ms. (64 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
[2024-05-31 22:29:23] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 422/425 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 22:29:23] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1178/1603 variables, 144/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 22:29:24] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 4 ms to minimize.
[2024-05-31 22:29:24] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1603 variables, 2/150 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1603 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 122/1725 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 22:29:25] [INFO ] Deduced a trap composed of 25 places in 841 ms of which 10 ms to minimize.
[2024-05-31 22:29:26] [INFO ] Deduced a trap composed of 17 places in 860 ms of which 10 ms to minimize.
[2024-05-31 22:29:27] [INFO ] Deduced a trap composed of 27 places in 877 ms of which 10 ms to minimize.
[2024-05-31 22:29:28] [INFO ] Deduced a trap composed of 31 places in 976 ms of which 10 ms to minimize.
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 1725/3401 variables, and 155 constraints, problems are : Problem set: 3 solved, 2 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1725 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 422/425 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1178/1603 variables, 144/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1603 variables, 6/154 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 22:29:30] [INFO ] Deduced a trap composed of 24 places in 1417 ms of which 12 ms to minimize.
[2024-05-31 22:29:31] [INFO ] Deduced a trap composed of 33 places in 948 ms of which 12 ms to minimize.
[2024-05-31 22:29:31] [INFO ] Deduced a trap composed of 28 places in 777 ms of which 21 ms to minimize.
[2024-05-31 22:29:32] [INFO ] Deduced a trap composed of 30 places in 794 ms of which 11 ms to minimize.
[2024-05-31 22:29:33] [INFO ] Deduced a trap composed of 38 places in 762 ms of which 10 ms to minimize.
SMT process timed out in 10313ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 1676/1676 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1725 transition count 1053
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 695 rules applied. Total rules applied 1318 place count 1102 transition count 981
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1367 place count 1054 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1053 transition count 980
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1368 place count 1053 transition count 780
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1768 place count 853 transition count 780
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2446 place count 514 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2447 place count 514 transition count 392
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2542 place count 514 transition count 297
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2637 place count 419 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2638 place count 418 transition count 296
Reduce places removed 119 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 5 with 327 rules applied. Total rules applied 2965 place count 299 transition count 88
Reduce places removed 208 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 209 rules applied. Total rules applied 3174 place count 91 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3175 place count 90 transition count 87
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 27 Pre rules applied. Total rules applied 3175 place count 90 transition count 60
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 3229 place count 63 transition count 60
Applied a total of 3229 rules in 169 ms. Remains 63 /1725 variables (removed 1662) and now considering 60/1676 (removed 1616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 63/1725 places, 60/1676 transitions.
RANDOM walk for 40000 steps (604 resets) in 367 ms. (108 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
// Phase 1: matrix 60 rows 63 cols
[2024-05-31 22:29:33] [INFO ] Computed 29 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/63 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/123 variables, 63/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 38/123 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/27 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/63 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 15 factoid took 376 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 453 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Support contains 3 out of 1725 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1725/1725 places, 1676/1676 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 622 transitions
Trivial Post-agglo rules discarded 622 transitions
Performed 622 trivial Post agglomeration. Transition count delta: 622
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 1724 transition count 1053
Reduce places removed 622 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 694 rules applied. Total rules applied 1316 place count 1102 transition count 981
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1365 place count 1054 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1366 place count 1053 transition count 980
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1366 place count 1053 transition count 780
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1766 place count 853 transition count 780
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2444 place count 514 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2445 place count 513 transition count 392
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2517 place count 465 transition count 368
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2541 place count 441 transition count 368
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2541 place count 441 transition count 344
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2589 place count 417 transition count 344
Applied a total of 2589 rules in 135 ms. Remains 417 /1725 variables (removed 1308) and now considering 344/1676 (removed 1332) transitions.
// Phase 1: matrix 344 rows 417 cols
[2024-05-31 22:29:35] [INFO ] Computed 100 invariants in 1 ms
[2024-05-31 22:29:35] [INFO ] Implicit Places using invariants in 475 ms returned [169, 243, 317, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 387, 391, 395, 399, 403, 407, 411, 416]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 477 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 391/1725 places, 344/1676 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 367 transition count 320
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 343 transition count 296
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 0 with 4 rules applied. Total rules applied 100 place count 341 transition count 294
Applied a total of 100 rules in 137 ms. Remains 341 /391 variables (removed 50) and now considering 294/344 (removed 50) transitions.
// Phase 1: matrix 294 rows 341 cols
[2024-05-31 22:29:35] [INFO ] Computed 74 invariants in 1 ms
[2024-05-31 22:29:36] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-31 22:29:36] [INFO ] Invariant cache hit.
[2024-05-31 22:29:37] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 341/1725 places, 294/1676 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1808 ms. Remains : 341/1725 places, 294/1676 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 1023 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (486 resets) in 1703 ms. (23 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
[2024-05-31 22:29:39] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/175 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 199/374 variables, 175/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/635 variables, 166/344 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 71/415 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 0/415 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/635 variables, 0/415 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 415 constraints, problems are : Problem set: 2 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 175/635 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 3/74 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (G (OR p0 p1 (NOT p2))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 1925 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Product exploration explored 100000 steps with 2317 reset in 673 ms.
Product exploration explored 100000 steps with 2277 reset in 829 ms.
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 341 /341 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 22:29:43] [INFO ] Invariant cache hit.
[2024-05-31 22:29:44] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-31 22:29:44] [INFO ] Invariant cache hit.
[2024-05-31 22:29:44] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-31 22:29:44] [INFO ] Redundant transitions in 4 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-31 22:29:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 294/635 variables, 341/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/635 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 415 constraints, problems are : Problem set: 0 solved, 171 unsolved in 12136 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 294/635 variables, 341/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 171/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/635 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 635/635 variables, and 586 constraints, problems are : Problem set: 0 solved, 171 unsolved in 18856 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 31017ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 31019ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32093 ms. Remains : 341/341 places, 294/294 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-06 finished in 120277 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 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1732 transition count 1683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1732 transition count 1683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1732 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 1728 transition count 1678
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 1728 transition count 1678
Applied a total of 31 rules in 318 ms. Remains 1728 /1743 variables (removed 15) and now considering 1678/1694 (removed 16) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-31 22:30:16] [INFO ] Computed 148 invariants in 8 ms
[2024-05-31 22:30:17] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-31 22:30:17] [INFO ] Invariant cache hit.
[2024-05-31 22:30:21] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 4944 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-31 22:30:21] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 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 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 60593ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1743 places, 1678/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65878 ms. Remains : 1728/1743 places, 1678/1694 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-08
Stuttering criterion allowed to conclude after 1079 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-08 finished in 66035 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(G(p0)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 625 transitions
Trivial Post-agglo rules discarded 625 transitions
Performed 625 trivial Post agglomeration. Transition count delta: 625
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 1742 transition count 1068
Reduce places removed 625 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 694 rules applied. Total rules applied 1319 place count 1117 transition count 999
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 46 rules applied. Total rules applied 1365 place count 1072 transition count 998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1366 place count 1071 transition count 998
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1366 place count 1071 transition count 798
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1766 place count 871 transition count 798
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1776 place count 861 transition count 788
Iterating global reduction 4 with 10 rules applied. Total rules applied 1786 place count 861 transition count 788
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1786 place count 861 transition count 783
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1796 place count 856 transition count 783
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 4 with 680 rules applied. Total rules applied 2476 place count 516 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2478 place count 515 transition count 395
Applied a total of 2478 rules in 278 ms. Remains 515 /1743 variables (removed 1228) and now considering 395/1694 (removed 1299) transitions.
// Phase 1: matrix 395 rows 515 cols
[2024-05-31 22:31:22] [INFO ] Computed 148 invariants in 3 ms
[2024-05-31 22:31:23] [INFO ] Implicit Places using invariants in 1202 ms returned [169, 170, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 218, 219, 220, 221, 295, 369, 375, 381, 387, 393, 399, 405, 411, 417, 423, 429, 435, 441, 447, 453, 459, 465, 471, 477, 483, 489, 495, 501, 507, 514]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1209 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 442/1743 places, 395/1694 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 442 transition count 349
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 396 transition count 349
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 117 place count 371 transition count 324
Iterating global reduction 2 with 25 rules applied. Total rules applied 142 place count 371 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 370 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 370 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 369 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 369 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 368 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 368 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 367 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 366 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 365 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 364 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 363 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 362 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 361 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 360 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 359 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 358 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 357 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 356 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 355 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 354 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 353 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 352 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 351 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 350 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 349 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 348 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 347 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 347 transition count 300
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 346 transition count 299
Applied a total of 192 rules in 213 ms. Remains 346 /442 variables (removed 96) and now considering 299/395 (removed 96) transitions.
// Phase 1: matrix 299 rows 346 cols
[2024-05-31 22:31:23] [INFO ] Computed 75 invariants in 2 ms
[2024-05-31 22:31:24] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-31 22:31:24] [INFO ] Invariant cache hit.
[2024-05-31 22:31:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:31:25] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1743 places, 299/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3442 ms. Remains : 346/1743 places, 299/1694 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-10
Product exploration explored 100000 steps with 1190 reset in 884 ms.
Product exploration explored 100000 steps with 1195 reset in 630 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 605 steps (5 resets) in 9 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 299/299 transitions.
Applied a total of 0 rules in 11 ms. Remains 346 /346 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-05-31 22:31:27] [INFO ] Invariant cache hit.
[2024-05-31 22:31:28] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-31 22:31:28] [INFO ] Invariant cache hit.
[2024-05-31 22:31:28] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:31:29] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2024-05-31 22:31:29] [INFO ] Redundant transitions in 3 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-31 22:31:29] [INFO ] Invariant cache hit.
[2024-05-31 22:31:29] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 299/645 variables, 346/421 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 73/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 494 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 299/645 variables, 346/421 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 73/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 297/791 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 791 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61982 ms. Remains : 346/346 places, 299/299 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 485 steps (5 resets) in 10 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1206 reset in 893 ms.
Product exploration explored 100000 steps with 1201 reset in 591 ms.
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 299/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 346 /346 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-05-31 22:32:31] [INFO ] Invariant cache hit.
[2024-05-31 22:32:31] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 22:32:31] [INFO ] Invariant cache hit.
[2024-05-31 22:32:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 22:32:32] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-05-31 22:32:32] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-31 22:32:32] [INFO ] Invariant cache hit.
[2024-05-31 22:32:32] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 299/645 variables, 346/421 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 73/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 297 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 Real declared 645/645 variables, and 494 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 299/645 variables, 346/421 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 73/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 297/791 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 791 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61292 ms. Remains : 346/346 places, 299/299 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-10 finished in 130950 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(G(p0)))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 1742 transition count 1065
Reduce places removed 628 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 701 rules applied. Total rules applied 1329 place count 1114 transition count 992
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1377 place count 1066 transition count 992
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1377 place count 1066 transition count 793
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1775 place count 867 transition count 793
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1784 place count 858 transition count 784
Iterating global reduction 3 with 9 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1793 place count 858 transition count 780
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2556 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2580 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2580 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2628 place count 416 transition count 342
Applied a total of 2628 rules in 233 ms. Remains 416 /1743 variables (removed 1327) and now considering 342/1694 (removed 1352) transitions.
// Phase 1: matrix 342 rows 416 cols
[2024-05-31 22:33:33] [INFO ] Computed 100 invariants in 3 ms
[2024-05-31 22:33:33] [INFO ] Implicit Places using invariants in 599 ms returned [170, 244, 318, 322, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 601 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 389/1743 places, 342/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 364 transition count 317
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 340 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 340 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 339 transition count 292
Applied a total of 100 rules in 193 ms. Remains 339 /389 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 339 cols
[2024-05-31 22:33:34] [INFO ] Computed 73 invariants in 1 ms
[2024-05-31 22:33:34] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-31 22:33:34] [INFO ] Invariant cache hit.
[2024-05-31 22:33:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:33:35] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 339/1743 places, 292/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2082 ms. Remains : 339/1743 places, 292/1694 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-13
Product exploration explored 100000 steps with 1224 reset in 492 ms.
Product exploration explored 100000 steps with 1224 reset in 554 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/339 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 200 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 292/292 transitions.
Applied a total of 0 rules in 11 ms. Remains 339 /339 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-05-31 22:33:36] [INFO ] Invariant cache hit.
[2024-05-31 22:33:37] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-31 22:33:37] [INFO ] Invariant cache hit.
[2024-05-31 22:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:33:38] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2024-05-31 22:33:38] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-31 22:33:38] [INFO ] Invariant cache hit.
[2024-05-31 22:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-31 22:33:42] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/631 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 414 constraints, problems are : Problem set: 0 solved, 170 unsolved in 22587 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 170/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/631 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 584 constraints, problems are : Problem set: 0 solved, 170 unsolved in 28740 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints]
After SMT, in 51360ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 51363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52672 ms. Remains : 339/339 places, 292/292 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/339 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 183 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 347 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1233 reset in 828 ms.
Product exploration explored 100000 steps with 1236 reset in 565 ms.
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 292/292 transitions.
Applied a total of 0 rules in 7 ms. Remains 339 /339 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-05-31 22:34:31] [INFO ] Invariant cache hit.
[2024-05-31 22:34:32] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-31 22:34:32] [INFO ] Invariant cache hit.
[2024-05-31 22:34:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:34:32] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2024-05-31 22:34:33] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-31 22:34:33] [INFO ] Invariant cache hit.
[2024-05-31 22:34:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/631 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 414 constraints, problems are : Problem set: 0 solved, 170 unsolved in 21692 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 170/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/631 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 584 constraints, problems are : Problem set: 0 solved, 170 unsolved in 27214 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints]
After SMT, in 48942ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 48946ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50284 ms. Remains : 339/339 places, 292/292 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-13 finished in 108966 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 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1733 transition count 1684
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1733 transition count 1684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1733 transition count 1683
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 1728 transition count 1678
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1727 transition count 1677
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1726 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1726 transition count 1676
Applied a total of 35 rules in 686 ms. Remains 1726 /1743 variables (removed 17) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2024-05-31 22:35:22] [INFO ] Computed 148 invariants in 7 ms
[2024-05-31 22:35:23] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2024-05-31 22:35:23] [INFO ] Invariant cache hit.
[2024-05-31 22:35:28] [INFO ] Implicit Places using invariants and state equation in 4109 ms returned []
Implicit Place search using SMT with State Equation took 5340 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2024-05-31 22:35:28] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1726 constraints, PredecessorRefiner: 1675/1675 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1726 constraints, PredecessorRefiner: 0/1675 constraints, Known Traps: 0/0 constraints]
After SMT, in 60751ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60771ms
Starting structural reductions in LTL mode, iteration 1 : 1726/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66800 ms. Remains : 1726/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 58287 steps with 54 reset in 336 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-15 finished in 67297 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(G((X(p1)||p0))))'
Found a Lengthening insensitive property : AutoFlight-PT-24b-LTLCardinality-01
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1742 transition count 1067
Reduce places removed 626 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 699 rules applied. Total rules applied 1325 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1374 place count 1068 transition count 993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1375 place count 1067 transition count 993
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1375 place count 1067 transition count 794
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1773 place count 868 transition count 794
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1782 place count 859 transition count 785
Iterating global reduction 4 with 9 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1791 place count 859 transition count 780
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2477 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2478 place count 515 transition count 393
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2550 place count 467 transition count 369
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2574 place count 443 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2574 place count 443 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2622 place count 419 transition count 345
Applied a total of 2622 rules in 313 ms. Remains 419 /1743 variables (removed 1324) and now considering 345/1694 (removed 1349) transitions.
// Phase 1: matrix 345 rows 419 cols
[2024-05-31 22:36:29] [INFO ] Computed 100 invariants in 2 ms
[2024-05-31 22:36:30] [INFO ] Implicit Places using invariants in 608 ms returned [173, 247, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 413, 418]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 620 ms to find 27 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/1743 places, 345/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 367 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 363 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 362 transition count 315
Applied a total of 60 rules in 56 ms. Remains 362 /392 variables (removed 30) and now considering 315/345 (removed 30) transitions.
// Phase 1: matrix 315 rows 362 cols
[2024-05-31 22:36:30] [INFO ] Computed 73 invariants in 1 ms
[2024-05-31 22:36:30] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-31 22:36:31] [INFO ] Invariant cache hit.
[2024-05-31 22:36:31] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 22:36:32] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 362/1743 places, 315/1694 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2669 ms. Remains : 362/1743 places, 315/1694 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01
Product exploration explored 100000 steps with 1197 reset in 569 ms.
Product exploration explored 100000 steps with 1198 reset in 524 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 203 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (477 resets) in 815 ms. (49 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
[2024-05-31 22:36:34] [INFO ] Invariant cache hit.
[2024-05-31 22:36:34] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/151 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 58/209 variables, 45/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 144/353 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 178/531 variables, 154/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 27/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 146/677 variables, 93/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 40/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/677 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/677 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 466 constraints, problems are : Problem set: 0 solved, 3 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/151 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 58/209 variables, 45/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 144/353 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 178/531 variables, 154/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 27/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 146/677 variables, 93/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/677 variables, 40/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/677 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/677 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 469 constraints, problems are : Problem set: 0 solved, 3 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1615ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 869 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 315/315 transitions.
Free-agglomeration rule applied 121 times.
Iterating global reduction 0 with 121 rules applied. Total rules applied 121 place count 362 transition count 194
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t260.t373 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 116 edges and 196 vertex of which 14 / 196 are part of one of the 1 SCC in 5 ms
Free SCC test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 86 rules applied. Total rules applied 207 place count 183 transition count 109
Reduce places removed 83 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 316 place count 100 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 316 place count 100 transition count 79
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 324 place count 96 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 96 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 331 place count 93 transition count 75
Applied a total of 331 rules in 61 ms. Remains 93 /362 variables (removed 269) and now considering 75/315 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 93/362 places, 75/315 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/3 properties
BEST_FIRST walk for 1258 steps (0 resets) in 8 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 540 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 315/315 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-05-31 22:36:37] [INFO ] Invariant cache hit.
[2024-05-31 22:36:38] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-31 22:36:38] [INFO ] Invariant cache hit.
[2024-05-31 22:36:38] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 22:36:39] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-31 22:36:39] [INFO ] Invariant cache hit.
[2024-05-31 22:36:39] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/362 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:36:47] [INFO ] Deduced a trap composed of 89 places in 298 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 315/677 variables, 362/436 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 31/467 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 88 places in 249 ms of which 5 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 93 places in 256 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 (/ 3.0 4.0))
(s14 (/ 1.0 4.0))
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 (/ 3.0 4.0))
(s21 0.0)
(s22 (/ 1.0 4.0))
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 (/ 3.0 4.0))
(s29 (/ 1.0 4.0))
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 3.0 4.0))
(s37 (/ 1.0 4.0))
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 (/ 3.0 4.0))
(s45 (/ 1.0 4.0))
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 (/ 3.0 4.0))
(s52 0.0)
(s53 (/ 1.0 4.0))
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 (/ 3.0 4.0))
(s59 (/ 1.0 4.0))
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 (/ 3.0 4.0))
(s66 0.0)
(s67 (/ 1.0 4.0))
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/677 variables, and 469 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/362 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 315/677 variables, 362/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 31/469 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 229/698 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 698 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 62070 ms. Remains : 362/362 places, 315/315 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 211 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (484 resets) in 1972 ms. (20 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
[2024-05-31 22:37:40] [INFO ] Invariant cache hit.
[2024-05-31 22:37:40] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/151 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 58/209 variables, 45/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 144/353 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 178/531 variables, 154/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 27/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 146/677 variables, 93/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 40/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/677 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/677 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 466 constraints, problems are : Problem set: 0 solved, 3 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/151 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 58/209 variables, 45/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 144/353 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 178/531 variables, 154/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 27/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 146/677 variables, 93/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/677 variables, 40/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/677 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/677 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 469 constraints, problems are : Problem set: 0 solved, 3 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1491ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1264 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 315/315 transitions.
Free-agglomeration rule applied 121 times.
Iterating global reduction 0 with 121 rules applied. Total rules applied 121 place count 362 transition count 194
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t260.t373 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 116 edges and 196 vertex of which 14 / 196 are part of one of the 1 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 86 rules applied. Total rules applied 207 place count 183 transition count 109
Reduce places removed 83 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 316 place count 100 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 316 place count 100 transition count 79
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 96 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 96 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 331 place count 93 transition count 75
Applied a total of 331 rules in 31 ms. Remains 93 /362 variables (removed 269) and now considering 75/315 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 93/362 places, 75/315 transitions.
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/3 properties
BEST_FIRST walk for 769 steps (0 resets) in 5 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 580 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1192 reset in 663 ms.
Product exploration explored 100000 steps with 1191 reset in 761 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 315/315 transitions.
Applied a total of 0 rules in 5 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-05-31 22:37:46] [INFO ] Invariant cache hit.
[2024-05-31 22:37:46] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 22:37:46] [INFO ] Invariant cache hit.
[2024-05-31 22:37:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 22:37:48] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-31 22:37:48] [INFO ] Invariant cache hit.
[2024-05-31 22:37:48] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/362 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:37:55] [INFO ] Deduced a trap composed of 89 places in 294 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 315/677 variables, 362/436 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 31/467 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:38:15] [INFO ] Deduced a trap composed of 88 places in 291 ms of which 5 ms to minimize.
[2024-05-31 22:38:15] [INFO ] Deduced a trap composed of 93 places in 272 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/677 variables, and 469 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 2/362 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 315/677 variables, 362/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 31/469 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 229/698 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 698 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 362/362 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 3/3 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in LTL mode , in 1 iterations and 61935 ms. Remains : 362/362 places, 315/315 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 138896 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(p0))||(p1 U (p2||G(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-24b-LTLCardinality-06
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 625 transitions
Trivial Post-agglo rules discarded 625 transitions
Performed 625 trivial Post agglomeration. Transition count delta: 625
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 1742 transition count 1068
Reduce places removed 625 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 697 rules applied. Total rules applied 1322 place count 1117 transition count 996
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1371 place count 1069 transition count 995
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1372 place count 1068 transition count 995
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1372 place count 1068 transition count 795
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1772 place count 868 transition count 795
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1782 place count 858 transition count 785
Iterating global reduction 4 with 10 rules applied. Total rules applied 1792 place count 858 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1792 place count 858 transition count 780
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1802 place count 853 transition count 780
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2480 place count 514 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2481 place count 513 transition count 392
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2553 place count 465 transition count 368
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2577 place count 441 transition count 368
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2577 place count 441 transition count 344
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2625 place count 417 transition count 344
Applied a total of 2625 rules in 275 ms. Remains 417 /1743 variables (removed 1326) and now considering 344/1694 (removed 1350) transitions.
// Phase 1: matrix 344 rows 417 cols
[2024-05-31 22:38:49] [INFO ] Computed 100 invariants in 2 ms
[2024-05-31 22:38:49] [INFO ] Implicit Places using invariants in 450 ms returned [169, 243, 317, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 387, 391, 395, 399, 403, 407, 411, 416]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 451 ms to find 26 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 391/1743 places, 344/1694 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 367 transition count 320
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 343 transition count 296
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 0 with 4 rules applied. Total rules applied 100 place count 341 transition count 294
Applied a total of 100 rules in 118 ms. Remains 341 /391 variables (removed 50) and now considering 294/344 (removed 50) transitions.
// Phase 1: matrix 294 rows 341 cols
[2024-05-31 22:38:49] [INFO ] Computed 74 invariants in 1 ms
[2024-05-31 22:38:49] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 22:38:49] [INFO ] Invariant cache hit.
[2024-05-31 22:38:50] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 341/1743 places, 294/1694 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1902 ms. Remains : 341/1743 places, 294/1694 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-06
Product exploration explored 100000 steps with 2276 reset in 664 ms.
Product exploration explored 100000 steps with 2316 reset in 723 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 698 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 9 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
RANDOM walk for 40000 steps (490 resets) in 2531 ms. (15 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
[2024-05-31 22:38:54] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/175 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 199/374 variables, 175/178 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/635 variables, 166/344 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 71/415 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 0/415 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/635 variables, 0/415 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 415 constraints, problems are : Problem set: 3 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 175/635 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/74 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (G (OR p0 p1 (NOT p2))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 p2))), (F p0)]
Knowledge based reduction with 5 factoid took 1095 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 486 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 609 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 341 /341 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 22:38:56] [INFO ] Invariant cache hit.
[2024-05-31 22:38:57] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-31 22:38:57] [INFO ] Invariant cache hit.
[2024-05-31 22:38:57] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2024-05-31 22:38:58] [INFO ] Redundant transitions in 2 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-31 22:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 294/635 variables, 341/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/635 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 415 constraints, problems are : Problem set: 0 solved, 171 unsolved in 18032 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 294/635 variables, 341/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 171/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/635 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 635/635 variables, and 586 constraints, problems are : Problem set: 0 solved, 171 unsolved in 24405 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 42481ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 42485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43910 ms. Remains : 341/341 places, 294/294 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 1288 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 617 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (490 resets) in 2251 ms. (17 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
[2024-05-31 22:39:43] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/175 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 199/374 variables, 175/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/635 variables, 166/344 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 71/415 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 0/415 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/635 variables, 0/415 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 415 constraints, problems are : Problem set: 2 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 175/635 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/74 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (OR p0 p1 (NOT p2))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 2723 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 499 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 573 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 490 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Product exploration explored 100000 steps with 2253 reset in 927 ms.
Product exploration explored 100000 steps with 2309 reset in 718 ms.
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 341 /341 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 22:39:49] [INFO ] Invariant cache hit.
[2024-05-31 22:39:50] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-31 22:39:50] [INFO ] Invariant cache hit.
[2024-05-31 22:39:51] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2024-05-31 22:39:51] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-31 22:39:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 294/635 variables, 341/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/635 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 415 constraints, problems are : Problem set: 0 solved, 171 unsolved in 19070 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 294/635 variables, 341/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 171/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/635 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 635/635 variables, and 586 constraints, problems are : Problem set: 0 solved, 171 unsolved in 22495 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 41601ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 41604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43057 ms. Remains : 341/341 places, 294/294 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-06 finished in 104303 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(G(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' '!(F(G(p0)))'
[2024-05-31 22:40:33] [INFO ] Flatten gal took : 136 ms
[2024-05-31 22:40:33] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-05-31 22:40:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1743 places, 1694 transitions and 4118 arcs took 21 ms.
Total runtime 1311919 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 LTLCardinality -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="AutoFlight-PT-24b"
export BK_EXAMINATION="LTLCardinality"
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 AutoFlight-PT-24b, examination is LTLCardinality"
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-171620167200179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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