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.r026-smll-171620167200180.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 itstools
Input is AutoFlight-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167200180
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716290036154

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 11:13:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 11:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:13:59] [INFO ] Load time of PNML (sax parser for PT used): 466 ms
[2024-05-21 11:13:59] [INFO ] Transformed 2230 places.
[2024-05-21 11:13:59] [INFO ] Transformed 2228 transitions.
[2024-05-21 11:13:59] [INFO ] Found NUPN structural information;
[2024-05-21 11:13:59] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 919 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-24b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 1928 transition count 1926
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 1928 transition count 1926
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 651 place count 1928 transition count 1879
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 787 place count 1792 transition count 1743
Iterating global reduction 1 with 136 rules applied. Total rules applied 923 place count 1792 transition count 1743
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 944 place count 1771 transition count 1722
Iterating global reduction 1 with 21 rules applied. Total rules applied 965 place count 1771 transition count 1722
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 986 place count 1750 transition count 1701
Iterating global reduction 1 with 21 rules applied. Total rules applied 1007 place count 1750 transition count 1701
Applied a total of 1007 rules in 2351 ms. Remains 1750 /2230 variables (removed 480) and now considering 1701/2228 (removed 527) transitions.
// Phase 1: matrix 1701 rows 1750 cols
[2024-05-21 11:14:02] [INFO ] Computed 148 invariants in 66 ms
[2024-05-21 11:14:04] [INFO ] Implicit Places using invariants in 1602 ms returned []
[2024-05-21 11:14:04] [INFO ] Invariant cache hit.
[2024-05-21 11:14:08] [INFO ] Implicit Places using invariants and state equation in 4438 ms returned []
Implicit Place search using SMT with State Equation took 6092 ms to find 0 implicit places.
Running 1700 sub problems to find dead transitions.
[2024-05-21 11:14:08] [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 1749/3451 variables, and 0 constraints, problems are : Problem set: 0 solved, 1700 unsolved in 30145 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1750 constraints, PredecessorRefiner: 1700/1700 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1700 unsolved
(s838 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1749/3451 variables, and 0 constraints, problems are : Problem set: 0 solved, 1700 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1750 constraints, PredecessorRefiner: 0/1700 constraints, Known Traps: 0/0 constraints]
After SMT, in 61191ms problems are : Problem set: 0 solved, 1700 unsolved
Search for dead transitions found 0 dead transitions in 61266ms
Starting structural reductions in LTL mode, iteration 1 : 1750/2230 places, 1701/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69777 ms. Remains : 1750/2230 places, 1701/2228 transitions.
Support contains 44 out of 1750 places after structural reductions.
[2024-05-21 11:15:10] [INFO ] Flatten gal took : 275 ms
[2024-05-21 11:15:10] [INFO ] Flatten gal took : 159 ms
[2024-05-21 11:15:11] [INFO ] Input system was already deterministic with 1701 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (36 resets) in 3180 ms. (12 steps per ms) remains 16/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
[2024-05-21 11:15:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 590/612 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1630 variables, 129/147 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1630 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 120/1750 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1701/3451 variables, 1750/1898 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3451 variables, 0/1898 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3451/3451 variables, and 1898 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1750/1750 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 590/612 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1630 variables, 129/147 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 11:15:20] [INFO ] Deduced a trap composed of 22 places in 1304 ms of which 122 ms to minimize.
[2024-05-21 11:15:21] [INFO ] Deduced a trap composed of 16 places in 1088 ms of which 13 ms to minimize.
[2024-05-21 11:15:22] [INFO ] Deduced a trap composed of 34 places in 1007 ms of which 12 ms to minimize.
[2024-05-21 11:15:23] [INFO ] Deduced a trap composed of 39 places in 1019 ms of which 12 ms to minimize.
SMT process timed out in 11052ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 1750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1750/1750 places, 1701/1701 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 1750 transition count 1073
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 1122 transition count 1000
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 1378 place count 1074 transition count 999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1379 place count 1073 transition count 999
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 193 Pre rules applied. Total rules applied 1379 place count 1073 transition count 806
Deduced a syphon composed of 193 places in 7 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 4 with 386 rules applied. Total rules applied 1765 place count 880 transition count 806
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1767 place count 878 transition count 804
Iterating global reduction 4 with 2 rules applied. Total rules applied 1769 place count 878 transition count 804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1769 place count 878 transition count 803
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1771 place count 877 transition count 803
Performed 345 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 345 places in 0 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 4 with 690 rules applied. Total rules applied 2461 place count 532 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2462 place count 532 transition count 410
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 94 times.
Iterating global reduction 5 with 94 rules applied. Total rules applied 2556 place count 532 transition count 316
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 2650 place count 438 transition count 316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2651 place count 437 transition count 315
Reduce places removed 107 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 6 with 263 rules applied. Total rules applied 2914 place count 330 transition count 159
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 7 with 156 rules applied. Total rules applied 3070 place count 174 transition count 159
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 49 Pre rules applied. Total rules applied 3070 place count 174 transition count 110
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 3168 place count 125 transition count 110
Applied a total of 3168 rules in 739 ms. Remains 125 /1750 variables (removed 1625) and now considering 110/1701 (removed 1591) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 739 ms. Remains : 125/1750 places, 110/1701 transitions.
RANDOM walk for 5895 steps (166 resets) in 198 ms. (29 steps per ms) remains 0/16 properties
Computed a total of 430 stabilizing places and 430 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' '!(G(F(p0)))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 634 transitions
Trivial Post-agglo rules discarded 634 transitions
Performed 634 trivial Post agglomeration. Transition count delta: 634
Iterating post reduction 0 with 634 rules applied. Total rules applied 634 place count 1749 transition count 1066
Reduce places removed 634 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 707 rules applied. Total rules applied 1341 place count 1115 transition count 993
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1389 place count 1067 transition count 993
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1389 place count 1067 transition count 793
Deduced a syphon composed of 200 places in 28 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1789 place count 867 transition count 793
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1797 place count 859 transition count 785
Iterating global reduction 3 with 8 rules applied. Total rules applied 1805 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1805 place count 859 transition count 780
Deduced a syphon composed of 5 places in 17 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1815 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 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2491 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 3 with 1 rules applied. Total rules applied 2492 place count 515 transition count 393
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 68 rules applied. Total rules applied 2560 place count 469 transition count 371
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2582 place count 447 transition count 371
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2582 place count 447 transition count 347
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2630 place count 423 transition count 347
Applied a total of 2630 rules in 550 ms. Remains 423 /1750 variables (removed 1327) and now considering 347/1701 (removed 1354) transitions.
// Phase 1: matrix 347 rows 423 cols
[2024-05-21 11:15:25] [INFO ] Computed 102 invariants in 8 ms
[2024-05-21 11:15:26] [INFO ] Implicit Places using invariants in 553 ms returned [175, 249, 323, 327, 331, 335, 339, 343, 348, 352, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 413, 417, 422]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 563 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/1750 places, 347/1701 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 371 transition count 322
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 370 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 349 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 348 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 348 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 347 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 347 transition count 298
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 0 with 2 rules applied. Total rules applied 100 place count 346 transition count 297
Applied a total of 100 rules in 485 ms. Remains 346 /396 variables (removed 50) and now considering 297/347 (removed 50) transitions.
// Phase 1: matrix 297 rows 346 cols
[2024-05-21 11:15:26] [INFO ] Computed 75 invariants in 3 ms
[2024-05-21 11:15:26] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 11:15:26] [INFO ] Invariant cache hit.
[2024-05-21 11:15:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:15:27] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1750 places, 297/1701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2484 ms. Remains : 346/1750 places, 297/1701 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-00
Product exploration explored 100000 steps with 1237 reset in 1149 ms.
Product exploration explored 100000 steps with 1236 reset in 801 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7948 steps (93 resets) in 63 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 297/297 transitions.
Applied a total of 0 rules in 31 ms. Remains 346 /346 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-21 11:15:30] [INFO ] Invariant cache hit.
[2024-05-21 11:15:30] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-21 11:15:30] [INFO ] Invariant cache hit.
[2024-05-21 11:15:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:15:31] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-05-21 11:15:31] [INFO ] Redundant transitions in 31 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 11:15:31] [INFO ] Invariant cache hit.
[2024-05-21 11:15:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 11:15:37] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 424 constraints, problems are : Problem set: 0 solved, 175 unsolved in 21847 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 175/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 599 constraints, problems are : Problem set: 0 solved, 175 unsolved in 23100 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
After SMT, in 45047ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 45052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46649 ms. Remains : 346/346 places, 297/297 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3384 steps (38 resets) in 28 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1245 reset in 812 ms.
Product exploration explored 100000 steps with 1235 reset in 554 ms.
Built C files in :
/tmp/ltsmin12343113993295246692
[2024-05-21 11:16:19] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-21 11:16:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:16:19] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-21 11:16:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:16:19] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-21 11:16:19] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:16:19] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12343113993295246692
Running compilation step : cd /tmp/ltsmin12343113993295246692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2022 ms.
Running link step : cd /tmp/ltsmin12343113993295246692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin12343113993295246692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12394803521954696596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 346 /346 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-21 11:16:34] [INFO ] Invariant cache hit.
[2024-05-21 11:16:34] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-21 11:16:34] [INFO ] Invariant cache hit.
[2024-05-21 11:16:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:16:35] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2024-05-21 11:16:35] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 11:16:35] [INFO ] Invariant cache hit.
[2024-05-21 11:16:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 11:16:39] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/643 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 424 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17820 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/346 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 297/643 variables, 346/422 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 175/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/643 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 599 constraints, problems are : Problem set: 0 solved, 175 unsolved in 22493 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 346/346 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
After SMT, in 40358ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 40362ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41402 ms. Remains : 346/346 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin1007469291055009540
[2024-05-21 11:17:15] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-21 11:17:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:17:15] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-21 11:17:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:17:15] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-21 11:17:15] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:17:15] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1007469291055009540
Running compilation step : cd /tmp/ltsmin1007469291055009540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1312 ms.
Running link step : cd /tmp/ltsmin1007469291055009540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1007469291055009540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11630166398441533929.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:17:30] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:17:30] [INFO ] Flatten gal took : 25 ms
[2024-05-21 11:17:30] [INFO ] Time to serialize gal into /tmp/LTL5019335106238141707.gal : 8 ms
[2024-05-21 11:17:30] [INFO ] Time to serialize properties into /tmp/LTL4180790098196071683.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5019335106238141707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8705777915734338587.hoa' '-atoms' '/tmp/LTL4180790098196071683.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4180790098196071683.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8705777915734338587.hoa
Reverse transition relation is NOT exact ! Due to transitions t230.t371, t242.t371, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-21 11:17:46] [INFO ] Flatten gal took : 14 ms
[2024-05-21 11:17:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:17:46] [INFO ] Time to serialize gal into /tmp/LTL15201173738988407207.gal : 4 ms
[2024-05-21 11:17:46] [INFO ] Time to serialize properties into /tmp/LTL3333612726238410500.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15201173738988407207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3333612726238410500.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p872==1)||(p320==0))"))))
Formula 0 simplified : FG!"((p872==1)||(p320==0))"
Reverse transition relation is NOT exact ! Due to transitions t230.t371, t242.t371, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-21 11:18:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:18:01] [INFO ] Applying decomposition
[2024-05-21 11:18:01] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7837273674015495190.txt' '-o' '/tmp/graph7837273674015495190.bin' '-w' '/tmp/graph7837273674015495190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7837273674015495190.bin' '-l' '-1' '-v' '-w' '/tmp/graph7837273674015495190.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:18:01] [INFO ] Decomposing Gal with order
[2024-05-21 11:18:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:18:01] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-21 11:18:01] [INFO ] Flatten gal took : 79 ms
[2024-05-21 11:18:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 11:18:01] [INFO ] Time to serialize gal into /tmp/LTL2923090298512341571.gal : 12 ms
[2024-05-21 11:18:01] [INFO ] Time to serialize properties into /tmp/LTL10653792771988357203.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2923090298512341571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10653792771988357203.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u57.p872==1)||(i8.u15.p320==0))"))))
Formula 0 simplified : FG!"((i1.u57.p872==1)||(i8.u15.p320==0))"
Reverse transition relation is NOT exact ! Due to transitions t230_t371, t242_t371, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 6.30823e+09 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
185 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.9327,58696,1,0,76559,29318,3747,147202,1279,94146,82995
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLFireability-00 finished in 158849 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||X(p1)))))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1729 transition count 1680
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1729 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1727 transition count 1678
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1727 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1725 transition count 1676
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1725 transition count 1676
Applied a total of 50 rules in 779 ms. Remains 1725 /1750 variables (removed 25) and now considering 1676/1701 (removed 25) transitions.
// Phase 1: matrix 1676 rows 1725 cols
[2024-05-21 11:18:04] [INFO ] Computed 148 invariants in 20 ms
[2024-05-21 11:18:05] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2024-05-21 11:18:05] [INFO ] Invariant cache hit.
[2024-05-21 11:18:10] [INFO ] Implicit Places using invariants and state equation in 4657 ms returned []
Implicit Place search using SMT with State Equation took 6078 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2024-05-21 11:18:10] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30052 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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30054 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 60854ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60879ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1676/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67740 ms. Remains : 1725/1750 places, 1676/1701 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 688 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-01 finished in 67995 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(((p0&&F(!p1)) U (p2&&X(p3)))))'
Support contains 5 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1737 transition count 1688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1737 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 1732 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 1732 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1730 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1728 transition count 1678
Applied a total of 45 rules in 780 ms. Remains 1728 /1750 variables (removed 22) and now considering 1678/1701 (removed 23) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-21 11:19:12] [INFO ] Computed 148 invariants in 14 ms
[2024-05-21 11:19:13] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-21 11:19:13] [INFO ] Invariant cache hit.
[2024-05-21 11:19:17] [INFO ] Implicit Places using invariants and state equation in 4163 ms returned []
Implicit Place search using SMT with State Equation took 4977 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-21 11:19:17] [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 30073 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 30059 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 60525ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1750 places, 1678/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66316 ms. Remains : 1728/1750 places, 1678/1701 transitions.
Stuttering acceptance computed with spot in 460 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, p1, (NOT p3), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-02 finished in 66825 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((p0&&X((p1&&F((p2&&X(p3))))))))'
Support contains 3 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1737 transition count 1688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1737 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 1732 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 1732 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1730 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1728 transition count 1678
Applied a total of 45 rules in 1050 ms. Remains 1728 /1750 variables (removed 22) and now considering 1678/1701 (removed 23) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-21 11:20:19] [INFO ] Computed 148 invariants in 15 ms
[2024-05-21 11:20:20] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2024-05-21 11:20:20] [INFO ] Invariant cache hit.
[2024-05-21 11:20:25] [INFO ] Implicit Places using invariants and state equation in 4777 ms returned []
Implicit Place search using SMT with State Equation took 5927 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-21 11:20:25] [INFO ] Invariant cache hit.
(s1723 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30042 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 30034 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 60621ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1750 places, 1678/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67639 ms. Remains : 1728/1750 places, 1678/1701 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p2) (NOT p3) (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-03 finished in 67970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||(p2&&(p1 U (G(p1)||(p1&&G((p3&&F(p4)))))))))))'
Support contains 4 out of 1750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 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 1749 transition count 1073
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 697 rules applied. Total rules applied 1324 place count 1122 transition count 1003
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 49 rules applied. Total rules applied 1373 place count 1076 transition count 1000
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1376 place count 1073 transition count 1000
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 1376 place count 1073 transition count 798
Deduced a syphon composed of 202 places in 6 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 1780 place count 871 transition count 798
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1789 place count 862 transition count 789
Iterating global reduction 4 with 9 rules applied. Total rules applied 1798 place count 862 transition count 789
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1798 place count 862 transition count 784
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1808 place count 857 transition count 784
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2484 place count 519 transition count 398
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 2486 place count 518 transition count 398
Applied a total of 2486 rules in 405 ms. Remains 518 /1750 variables (removed 1232) and now considering 398/1701 (removed 1303) transitions.
// Phase 1: matrix 398 rows 518 cols
[2024-05-21 11:21:26] [INFO ] Computed 148 invariants in 2 ms
[2024-05-21 11:21:27] [INFO ] Implicit Places using invariants in 759 ms returned [172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 184, 185, 186, 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, 215, 216, 217, 221, 222, 223, 224, 298, 372, 378, 384, 390, 396, 402, 408, 414, 420, 426, 432, 438, 444, 450, 456, 462, 468, 474, 480, 486, 492, 498, 504, 510, 517]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 762 ms to find 72 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/1750 places, 398/1701 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 0 with 45 rules applied. Total rules applied 45 place count 446 transition count 353
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 401 transition count 353
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 115 place count 376 transition count 328
Iterating global reduction 2 with 25 rules applied. Total rules applied 140 place count 376 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 375 transition count 327
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 375 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 374 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 374 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 373 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 373 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 372 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 372 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 371 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 371 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 370 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 370 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 369 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 369 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 368 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 368 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 367 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 367 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 366 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 365 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 364 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 363 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 362 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 361 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 360 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 359 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 358 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 357 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 356 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 355 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 354 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 353 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 352 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 352 transition count 304
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 2 with 2 rules applied. Total rules applied 190 place count 351 transition count 303
Applied a total of 190 rules in 196 ms. Remains 351 /446 variables (removed 95) and now considering 303/398 (removed 95) transitions.
// Phase 1: matrix 303 rows 351 cols
[2024-05-21 11:21:27] [INFO ] Computed 76 invariants in 2 ms
[2024-05-21 11:21:28] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 11:21:28] [INFO ] Invariant cache hit.
[2024-05-21 11:21:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 11:21:29] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 351/1750 places, 303/1701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2752 ms. Remains : 351/1750 places, 303/1701 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-04
Product exploration explored 100000 steps with 1600 reset in 1009 ms.
Product exploration explored 100000 steps with 1606 reset in 777 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3 p4), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 1552 ms. Reduced automaton from 7 states, 29 edges and 5 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
RANDOM walk for 3180 steps (34 resets) in 41 ms. (75 steps per ms) remains 0/18 properties
Knowledge obtained : [(AND p0 p1 p2 p3 p4), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p4))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p4))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (AND p1 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT p4)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p3) p4))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p1 p3))), (F (NOT p2)), (F (NOT (OR p1 p4))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 21 factoid took 2847 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Support contains 4 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 303/303 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-21 11:21:36] [INFO ] Invariant cache hit.
[2024-05-21 11:21:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 11:21:37] [INFO ] Invariant cache hit.
[2024-05-21 11:21:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 11:21:38] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
[2024-05-21 11:21:38] [INFO ] Redundant transitions in 7 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 11:21:38] [INFO ] Invariant cache hit.
[2024-05-21 11:21:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 499 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 800 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61626 ms. Remains : 351/351 places, 303/303 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p3 p4 p2), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 22 factoid took 1453 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
RANDOM walk for 2430 steps (26 resets) in 36 ms. (65 steps per ms) remains 0/18 properties
Knowledge obtained : [(AND p1 p3 p4 p2), (X p2), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X p3), (X p4), (X (AND p1 p3)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 (NOT p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p4))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p4))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (AND p1 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT p4)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p3) p4))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p1 p3))), (F (NOT p2)), (F (NOT (OR p1 p4))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 22 factoid took 2377 ms. Reduced automaton from 5 states, 23 edges and 4 AP (stutter insensitive) to 5 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))]
Product exploration explored 100000 steps with 1577 reset in 954 ms.
Product exploration explored 100000 steps with 1600 reset in 727 ms.
Built C files in :
/tmp/ltsmin7917995677096473084
[2024-05-21 11:22:45] [INFO ] Computing symmetric may disable matrix : 303 transitions.
[2024-05-21 11:22:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:22:45] [INFO ] Computing symmetric may enable matrix : 303 transitions.
[2024-05-21 11:22:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:22:45] [INFO ] Computing Do-Not-Accords matrix : 303 transitions.
[2024-05-21 11:22:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:22:45] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7917995677096473084
Running compilation step : cd /tmp/ltsmin7917995677096473084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1585 ms.
Running link step : cd /tmp/ltsmin7917995677096473084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7917995677096473084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3775025791356174416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 303/303 transitions.
Applied a total of 0 rules in 16 ms. Remains 351 /351 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-05-21 11:23:00] [INFO ] Invariant cache hit.
[2024-05-21 11:23:00] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 11:23:00] [INFO ] Invariant cache hit.
[2024-05-21 11:23:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 11:23:02] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-21 11:23:02] [INFO ] Redundant transitions in 3 ms returned []
Running 301 sub problems to find dead transitions.
[2024-05-21 11:23:02] [INFO ] Invariant cache hit.
[2024-05-21 11:23:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 499 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 303/654 variables, 351/427 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 72/499 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 800 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61793 ms. Remains : 351/351 places, 303/303 transitions.
Built C files in :
/tmp/ltsmin1640630541182696289
[2024-05-21 11:24:02] [INFO ] Computing symmetric may disable matrix : 303 transitions.
[2024-05-21 11:24:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:24:02] [INFO ] Computing symmetric may enable matrix : 303 transitions.
[2024-05-21 11:24:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:24:02] [INFO ] Computing Do-Not-Accords matrix : 303 transitions.
[2024-05-21 11:24:02] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:24:02] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1640630541182696289
Running compilation step : cd /tmp/ltsmin1640630541182696289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1336 ms.
Running link step : cd /tmp/ltsmin1640630541182696289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1640630541182696289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15824807005022924584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:24:17] [INFO ] Flatten gal took : 26 ms
[2024-05-21 11:24:17] [INFO ] Flatten gal took : 25 ms
[2024-05-21 11:24:17] [INFO ] Time to serialize gal into /tmp/LTL9237266357324743046.gal : 5 ms
[2024-05-21 11:24:17] [INFO ] Time to serialize properties into /tmp/LTL12885752222446462047.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9237266357324743046.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14756686107181324028.hoa' '-atoms' '/tmp/LTL12885752222446462047.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12885752222446462047.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14756686107181324028.hoa
Detected timeout of ITS tools.
[2024-05-21 11:24:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:24:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:24:32] [INFO ] Time to serialize gal into /tmp/LTL7714988588938116048.gal : 4 ms
[2024-05-21 11:24:32] [INFO ] Time to serialize properties into /tmp/LTL14207729835615707083.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7714988588938116048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14207729835615707083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p1434==0)"))&&(F((G("(p258!=1)"))||(("(p351!=1)")&&(("(p258!=1)")U((G("(p258!=1)"))||(("(p258!=1)")&&(G(("(p1434!=1)")&&(F("(p...175
Formula 0 simplified : G!"(p1434==0)" | G(F!"(p258!=1)" & (!"(p351!=1)" | (F(!"(p1434!=1)" | G!"(p195!=1)") U !"(p258!=1)")))
Detected timeout of ITS tools.
[2024-05-21 11:24:47] [INFO ] Flatten gal took : 20 ms
[2024-05-21 11:24:47] [INFO ] Applying decomposition
[2024-05-21 11:24:47] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13927883429489588144.txt' '-o' '/tmp/graph13927883429489588144.bin' '-w' '/tmp/graph13927883429489588144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13927883429489588144.bin' '-l' '-1' '-v' '-w' '/tmp/graph13927883429489588144.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:24:47] [INFO ] Decomposing Gal with order
[2024-05-21 11:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:24:47] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-21 11:24:47] [INFO ] Flatten gal took : 54 ms
[2024-05-21 11:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 31 ms.
[2024-05-21 11:24:47] [INFO ] Time to serialize gal into /tmp/LTL2609542764130037886.gal : 12 ms
[2024-05-21 11:24:47] [INFO ] Time to serialize properties into /tmp/LTL3975284999767506876.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2609542764130037886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3975284999767506876.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i16.u73.p1434==0)"))&&(F((G("(i13.u10.p258!=1)"))||(("(i1.u17.p351!=1)")&&(("(i13.u10.p258!=1)")U((G("(i13.u10.p258!=1)"))||((...236
Formula 0 simplified : G!"(i16.u73.p1434==0)" | G(F!"(i13.u10.p258!=1)" & (!"(i1.u17.p351!=1)" | (F(!"(i16.u73.p1434!=1)" | G!"(i1.u5.p195!=1)") U !"(i13.u...170
Reverse transition relation is NOT exact ! Due to transitions t234_t377, t246_t377, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 6.30823e+09 deadlock states
121 unique states visited
4 strongly connected components in search stack
122 transitions explored
121 items max in DFS search stack
587 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.9835,140772,1,0,239807,39153,4688,424055,1353,128437,359084
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLFireability-04 finished in 208443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1734 transition count 1685
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1724 transition count 1674
Applied a total of 53 rules in 1065 ms. Remains 1724 /1750 variables (removed 26) and now considering 1674/1701 (removed 27) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-21 11:24:56] [INFO ] Computed 148 invariants in 18 ms
[2024-05-21 11:24:57] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-21 11:24:57] [INFO ] Invariant cache hit.
[2024-05-21 11:25:01] [INFO ] Implicit Places using invariants and state equation in 4351 ms returned []
Implicit Place search using SMT with State Equation took 5453 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-21 11:25:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30051 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 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 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 30062 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 60656ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
Starting structural reductions in LTL mode, iteration 1 : 1724/1750 places, 1674/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67217 ms. Remains : 1724/1750 places, 1674/1701 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06
Product exploration explored 100000 steps with 334 reset in 460 ms.
Product exploration explored 100000 steps with 344 reset in 511 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 : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1206 steps (0 resets) in 11 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 11:26:04] [INFO ] Invariant cache hit.
[2024-05-21 11:26:06] [INFO ] [Real]Absence check using 147 positive place invariants in 178 ms returned sat
[2024-05-21 11:26:06] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-21 11:26:19] [INFO ] [Real]Absence check using state equation in 13362 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 121 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2024-05-21 11:26:19] [INFO ] Invariant cache hit.
[2024-05-21 11:26:20] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-21 11:26:20] [INFO ] Invariant cache hit.
[2024-05-21 11:26:24] [INFO ] Implicit Places using invariants and state equation in 4039 ms returned []
Implicit Place search using SMT with State Equation took 5024 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-21 11:26:24] [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 30052 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 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 30054 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 60706ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60744ms
Finished structural reductions in LTL mode , in 1 iterations and 65894 ms. Remains : 1724/1724 places, 1674/1674 transitions.
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 : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1173 steps (0 resets) in 9 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 11:27:26] [INFO ] Invariant cache hit.
[2024-05-21 11:27:27] [INFO ] [Real]Absence check using 147 positive place invariants in 160 ms returned sat
[2024-05-21 11:27:27] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 24 ms returned sat
[2024-05-21 11:27:41] [INFO ] [Real]Absence check using state equation in 13587 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 344 reset in 312 ms.
Product exploration explored 100000 steps with 335 reset in 467 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1724 transition count 1674
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 602 place count 1724 transition count 1650
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 602 place count 1724 transition count 1650
Deduced a syphon composed of 800 places in 11 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 824 place count 1724 transition count 1650
Discarding 479 places :
Symmetric choice reduction at 2 with 479 rule applications. Total rules 1303 place count 1245 transition count 1171
Deduced a syphon composed of 321 places in 8 ms
Iterating global reduction 2 with 479 rules applied. Total rules applied 1782 place count 1245 transition count 1171
Performed 411 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 732 places in 0 ms
Iterating global reduction 2 with 411 rules applied. Total rules applied 2193 place count 1245 transition count 1123
Renaming transitions due to excessive name length > 1024 char.
Discarding 265 places :
Symmetric choice reduction at 2 with 265 rule applications. Total rules 2458 place count 980 transition count 858
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 265 rules applied. Total rules applied 2723 place count 980 transition count 858
Deduced a syphon composed of 467 places in 0 ms
Applied a total of 2723 rules in 1189 ms. Remains 980 /1724 variables (removed 744) and now considering 858/1674 (removed 816) transitions.
[2024-05-21 11:27:43] [INFO ] Redundant transitions in 8 ms returned []
Running 857 sub problems to find dead transitions.
// Phase 1: matrix 858 rows 980 cols
[2024-05-21 11:27:43] [INFO ] Computed 148 invariants in 28 ms
[2024-05-21 11:27:43] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/979 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/1838 variables, and 1 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/146 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/980 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/979 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/979 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (OVERLAPS) 1/980 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/980 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 796 ms of which 10 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 846 ms of which 10 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 755 ms of which 8 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 639 ms of which 7 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 618 ms of which 8 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 845 ms of which 13 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 616 ms of which 8 ms to minimize.
[2024-05-21 11:28:46] [INFO ] Deduced a trap composed of 3 places in 858 ms of which 11 ms to minimize.
SMT process timed out in 62831ms, After SMT, problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 62842ms
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1724 places, 858/1674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64055 ms. Remains : 980/1724 places, 858/1674 transitions.
Built C files in :
/tmp/ltsmin4389921943428461690
[2024-05-21 11:28:46] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4389921943428461690
Running compilation step : cd /tmp/ltsmin4389921943428461690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4389921943428461690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4389921943428461690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 150 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-21 11:28:50] [INFO ] Computed 148 invariants in 12 ms
[2024-05-21 11:28:51] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2024-05-21 11:28:51] [INFO ] Invariant cache hit.
[2024-05-21 11:28:55] [INFO ] Implicit Places using invariants and state equation in 3943 ms returned []
Implicit Place search using SMT with State Equation took 5163 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-21 11:28:55] [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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30035 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 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)timeout

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 30040 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 60728ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60764ms
Finished structural reductions in LTL mode , in 1 iterations and 66083 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Built C files in :
/tmp/ltsmin8930130812601884568
[2024-05-21 11:29:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8930130812601884568
Running compilation step : cd /tmp/ltsmin8930130812601884568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8930130812601884568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8930130812601884568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 11:29:59] [INFO ] Flatten gal took : 55 ms
[2024-05-21 11:29:59] [INFO ] Flatten gal took : 43 ms
[2024-05-21 11:29:59] [INFO ] Time to serialize gal into /tmp/LTL11423276778933859652.gal : 25 ms
[2024-05-21 11:29:59] [INFO ] Time to serialize properties into /tmp/LTL6018697209588864954.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11423276778933859652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4430094209287647632.hoa' '-atoms' '/tmp/LTL6018697209588864954.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6018697209588864954.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4430094209287647632.hoa
Detected timeout of ITS tools.
[2024-05-21 11:30:14] [INFO ] Flatten gal took : 39 ms
[2024-05-21 11:30:14] [INFO ] Flatten gal took : 41 ms
[2024-05-21 11:30:14] [INFO ] Time to serialize gal into /tmp/LTL4303764732815519595.gal : 9 ms
[2024-05-21 11:30:14] [INFO ] Time to serialize properties into /tmp/LTL4669570870352506020.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4303764732815519595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4669570870352506020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p1835==1)")))))
Formula 0 simplified : XXG!"(p1835==1)"
Detected timeout of ITS tools.
[2024-05-21 11:30:29] [INFO ] Flatten gal took : 65 ms
[2024-05-21 11:30:29] [INFO ] Applying decomposition
[2024-05-21 11:30:29] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12582651064540615278.txt' '-o' '/tmp/graph12582651064540615278.bin' '-w' '/tmp/graph12582651064540615278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12582651064540615278.bin' '-l' '-1' '-v' '-w' '/tmp/graph12582651064540615278.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:30:29] [INFO ] Decomposing Gal with order
[2024-05-21 11:30:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:30:30] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-21 11:30:30] [INFO ] Flatten gal took : 175 ms
[2024-05-21 11:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 11:30:30] [INFO ] Time to serialize gal into /tmp/LTL7629566849797961314.gal : 21 ms
[2024-05-21 11:30:30] [INFO ] Time to serialize properties into /tmp/LTL1432194385485704730.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7629566849797961314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1432194385485704730.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i34.u579.p1835==1)")))))
Formula 0 simplified : XXG!"(i34.u579.p1835==1)"
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 350478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
Support contains 4 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1728 transition count 1678
Applied a total of 45 rules in 661 ms. Remains 1728 /1750 variables (removed 22) and now considering 1678/1701 (removed 23) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-21 11:30:46] [INFO ] Computed 148 invariants in 7 ms
[2024-05-21 11:30:46] [INFO ] Implicit Places using invariants in 861 ms returned []
[2024-05-21 11:30:46] [INFO ] Invariant cache hit.
[2024-05-21 11:30:50] [INFO ] Implicit Places using invariants and state equation in 3454 ms returned []
Implicit Place search using SMT with State Equation took 4327 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-21 11:30:50] [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 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: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 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 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 60479ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1750 places, 1678/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65494 ms. Remains : 1728/1750 places, 1678/1701 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-07
Product exploration explored 100000 steps with 93 reset in 593 ms.
Product exploration explored 100000 steps with 93 reset in 486 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (36 resets) in 282 ms. (141 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2024-05-21 11:31:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/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 1883 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 11:31:56] [INFO ] Deduced a trap composed of 66 places in 715 ms of which 12 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-21 11:31:57] [INFO ] Deduced a trap composed of 15 places in 986 ms of which 10 ms to minimize.
[2024-05-21 11:31:58] [INFO ] Deduced a trap composed of 29 places in 721 ms of which 11 ms to minimize.
[2024-05-21 11:31:59] [INFO ] Deduced a trap composed of 27 places in 1050 ms of which 15 ms to minimize.
[2024-05-21 11:32:00] [INFO ] Deduced a trap composed of 23 places in 937 ms of which 13 ms to minimize.
SMT process timed out in 7202ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 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 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 1728 transition count 1051
Reduce places removed 627 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 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 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 3 with 398 rules applied. Total rules applied 1772 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 2454 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2550 place count 513 transition count 295
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2646 place count 417 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2647 place count 416 transition count 294
Reduce places removed 119 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 4 with 325 rules applied. Total rules applied 2972 place count 297 transition count 88
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 3178 place count 91 transition count 88
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3178 place count 91 transition count 58
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3238 place count 61 transition count 58
Applied a total of 3238 rules in 153 ms. Remains 61 /1728 variables (removed 1667) and now considering 58/1678 (removed 1620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 61/1728 places, 58/1678 transitions.
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT p1)), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 9 factoid took 407 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2024-05-21 11:32:01] [INFO ] Invariant cache hit.
[2024-05-21 11:32:03] [INFO ] [Real]Absence check using 147 positive place invariants in 257 ms returned sat
[2024-05-21 11:32:03] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 18 ms returned sat
[2024-05-21 11:32:16] [INFO ] [Real]Absence check using state equation in 13213 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 1728 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 168 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2024-05-21 11:32:16] [INFO ] Invariant cache hit.
[2024-05-21 11:32:17] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2024-05-21 11:32:17] [INFO ] Invariant cache hit.
[2024-05-21 11:32:21] [INFO ] Implicit Places using invariants and state equation in 4336 ms returned []
Implicit Place search using SMT with State Equation took 5470 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-21 11:32:21] [INFO ] Invariant cache hit.
(s273 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30055 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 30062 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 60725ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60761ms
Finished structural reductions in LTL mode , in 1 iterations and 66405 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (36 resets) in 420 ms. (95 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-21 11:33:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/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 1807 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1480/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 11:33:26] [INFO ] Deduced a trap composed of 66 places in 699 ms of which 11 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-21 11:33:27] [INFO ] Deduced a trap composed of 15 places in 1236 ms of which 17 ms to minimize.
[2024-05-21 11:33:29] [INFO ] Deduced a trap composed of 29 places in 1056 ms of which 11 ms to minimize.
[2024-05-21 11:33:29] [INFO ] Deduced a trap composed of 27 places in 791 ms of which 10 ms to minimize.
[2024-05-21 11:33:30] [INFO ] Deduced a trap composed of 23 places in 988 ms of which 17 ms to minimize.
SMT process timed out in 7489ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 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 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 1728 transition count 1051
Reduce places removed 627 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 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 5 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1772 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 2454 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2550 place count 513 transition count 295
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2646 place count 417 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2647 place count 416 transition count 294
Reduce places removed 119 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 4 with 325 rules applied. Total rules applied 2972 place count 297 transition count 88
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 3178 place count 91 transition count 88
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3178 place count 91 transition count 58
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3238 place count 61 transition count 58
Applied a total of 3238 rules in 201 ms. Remains 61 /1728 variables (removed 1667) and now considering 58/1678 (removed 1620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 61/1728 places, 58/1678 transitions.
RANDOM walk for 126 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2024-05-21 11:33:32] [INFO ] Invariant cache hit.
[2024-05-21 11:33:33] [INFO ] [Real]Absence check using 147 positive place invariants in 183 ms returned sat
[2024-05-21 11:33:33] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 24 ms returned sat
[2024-05-21 11:33:47] [INFO ] [Real]Absence check using state equation in 13277 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 93 reset in 439 ms.
Product exploration explored 100000 steps with 93 reset in 492 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1728 transition count 1678
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 604 place count 1728 transition count 1654
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 604 place count 1728 transition count 1654
Deduced a syphon composed of 801 places in 7 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 825 place count 1728 transition count 1654
Discarding 480 places :
Symmetric choice reduction at 2 with 480 rule applications. Total rules 1305 place count 1248 transition count 1174
Deduced a syphon composed of 321 places in 4 ms
Iterating global reduction 2 with 480 rules applied. Total rules applied 1785 place count 1248 transition count 1174
Performed 412 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 733 places in 0 ms
Iterating global reduction 2 with 412 rules applied. Total rules applied 2197 place count 1248 transition count 1126
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 2 with 266 rule applications. Total rules 2463 place count 982 transition count 860
Deduced a syphon composed of 467 places in 1 ms
Iterating global reduction 2 with 266 rules applied. Total rules applied 2729 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Applied a total of 2729 rules in 485 ms. Remains 982 /1728 variables (removed 746) and now considering 860/1678 (removed 818) transitions.
[2024-05-21 11:33:48] [INFO ] Redundant transitions in 9 ms returned []
Running 859 sub problems to find dead transitions.
// Phase 1: matrix 860 rows 982 cols
[2024-05-21 11:33:49] [INFO ] Computed 148 invariants in 18 ms
[2024-05-21 11:33:49] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/1842 variables, and 1 constraints, problems are : Problem set: 0 solved, 859 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/146 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/982 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 859/859 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 859 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/981 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 2 (OVERLAPS) 1/982 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-21 11:34:46] [INFO ] Deduced a trap composed of 2 places in 512 ms of which 9 ms to minimize.
[2024-05-21 11:34:47] [INFO ] Deduced a trap composed of 2 places in 492 ms of which 8 ms to minimize.
[2024-05-21 11:34:47] [INFO ] Deduced a trap composed of 2 places in 500 ms of which 9 ms to minimize.
[2024-05-21 11:34:48] [INFO ] Deduced a trap composed of 2 places in 478 ms of which 8 ms to minimize.
[2024-05-21 11:34:48] [INFO ] Deduced a trap composed of 2 places in 445 ms of which 8 ms to minimize.
[2024-05-21 11:34:49] [INFO ] Deduced a trap composed of 2 places in 458 ms of which 8 ms to minimize.
[2024-05-21 11:34:49] [INFO ] Deduced a trap composed of 2 places in 437 ms of which 8 ms to minimize.
[2024-05-21 11:34:49] [INFO ] Deduced a trap composed of 2 places in 413 ms of which 7 ms to minimize.
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 982/1842 variables, and 156 constraints, problems are : Problem set: 0 solved, 859 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 146/146 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/982 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/859 constraints, Known Traps: 8/8 constraints]
After SMT, in 60975ms problems are : Problem set: 0 solved, 859 unsolved
Search for dead transitions found 0 dead transitions in 60986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 982/1728 places, 860/1678 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61489 ms. Remains : 982/1728 places, 860/1678 transitions.
Built C files in :
/tmp/ltsmin8283244810061595226
[2024-05-21 11:34:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8283244810061595226
Running compilation step : cd /tmp/ltsmin8283244810061595226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8283244810061595226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8283244810061595226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 108 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-21 11:34:53] [INFO ] Computed 148 invariants in 11 ms
[2024-05-21 11:34:54] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-21 11:34:54] [INFO ] Invariant cache hit.
[2024-05-21 11:34:57] [INFO ] Implicit Places using invariants and state equation in 3760 ms returned []
Implicit Place search using SMT with State Equation took 4752 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-21 11:34:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30032 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
(s776 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30038 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 60549ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Finished structural reductions in LTL mode , in 1 iterations and 65465 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Built C files in :
/tmp/ltsmin4701546905460461829
[2024-05-21 11:35:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4701546905460461829
Running compilation step : cd /tmp/ltsmin4701546905460461829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4701546905460461829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4701546905460461829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 11:36:01] [INFO ] Flatten gal took : 37 ms
[2024-05-21 11:36:01] [INFO ] Flatten gal took : 38 ms
[2024-05-21 11:36:01] [INFO ] Time to serialize gal into /tmp/LTL9981594842078034502.gal : 9 ms
[2024-05-21 11:36:01] [INFO ] Time to serialize properties into /tmp/LTL12744912050472066228.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9981594842078034502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8224610426487198799.hoa' '-atoms' '/tmp/LTL12744912050472066228.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12744912050472066228.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8224610426487198799.hoa
Detected timeout of ITS tools.
[2024-05-21 11:36:16] [INFO ] Flatten gal took : 34 ms
[2024-05-21 11:36:16] [INFO ] Flatten gal took : 35 ms
[2024-05-21 11:36:16] [INFO ] Time to serialize gal into /tmp/LTL3242740553485929840.gal : 8 ms
[2024-05-21 11:36:16] [INFO ] Time to serialize properties into /tmp/LTL6332491120202355794.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3242740553485929840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6332491120202355794.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(((F("((p1091==0)||(p1843==0))"))&&(G("(p262==0)")))&&(F("(p48==1)"))))))
Formula 0 simplified : XX(G!"((p1091==0)||(p1843==0))" | F!"(p262==0)" | G!"(p48==1)")
Detected timeout of ITS tools.
[2024-05-21 11:36:31] [INFO ] Flatten gal took : 34 ms
[2024-05-21 11:36:31] [INFO ] Applying decomposition
[2024-05-21 11:36:31] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9328505612431216583.txt' '-o' '/tmp/graph9328505612431216583.bin' '-w' '/tmp/graph9328505612431216583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9328505612431216583.bin' '-l' '-1' '-v' '-w' '/tmp/graph9328505612431216583.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:36:32] [INFO ] Decomposing Gal with order
[2024-05-21 11:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:36:32] [INFO ] Removed a total of 331 redundant transitions.
[2024-05-21 11:36:32] [INFO ] Flatten gal took : 80 ms
[2024-05-21 11:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 11:36:32] [INFO ] Time to serialize gal into /tmp/LTL6345192358867875528.gal : 18 ms
[2024-05-21 11:36:32] [INFO ] Time to serialize properties into /tmp/LTL8651765885232012178.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6345192358867875528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8651765885232012178.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(((F("((i19.u299.p1091==0)||(i19.u578.p1843==0))"))&&(G("(i9.u90.p262==0)")))&&(F("(i19.u21.p48==1)"))))))
Formula 0 simplified : XX(G!"((i19.u299.p1091==0)||(i19.u578.p1843==0))" | F!"(i9.u90.p262==0)" | G!"(i19.u21.p48==1)")
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24b-LTLFireability-07 finished in 362026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F(p1))))))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1729 transition count 1679
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1725 transition count 1675
Applied a total of 51 rules in 591 ms. Remains 1725 /1750 variables (removed 25) and now considering 1675/1701 (removed 26) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-21 11:36:48] [INFO ] Computed 148 invariants in 7 ms
[2024-05-21 11:36:48] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-05-21 11:36:48] [INFO ] Invariant cache hit.
[2024-05-21 11:36:52] [INFO ] Implicit Places using invariants and state equation in 3357 ms returned []
Implicit Place search using SMT with State Equation took 4215 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-21 11:36:52] [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
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 1724/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1674 unsolved in 30034 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 60457ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1675/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65296 ms. Remains : 1725/1750 places, 1675/1701 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-08
Product exploration explored 100000 steps with 149 reset in 378 ms.
Product exploration explored 100000 steps with 145 reset in 431 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/1725 stabilizing places and 414/1675 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 3218 steps (0 resets) in 18 ms. (169 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1725 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 1724 transition count 1050
Reduce places removed 624 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 1 with 693 rules applied. Total rules applied 1317 place count 1100 transition count 981
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 1363 place count 1054 transition count 981
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1363 place count 1054 transition count 781
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1763 place count 854 transition count 781
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 3 with 676 rules applied. Total rules applied 2439 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 3 with 2 rules applied. Total rules applied 2441 place count 515 transition count 395
Applied a total of 2441 rules in 114 ms. Remains 515 /1725 variables (removed 1210) and now considering 395/1675 (removed 1280) transitions.
// Phase 1: matrix 395 rows 515 cols
[2024-05-21 11:37:54] [INFO ] Computed 148 invariants in 2 ms
[2024-05-21 11:37:55] [INFO ] Implicit Places using invariants in 799 ms returned [171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 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 74 places :
Implicit Place search using SMT only with invariants took 801 ms to find 74 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 441/1725 places, 395/1675 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 441 transition count 348
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 394 transition count 348
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 119 place count 369 transition count 323
Iterating global reduction 2 with 25 rules applied. Total rules applied 144 place count 369 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 368 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 368 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 367 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 367 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 366 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 366 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 365 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 365 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 364 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 364 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 363 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 363 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 362 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 362 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 361 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 361 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 360 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 360 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 359 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 359 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 358 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 358 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 357 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 357 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 356 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 356 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 355 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 355 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 354 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 354 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 353 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 353 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 352 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 352 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 351 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 351 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 350 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 350 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 349 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 349 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 348 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 348 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 347 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 347 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 346 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 346 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 345 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 345 transition count 299
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 2 with 2 rules applied. Total rules applied 194 place count 344 transition count 298
Applied a total of 194 rules in 153 ms. Remains 344 /441 variables (removed 97) and now considering 298/395 (removed 97) transitions.
// Phase 1: matrix 298 rows 344 cols
[2024-05-21 11:37:55] [INFO ] Computed 74 invariants in 2 ms
[2024-05-21 11:37:55] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-21 11:37:55] [INFO ] Invariant cache hit.
[2024-05-21 11:37:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 11:37:56] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 344/1725 places, 298/1675 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2596 ms. Remains : 344/1725 places, 298/1675 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 113 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1869 reset in 549 ms.
Product exploration explored 100000 steps with 1876 reset in 602 ms.
Built C files in :
/tmp/ltsmin17953508111741256771
[2024-05-21 11:37:58] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-05-21 11:37:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:37:58] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-05-21 11:37:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:37:58] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-05-21 11:37:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:37:58] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17953508111741256771
Running compilation step : cd /tmp/ltsmin17953508111741256771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1207 ms.
Running link step : cd /tmp/ltsmin17953508111741256771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17953508111741256771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11313673805241062070.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 298/298 transitions.
Applied a total of 0 rules in 10 ms. Remains 344 /344 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-05-21 11:38:13] [INFO ] Invariant cache hit.
[2024-05-21 11:38:14] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 11:38:14] [INFO ] Invariant cache hit.
[2024-05-21 11:38:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 11:38:15] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-05-21 11:38:15] [INFO ] Redundant transitions in 0 ms returned []
Running 296 sub problems to find dead transitions.
[2024-05-21 11:38:15] [INFO ] Invariant cache hit.
[2024-05-21 11:38:15] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 298/642 variables, 344/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 73/491 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 11:38:31] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 (/ 3.0 4.0))
(s6 (/ 1.0 4.0))
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 (/ 3.0 4.0))
(s13 (/ 1.0 4.0))
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 (/ 3.0 4.0))
(s20 (/ 1.0 4.0))
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 (/ 3.0 4.0))
(s27 (/ 1.0 4.0))
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 (/ 3.0 4.0))
(s34 (/ 1.0 4.0))
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.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 1.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 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 492 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 344/344 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 298/642 variables, 344/419 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 73/492 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 296/788 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 788 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 344/344 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 1/1 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61860 ms. Remains : 344/344 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin17006702134824762744
[2024-05-21 11:39:15] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2024-05-21 11:39:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:39:15] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2024-05-21 11:39:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:39:15] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2024-05-21 11:39:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:39:15] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17006702134824762744
Running compilation step : cd /tmp/ltsmin17006702134824762744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin17006702134824762744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17006702134824762744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14297004016180940365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:39:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 11:39:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 11:39:30] [INFO ] Time to serialize gal into /tmp/LTL2325098513637114395.gal : 2 ms
[2024-05-21 11:39:30] [INFO ] Time to serialize properties into /tmp/LTL13893094429644215160.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2325098513637114395.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5311132773061935207.hoa' '-atoms' '/tmp/LTL13893094429644215160.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13893094429644215160.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5311132773061935207.hoa
Detected timeout of ITS tools.
[2024-05-21 11:39:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 11:39:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 11:39:45] [INFO ] Time to serialize gal into /tmp/LTL12061534449587177315.gal : 5 ms
[2024-05-21 11:39:45] [INFO ] Time to serialize properties into /tmp/LTL4274598790271729853.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12061534449587177315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4274598790271729853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p109==0)")&&(G(F("((p1253==0)&&(p109==0))")))))))
Formula 0 simplified : XX(!"(p109==0)" | FG!"((p1253==0)&&(p109==0))")
Detected timeout of ITS tools.
[2024-05-21 11:40:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 11:40:00] [INFO ] Applying decomposition
[2024-05-21 11:40:00] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14569048150269819853.txt' '-o' '/tmp/graph14569048150269819853.bin' '-w' '/tmp/graph14569048150269819853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14569048150269819853.bin' '-l' '-1' '-v' '-w' '/tmp/graph14569048150269819853.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:40:00] [INFO ] Decomposing Gal with order
[2024-05-21 11:40:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:40:01] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-21 11:40:01] [INFO ] Flatten gal took : 35 ms
[2024-05-21 11:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-21 11:40:01] [INFO ] Time to serialize gal into /tmp/LTL4735157932857128652.gal : 5 ms
[2024-05-21 11:40:01] [INFO ] Time to serialize properties into /tmp/LTL1264778831303626861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4735157932857128652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1264778831303626861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i2.u0.p109==0)")&&(G(F("((i4.u74.p1253==0)&&(i2.u0.p109==0))")))))))
Formula 0 simplified : XX(!"(i2.u0.p109==0)" | FG!"((i4.u74.p1253==0)&&(i2.u0.p109==0))")
Reverse transition relation is NOT exact ! Due to transitions t225, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) ...167
Computing Next relation with stutter on 1.61061e+09 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
58 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.680388,28924,1,0,21181,12073,4188,28486,1187,42482,44997
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLFireability-08 finished in 194352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((((p1||G(p2)) U p3)&&p0)))))'
Support contains 6 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1726 transition count 1676
Applied a total of 49 rules in 611 ms. Remains 1726 /1750 variables (removed 24) and now considering 1676/1701 (removed 25) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2024-05-21 11:40:02] [INFO ] Computed 148 invariants in 14 ms
[2024-05-21 11:40:03] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-05-21 11:40:03] [INFO ] Invariant cache hit.
[2024-05-21 11:40:06] [INFO ] Implicit Places using invariants and state equation in 3404 ms returned []
Implicit Place search using SMT with State Equation took 4166 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2024-05-21 11:40:06] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30043 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 30029 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 60471ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Starting structural reductions in LTL mode, iteration 1 : 1726/1750 places, 1676/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65278 ms. Remains : 1726/1750 places, 1676/1701 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-09 finished in 65755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||F(G((G(p2) U p3)))))))'
Support contains 5 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1736 transition count 1687
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1736 transition count 1687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1736 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 1731 transition count 1681
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 1731 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1730 transition count 1680
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1729 transition count 1679
Applied a total of 43 rules in 588 ms. Remains 1729 /1750 variables (removed 21) and now considering 1679/1701 (removed 22) transitions.
// Phase 1: matrix 1679 rows 1729 cols
[2024-05-21 11:41:08] [INFO ] Computed 148 invariants in 7 ms
[2024-05-21 11:41:09] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-05-21 11:41:09] [INFO ] Invariant cache hit.
[2024-05-21 11:41:12] [INFO ] Implicit Places using invariants and state equation in 3509 ms returned []
Implicit Place search using SMT with State Equation took 4481 ms to find 0 implicit places.
Running 1678 sub problems to find dead transitions.
[2024-05-21 11:41:12] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1728/3408 variables, and 0 constraints, problems are : Problem set: 0 solved, 1678 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1729 constraints, PredecessorRefiner: 1678/1678 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/3408 variables, and 0 constraints, problems are : Problem set: 0 solved, 1678 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1729 constraints, PredecessorRefiner: 0/1678 constraints, Known Traps: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 1678 unsolved
Search for dead transitions found 0 dead transitions in 60514ms
Starting structural reductions in LTL mode, iteration 1 : 1729/1750 places, 1679/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65588 ms. Remains : 1729/1750 places, 1679/1701 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-10
Product exploration explored 100000 steps with 94 reset in 470 ms.
Product exploration explored 100000 steps with 93 reset in 534 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1729 stabilizing places and 418/1679 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3) p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) p2)), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p3) p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 122 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (36 resets) in 362 ms. (110 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
[2024-05-21 11:42:15] [INFO ] Invariant cache hit.
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) 176/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1427/1606 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 11:42:15] [INFO ] Deduced a trap composed of 69 places in 422 ms of which 6 ms to minimize.
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1606 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1606 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1729 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 29 places in 648 ms of which 9 ms to minimize.
[2024-05-21 11:42:17] [INFO ] Deduced a trap composed of 19 places in 711 ms of which 9 ms to minimize.
[2024-05-21 11:42:18] [INFO ] Deduced a trap composed of 27 places in 702 ms of which 9 ms to minimize.
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 47 places in 757 ms of which 10 ms to minimize.
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 41 places in 671 ms of which 9 ms to minimize.
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 31 places in 785 ms of which 10 ms to minimize.
SMT process timed out in 5621ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1729 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1729/1729 places, 1679/1679 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 1729 transition count 1056
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 1106 transition count 984
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 1058 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1057 transition count 983
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 1057 transition count 784
Deduced a syphon composed of 199 places in 5 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1766 place count 858 transition count 784
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1767 place count 857 transition count 783
Iterating global reduction 4 with 1 rules applied. Total rules applied 1768 place count 857 transition count 783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1768 place count 857 transition count 782
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1770 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 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 4 with 682 rules applied. Total rules applied 2452 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 2547 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 2642 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 2643 place count 419 transition count 297
Reduce places removed 118 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 320 rules applied. Total rules applied 2963 place count 301 transition count 95
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 3165 place count 99 transition count 95
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3165 place count 99 transition count 63
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 3229 place count 67 transition count 63
Applied a total of 3229 rules in 238 ms. Remains 67 /1729 variables (removed 1662) and now considering 63/1679 (removed 1616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 67/1729 places, 63/1679 transitions.
RANDOM walk for 6769 steps (108 resets) in 46 ms. (144 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3) p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) p2)), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p3) p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F p3)]
Knowledge based reduction with 19 factoid took 346 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
[2024-05-21 11:42:21] [INFO ] Invariant cache hit.
[2024-05-21 11:42:22] [INFO ] [Real]Absence check using 147 positive place invariants in 178 ms returned sat
[2024-05-21 11:42:23] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 38 ms returned sat
[2024-05-21 11:42:31] [INFO ] [Real]Absence check using state equation in 8391 ms returned sat
[2024-05-21 11:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:42:32] [INFO ] [Nat]Absence check using 147 positive place invariants in 171 ms returned sat
[2024-05-21 11:42:32] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 13 ms returned sat
[2024-05-21 11:42:46] [INFO ] [Nat]Absence check using state equation in 13536 ms returned unknown
Could not prove EG (NOT p3)
Support contains 3 out of 1729 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1729/1729 places, 1679/1679 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 620 transitions
Trivial Post-agglo rules discarded 620 transitions
Performed 620 trivial Post agglomeration. Transition count delta: 620
Iterating post reduction 0 with 620 rules applied. Total rules applied 620 place count 1728 transition count 1058
Reduce places removed 620 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 692 rules applied. Total rules applied 1312 place count 1108 transition count 986
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 1362 place count 1060 transition count 984
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1364 place count 1058 transition count 984
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1364 place count 1058 transition count 785
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 1762 place count 859 transition count 785
Performed 342 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 4 with 684 rules applied. Total rules applied 2446 place count 517 transition count 395
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 2447 place count 516 transition count 394
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 2519 place count 468 transition count 370
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2543 place count 444 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2543 place count 444 transition count 346
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 2591 place count 420 transition count 346
Applied a total of 2591 rules in 199 ms. Remains 420 /1729 variables (removed 1309) and now considering 346/1679 (removed 1333) transitions.
// Phase 1: matrix 346 rows 420 cols
[2024-05-21 11:42:46] [INFO ] Computed 100 invariants in 2 ms
[2024-05-21 11:42:47] [INFO ] Implicit Places using invariants in 491 ms returned [173, 247, 321, 325, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 419]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 511 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/1729 places, 346/1679 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 368 transition count 321
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 368 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 367 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 344 transition count 297
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 343 transition count 296
Applied a total of 100 rules in 140 ms. Remains 343 /393 variables (removed 50) and now considering 296/346 (removed 50) transitions.
// Phase 1: matrix 296 rows 343 cols
[2024-05-21 11:42:47] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 11:42:47] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-21 11:42:47] [INFO ] Invariant cache hit.
[2024-05-21 11:42:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 11:42:48] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 343/1729 places, 296/1679 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1907 ms. Remains : 343/1729 places, 296/1679 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/343 stabilizing places and 2/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3)), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (OR p2 p3)), (X (NOT (OR p2 p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3))))]
Knowledge based reduction with 8 factoid took 837 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 27177 steps (321 resets) in 376 ms. (72 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p3)), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (OR p2 p3)), (X (NOT (OR p2 p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F p3)]
Knowledge based reduction with 8 factoid took 981 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
[2024-05-21 11:42:50] [INFO ] Invariant cache hit.
[2024-05-21 11:42:51] [INFO ] [Real]Absence check using 73 positive place invariants in 26 ms returned sat
[2024-05-21 11:42:52] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2024-05-21 11:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:42:52] [INFO ] [Nat]Absence check using 73 positive place invariants in 25 ms returned sat
[2024-05-21 11:42:53] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2024-05-21 11:42:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 11:42:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:42:53] [INFO ] Computed and/alt/rep : 176/282/176 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-21 11:42:55] [INFO ] Added : 128 causal constraints over 26 iterations in 2084 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 122 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering criterion allowed to conclude after 2599 steps with 30 reset in 15 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-10 finished in 108092 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 1750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 632 transitions
Trivial Post-agglo rules discarded 632 transitions
Performed 632 trivial Post agglomeration. Transition count delta: 632
Iterating post reduction 0 with 632 rules applied. Total rules applied 632 place count 1749 transition count 1068
Reduce places removed 632 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 705 rules applied. Total rules applied 1337 place count 1117 transition count 995
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 1386 place count 1069 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1387 place count 1068 transition count 994
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 1387 place count 1068 transition count 792
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 1791 place count 866 transition count 792
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1800 place count 857 transition count 783
Iterating global reduction 4 with 9 rules applied. Total rules applied 1809 place count 857 transition count 783
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1809 place count 857 transition count 778
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1819 place count 852 transition count 778
Performed 337 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 4 with 674 rules applied. Total rules applied 2493 place count 515 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 2494 place count 514 transition count 392
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2562 place count 468 transition count 370
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2584 place count 446 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2584 place count 446 transition count 346
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 2632 place count 422 transition count 346
Applied a total of 2632 rules in 182 ms. Remains 422 /1750 variables (removed 1328) and now considering 346/1701 (removed 1355) transitions.
// Phase 1: matrix 346 rows 422 cols
[2024-05-21 11:42:55] [INFO ] Computed 102 invariants in 3 ms
[2024-05-21 11:42:56] [INFO ] Implicit Places using invariants in 422 ms returned [172, 246, 320, 324, 328, 332, 336, 340, 345, 349, 354, 358, 362, 366, 370, 374, 378, 382, 386, 396, 400, 404, 408, 412, 416, 421]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 436 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/1750 places, 346/1701 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 372 transition count 322
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 351 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 350 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 350 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 349 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 349 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 348 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 348 transition count 298
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 346 transition count 296
Applied a total of 100 rules in 149 ms. Remains 346 /396 variables (removed 50) and now considering 296/346 (removed 50) transitions.
// Phase 1: matrix 296 rows 346 cols
[2024-05-21 11:42:56] [INFO ] Computed 76 invariants in 1 ms
[2024-05-21 11:42:56] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-21 11:42:56] [INFO ] Invariant cache hit.
[2024-05-21 11:42:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:42:57] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1750 places, 296/1701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1714 ms. Remains : 346/1750 places, 296/1701 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-12
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-12 finished in 1794 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((G(p0)||X((F(p2)&&p1)))))'
Support contains 3 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1734 transition count 1685
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1724 transition count 1674
Applied a total of 53 rules in 591 ms. Remains 1724 /1750 variables (removed 26) and now considering 1674/1701 (removed 27) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-21 11:42:58] [INFO ] Computed 148 invariants in 6 ms
[2024-05-21 11:42:58] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-05-21 11:42:58] [INFO ] Invariant cache hit.
[2024-05-21 11:43:02] [INFO ] Implicit Places using invariants and state equation in 3328 ms returned []
Implicit Place search using SMT with State Equation took 4073 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-21 11:43:02] [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 30039 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
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 30064 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 60512ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Starting structural reductions in LTL mode, iteration 1 : 1724/1750 places, 1674/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65202 ms. Remains : 1724/1750 places, 1674/1701 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-13
Product exploration explored 100000 steps with 24984 reset in 415 ms.
Product exploration explored 100000 steps with 24993 reset in 426 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 149 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p2), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (36 resets) in 2297 ms. (17 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
[2024-05-21 11:44:05] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf9 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 362/365 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1601 variables, 143/147 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1601 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 5 (OVERLAPS) 123/1724 variables, 1/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1724 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1674/3398 variables, 1724/1872 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3398 variables, 0/1872 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3398 variables, 0/1872 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3398/3398 variables, and 1872 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1724/1724 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 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) 362/365 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1601 variables, 143/147 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 11:44:07] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1601 variables, 1/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1601 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 123/1724 variables, 1/149 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 11:44:08] [INFO ] Deduced a trap composed of 21 places in 659 ms of which 9 ms to minimize.
[2024-05-21 11:44:09] [INFO ] Deduced a trap composed of 19 places in 676 ms of which 9 ms to minimize.
[2024-05-21 11:44:09] [INFO ] Deduced a trap composed of 37 places in 613 ms of which 9 ms to minimize.
[2024-05-21 11:44:10] [INFO ] Deduced a trap composed of 27 places in 595 ms of which 9 ms to minimize.
[2024-05-21 11:44:11] [INFO ] Deduced a trap composed of 31 places in 636 ms of which 9 ms to minimize.
[2024-05-21 11:44:11] [INFO ] Deduced a trap composed of 17 places in 577 ms of which 9 ms to minimize.
[2024-05-21 11:44:12] [INFO ] Deduced a trap composed of 25 places in 616 ms of which 9 ms to minimize.
SMT process timed out in 6820ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1724/1724 places, 1674/1674 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 1724 transition count 1048
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 1098 transition count 976
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1372 place count 1050 transition count 976
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 1372 place count 1050 transition count 779
Deduced a syphon composed of 197 places in 4 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 1766 place count 853 transition count 779
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 3 with 676 rules applied. Total rules applied 2442 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2538 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 2634 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 2635 place count 418 transition count 296
Reduce places removed 120 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 4 with 333 rules applied. Total rules applied 2968 place count 298 transition count 83
Reduce places removed 213 places and 0 transitions.
Iterating post reduction 5 with 213 rules applied. Total rules applied 3181 place count 85 transition count 83
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 3181 place count 85 transition count 57
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 3233 place count 59 transition count 57
Applied a total of 3233 rules in 132 ms. Remains 59 /1724 variables (removed 1665) and now considering 57/1674 (removed 1617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 59/1724 places, 57/1674 transitions.
RANDOM walk for 118 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/2 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p2), (F p1), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 19 factoid took 175 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLFireability-13 finished in 75218 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(p1)&&p0))||G(p2)))'
Support contains 4 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1729 transition count 1679
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1725 transition count 1675
Applied a total of 51 rules in 583 ms. Remains 1725 /1750 variables (removed 25) and now considering 1675/1701 (removed 26) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-21 11:44:13] [INFO ] Computed 148 invariants in 6 ms
[2024-05-21 11:44:13] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-05-21 11:44:14] [INFO ] Invariant cache hit.
[2024-05-21 11:44:17] [INFO ] Implicit Places using invariants and state equation in 3207 ms returned []
Implicit Place search using SMT with State Equation took 3980 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-21 11:44:17] [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 30034 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: (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 30067 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 60542ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1675/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65129 ms. Remains : 1725/1750 places, 1675/1701 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-14
Product exploration explored 100000 steps with 93 reset in 387 ms.
Product exploration explored 100000 steps with 93 reset in 457 ms.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Detected a total of 415/1725 stabilizing places and 415/1675 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 221 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (36 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 260294 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 260294 steps, saw 158557 distinct states, run finished after 3007 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-21 11:45:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 356/357 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1602 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1602 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1725 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1675/3400 variables, 1725/1873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3400 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3400/3400 variables, and 1873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1725/1725 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 356/357 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1602 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1602 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/1725 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 11:45:24] [INFO ] Deduced a trap composed of 15 places in 535 ms of which 9 ms to minimize.
[2024-05-21 11:45:25] [INFO ] Deduced a trap composed of 35 places in 521 ms of which 11 ms to minimize.
[2024-05-21 11:45:25] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 8 ms to minimize.
[2024-05-21 11:45:26] [INFO ] Deduced a trap composed of 25 places in 474 ms of which 8 ms to minimize.
[2024-05-21 11:45:26] [INFO ] Deduced a trap composed of 41 places in 452 ms of which 7 ms to minimize.
[2024-05-21 11:45:27] [INFO ] Deduced a trap composed of 51 places in 474 ms of which 7 ms to minimize.
[2024-05-21 11:45:27] [INFO ] Deduced a trap composed of 39 places in 449 ms of which 7 ms to minimize.
[2024-05-21 11:45:28] [INFO ] Deduced a trap composed of 68 places in 419 ms of which 6 ms to minimize.
[2024-05-21 11:45:28] [INFO ] Deduced a trap composed of 72 places in 411 ms of which 6 ms to minimize.
SMT process timed out in 6544ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 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 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 1725 transition count 1048
Reduce places removed 627 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 699 rules applied. Total rules applied 1326 place count 1098 transition count 976
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1050 transition count 976
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1374 place count 1050 transition count 778
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 1770 place count 852 transition count 778
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 2450 place count 512 transition count 390
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2546 place count 512 transition count 294
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2642 place count 416 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2643 place count 415 transition count 293
Reduce places removed 120 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 4 with 334 rules applied. Total rules applied 2977 place count 295 transition count 79
Reduce places removed 214 places and 0 transitions.
Iterating post reduction 5 with 214 rules applied. Total rules applied 3191 place count 81 transition count 79
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 3191 place count 81 transition count 53
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 3243 place count 55 transition count 53
Applied a total of 3243 rules in 147 ms. Remains 55 /1725 variables (removed 1670) and now considering 53/1675 (removed 1622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 55/1725 places, 53/1675 transitions.
RANDOM walk for 114 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p1), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 14 factoid took 276 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-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLFireability-14 finished in 76662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1735 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1735 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1729 transition count 1679
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1725 transition count 1675
Applied a total of 51 rules in 633 ms. Remains 1725 /1750 variables (removed 25) and now considering 1675/1701 (removed 26) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-21 11:45:29] [INFO ] Computed 148 invariants in 6 ms
[2024-05-21 11:45:30] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-21 11:45:30] [INFO ] Invariant cache hit.
[2024-05-21 11:45:34] [INFO ] Implicit Places using invariants and state equation in 3339 ms returned []
Implicit Place search using SMT with State Equation took 4136 ms to find 0 implicit places.
Running 1674 sub problems to find dead transitions.
[2024-05-21 11:45:34] [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 30028 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 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/1674 constraints, Known Traps: 0/0 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 1674 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 1725/1750 places, 1675/1701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65318 ms. Remains : 1725/1750 places, 1675/1701 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-15 finished in 65461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutoFlight-PT-24b-LTLFireability-06
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1750 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1750/1750 places, 1701/1701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 634 transitions
Trivial Post-agglo rules discarded 634 transitions
Performed 634 trivial Post agglomeration. Transition count delta: 634
Iterating post reduction 0 with 634 rules applied. Total rules applied 634 place count 1749 transition count 1066
Reduce places removed 634 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 707 rules applied. Total rules applied 1341 place count 1115 transition count 993
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 1390 place count 1067 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1391 place count 1066 transition count 992
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1391 place count 1066 transition count 791
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1793 place count 865 transition count 791
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1802 place count 856 transition count 782
Iterating global reduction 4 with 9 rules applied. Total rules applied 1811 place count 856 transition count 782
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1811 place count 856 transition count 777
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1821 place count 851 transition count 777
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 2493 place count 515 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 2494 place count 514 transition count 392
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2562 place count 468 transition count 370
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2584 place count 446 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2584 place count 446 transition count 346
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 2632 place count 422 transition count 346
Applied a total of 2632 rules in 243 ms. Remains 422 /1750 variables (removed 1328) and now considering 346/1701 (removed 1355) transitions.
// Phase 1: matrix 346 rows 422 cols
[2024-05-21 11:46:35] [INFO ] Computed 102 invariants in 1 ms
[2024-05-21 11:46:35] [INFO ] Implicit Places using invariants in 529 ms returned [330, 334, 338, 342, 347, 351, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 412, 416, 421]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 546 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 399/1750 places, 346/1701 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 378 transition count 325
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 378 transition count 325
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 373 transition count 320
Applied a total of 52 rules in 26 ms. Remains 373 /399 variables (removed 26) and now considering 320/346 (removed 26) transitions.
// Phase 1: matrix 320 rows 373 cols
[2024-05-21 11:46:35] [INFO ] Computed 79 invariants in 1 ms
[2024-05-21 11:46:36] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-21 11:46:36] [INFO ] Invariant cache hit.
[2024-05-21 11:46:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:46:36] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 373/1750 places, 320/1701 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1837 ms. Remains : 373/1750 places, 320/1701 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06
Product exploration explored 100000 steps with 2283 reset in 679 ms.
Product exploration explored 100000 steps with 2276 reset in 733 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/373 stabilizing places and 4/320 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 11:46:39] [INFO ] Invariant cache hit.
[2024-05-21 11:46:39] [INFO ] [Real]Absence check using 79 positive place invariants in 60 ms returned sat
[2024-05-21 11:46:40] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2024-05-21 11:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:46:40] [INFO ] [Nat]Absence check using 79 positive place invariants in 37 ms returned sat
[2024-05-21 11:46:40] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-21 11:46:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:46:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 11:46:40] [INFO ] Computed and/alt/rep : 201/305/201 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 11:46:40] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 373 /373 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-21 11:46:40] [INFO ] Invariant cache hit.
[2024-05-21 11:46:40] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-21 11:46:40] [INFO ] Invariant cache hit.
[2024-05-21 11:46:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:46:41] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 11:46:41] [INFO ] Invariant cache hit.
[2024-05-21 11:46:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 11:46:44] [INFO ] Deduced a trap composed of 194 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 455 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17107 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 201/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 693/693 variables, and 656 constraints, problems are : Problem set: 0 solved, 201 unsolved in 27628 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
After SMT, in 44765ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 44769ms
Finished structural reductions in LTL mode , in 1 iterations and 46087 ms. Remains : 373/373 places, 320/320 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/373 stabilizing places and 4/320 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 202 steps (0 resets) in 5 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 11:47:27] [INFO ] Invariant cache hit.
[2024-05-21 11:47:27] [INFO ] [Real]Absence check using 79 positive place invariants in 59 ms returned sat
[2024-05-21 11:47:28] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2024-05-21 11:47:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:47:28] [INFO ] [Nat]Absence check using 79 positive place invariants in 36 ms returned sat
[2024-05-21 11:47:28] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-21 11:47:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:47:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 11:47:28] [INFO ] Computed and/alt/rep : 201/305/201 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 11:47:28] [INFO ] Added : 0 causal constraints over 0 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2327 reset in 683 ms.
Product exploration explored 100000 steps with 2328 reset in 792 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 373/373 places, 320/320 transitions.
Applied a total of 0 rules in 7 ms. Remains 373 /373 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-21 11:47:30] [INFO ] Redundant transitions in 2 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 11:47:30] [INFO ] Invariant cache hit.
[2024-05-21 11:47:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 11:47:33] [INFO ] Deduced a trap composed of 194 places in 138 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 455 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17222 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 201/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 693/693 variables, and 656 constraints, problems are : Problem set: 0 solved, 201 unsolved in 27519 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
After SMT, in 44782ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 44784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44798 ms. Remains : 373/373 places, 320/320 transitions.
Built C files in :
/tmp/ltsmin18146179434793129870
[2024-05-21 11:48:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18146179434793129870
Running compilation step : cd /tmp/ltsmin18146179434793129870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 975 ms.
Running link step : cd /tmp/ltsmin18146179434793129870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18146179434793129870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2150009521915243429.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 373 /373 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-21 11:48:30] [INFO ] Invariant cache hit.
[2024-05-21 11:48:30] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 11:48:30] [INFO ] Invariant cache hit.
[2024-05-21 11:48:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 11:48:31] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 11:48:31] [INFO ] Invariant cache hit.
[2024-05-21 11:48:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 11:48:33] [INFO ] Deduced a trap composed of 194 places in 114 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/693 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 455 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16821 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 320/693 variables, 373/453 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 201/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/693 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 693/693 variables, and 656 constraints, problems are : Problem set: 0 solved, 201 unsolved in 27303 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 373/373 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
After SMT, in 44154ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 44157ms
Finished structural reductions in LTL mode , in 1 iterations and 45198 ms. Remains : 373/373 places, 320/320 transitions.
Built C files in :
/tmp/ltsmin4178213758627407285
[2024-05-21 11:49:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4178213758627407285
Running compilation step : cd /tmp/ltsmin4178213758627407285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1007 ms.
Running link step : cd /tmp/ltsmin4178213758627407285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4178213758627407285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14754314582646302413.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:49:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:49:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:49:30] [INFO ] Time to serialize gal into /tmp/LTL15888816775889756509.gal : 2 ms
[2024-05-21 11:49:30] [INFO ] Time to serialize properties into /tmp/LTL14061714787631326966.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15888816775889756509.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10929937289339294465.hoa' '-atoms' '/tmp/LTL14061714787631326966.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14061714787631326966.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10929937289339294465.hoa
Reverse transition relation is NOT exact ! Due to transitions t228.t377, t240.t377, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 7.91885e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-21 11:49:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:49:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:49:45] [INFO ] Time to serialize gal into /tmp/LTL15862726981656670437.gal : 2 ms
[2024-05-21 11:49:45] [INFO ] Time to serialize properties into /tmp/LTL13087856014418741765.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15862726981656670437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13087856014418741765.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p1835==1)")))))
Formula 0 simplified : XXG!"(p1835==1)"
Reverse transition relation is NOT exact ! Due to transitions t228.t377, t240.t377, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 7.91885e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-21 11:50:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 11:50:00] [INFO ] Applying decomposition
[2024-05-21 11:50:00] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12933518868017414210.txt' '-o' '/tmp/graph12933518868017414210.bin' '-w' '/tmp/graph12933518868017414210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12933518868017414210.bin' '-l' '-1' '-v' '-w' '/tmp/graph12933518868017414210.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:50:01] [INFO ] Decomposing Gal with order
[2024-05-21 11:50:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:50:01] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-21 11:50:01] [INFO ] Flatten gal took : 18 ms
[2024-05-21 11:50:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-21 11:50:01] [INFO ] Time to serialize gal into /tmp/LTL10202328551586736738.gal : 4 ms
[2024-05-21 11:50:01] [INFO ] Time to serialize properties into /tmp/LTL13195354051156927520.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10202328551586736738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13195354051156927520.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i15.i2.u135.p1835==1)")))))
Formula 0 simplified : XXG!"(i15.i2.u135.p1835==1)"
Reverse transition relation is NOT exact ! Due to transitions t228_t377, t240_t377, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 7.91885e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
48 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.552702,31332,1,0,28660,10551,4345,45106,1058,39989,55154
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 206926 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
[2024-05-21 11:50:01] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12453367204226340472
[2024-05-21 11:50:01] [INFO ] Too many transitions (1701) to apply POR reductions. Disabling POR matrices.
[2024-05-21 11:50:01] [INFO ] Applying decomposition
[2024-05-21 11:50:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12453367204226340472
Running compilation step : cd /tmp/ltsmin12453367204226340472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 11:50:01] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7502956821372409263.txt' '-o' '/tmp/graph7502956821372409263.bin' '-w' '/tmp/graph7502956821372409263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7502956821372409263.bin' '-l' '-1' '-v' '-w' '/tmp/graph7502956821372409263.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:50:02] [INFO ] Decomposing Gal with order
[2024-05-21 11:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:50:02] [INFO ] Removed a total of 317 redundant transitions.
[2024-05-21 11:50:02] [INFO ] Flatten gal took : 79 ms
[2024-05-21 11:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 11:50:02] [INFO ] Time to serialize gal into /tmp/LTLFireability86407829863055212.gal : 15 ms
[2024-05-21 11:50:02] [INFO ] Time to serialize properties into /tmp/LTLFireability2489962671020596727.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability86407829863055212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2489962671020596727.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 2 LTL properties
Checking formula 0 : !((X(X(F("(i33.u577.p1835==1)")))))
Formula 0 simplified : XXG!"(i33.u577.p1835==1)"
Compilation finished in 7290 ms.
Running link step : cd /tmp/ltsmin12453367204226340472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12453367204226340472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12453367204226340472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12453367204226340472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600