About the Execution of ITS-Tools for HirschbergSinclair-PT-45
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13492.520 | 3600000.00 | 11760899.00 | 3668.30 | FFFTFFFF?FFTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r202-smll-171649587500123.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 HirschbergSinclair-PT-45, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587500123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 616K 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 HirschbergSinclair-PT-45-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716628762062
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 09:19:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 09:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:19:24] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2024-05-25 09:19:24] [INFO ] Transformed 1138 places.
[2024-05-25 09:19:24] [INFO ] Transformed 1042 transitions.
[2024-05-25 09:19:24] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1096 transition count 1042
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 81 place count 1057 transition count 1003
Iterating global reduction 1 with 39 rules applied. Total rules applied 120 place count 1057 transition count 1003
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 159 place count 1018 transition count 964
Iterating global reduction 1 with 39 rules applied. Total rules applied 198 place count 1018 transition count 964
Applied a total of 198 rules in 676 ms. Remains 1018 /1138 variables (removed 120) and now considering 964/1042 (removed 78) transitions.
// Phase 1: matrix 964 rows 1018 cols
[2024-05-25 09:19:25] [INFO ] Computed 54 invariants in 81 ms
[2024-05-25 09:19:27] [INFO ] Implicit Places using invariants in 1543 ms returned []
[2024-05-25 09:19:27] [INFO ] Invariant cache hit.
[2024-05-25 09:19:35] [INFO ] Implicit Places using invariants and state equation in 8527 ms returned []
Implicit Place search using SMT with State Equation took 10121 ms to find 0 implicit places.
Running 919 sub problems to find dead transitions.
[2024-05-25 09:19:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 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)
(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)
(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)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 970/1982 variables, and 6 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1018 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/970 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 6/976 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/1982 variables, and 9 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1018 constraints, PredecessorRefiner: 0/919 constraints, Known Traps: 0/0 constraints]
After SMT, in 60753ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Starting structural reductions in LTL mode, iteration 1 : 1018/1138 places, 964/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71647 ms. Remains : 1018/1138 places, 964/1042 transitions.
Support contains 38 out of 1018 places after structural reductions.
[2024-05-25 09:20:37] [INFO ] Flatten gal took : 242 ms
[2024-05-25 09:20:37] [INFO ] Flatten gal took : 141 ms
[2024-05-25 09:20:37] [INFO ] Input system was already deterministic with 964 transitions.
RANDOM walk for 40000 steps (36 resets) in 2755 ms. (14 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
[2024-05-25 09:20:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 892/908 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 6/914 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/914 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 17/931 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/931 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 9 (OVERLAPS) 964/1895 variables, 931/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1895 variables, 0/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 87/1982 variables, 87/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1982 variables, 0/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1982 variables, 0/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1982/1982 variables, and 1072 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2562 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 1018/1018 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 844/847 variables, 45/45 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/847 variables, 0/45 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/856 variables, 3/48 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 0/48 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/931 variables, 6/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 964/1895 variables, 931/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1895 variables, 0/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/1982 variables, 87/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1982 variables, 1/1073 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1982 variables, 0/1073 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1982 variables, 0/1073 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1982/1982 variables, and 1073 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2154 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 1018/1018 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 4771ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 602 ms.
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 984 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.7 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 452 rules applied. Total rules applied 453 place count 984 transition count 512
Reduce places removed 421 places and 0 transitions.
Graph (complete) has 980 edges and 563 vertex of which 473 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.4 ms
Discarding 90 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 876 place count 473 transition count 511
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 967 place count 472 transition count 421
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 968 place count 471 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 969 place count 471 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 970 place count 470 transition count 419
Iterating global reduction 3 with 1 rules applied. Total rules applied 971 place count 470 transition count 419
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 985 place count 470 transition count 405
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 999 place count 456 transition count 405
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 1043 place count 412 transition count 361
Reduce places removed 31 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 4 with 238 rules applied. Total rules applied 1281 place count 381 transition count 154
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 208 rules applied. Total rules applied 1489 place count 174 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1490 place count 173 transition count 153
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 1490 place count 173 transition count 136
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1524 place count 156 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1525 place count 155 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1525 place count 155 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1527 place count 154 transition count 135
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1533 place count 151 transition count 132
Applied a total of 1533 rules in 374 ms. Remains 151 /1018 variables (removed 867) and now considering 132/964 (removed 832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 151/1018 places, 132/964 transitions.
RANDOM walk for 8010 steps (56 resets) in 87 ms. (91 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1018 stabilizing places and 964 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1018 transition count 964
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to 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(G(p0))||(p1&&G(p2))))))'
Support contains 5 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 1011 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 1011 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 1006 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 1006 transition count 954
Applied a total of 22 rules in 867 ms. Remains 1006 /1018 variables (removed 12) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1006 cols
[2024-05-25 09:20:46] [INFO ] Computed 52 invariants in 21 ms
[2024-05-25 09:20:47] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2024-05-25 09:20:47] [INFO ] Invariant cache hit.
[2024-05-25 09:20:56] [INFO ] Implicit Places using invariants and state equation in 8899 ms returned []
Implicit Place search using SMT with State Equation took 10247 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-05-25 09:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1960 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 2/962 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/1960 variables, and 7 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71692 ms. Remains : 1006/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-00
Stuttering criterion allowed to conclude after 1042 steps with 0 reset in 14 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-00 finished in 72208 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)))'
Support contains 2 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1015 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 1010 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 1005 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 1005 transition count 954
Applied a total of 23 rules in 128 ms. Remains 1005 /1018 variables (removed 13) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-05-25 09:21:57] [INFO ] Computed 51 invariants in 11 ms
[2024-05-25 09:21:58] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-25 09:21:58] [INFO ] Invariant cache hit.
[2024-05-25 09:22:05] [INFO ] Implicit Places using invariants and state equation in 7445 ms returned []
Implicit Place search using SMT with State Equation took 8201 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-05-25 09:22:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30061 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68715 ms. Remains : 1005/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-02 finished in 68938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1015 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 1010 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 1005 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 1005 transition count 954
Applied a total of 23 rules in 209 ms. Remains 1005 /1018 variables (removed 13) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-05-25 09:23:06] [INFO ] Computed 51 invariants in 12 ms
[2024-05-25 09:23:07] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-05-25 09:23:07] [INFO ] Invariant cache hit.
[2024-05-25 09:23:16] [INFO ] Implicit Places using invariants and state equation in 8946 ms returned []
Implicit Place search using SMT with State Equation took 9994 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-05-25 09:23:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70547 ms. Remains : 1005/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-05
Product exploration explored 100000 steps with 218 reset in 1035 ms.
Product exploration explored 100000 steps with 219 reset in 821 ms.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 300 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 40000 steps (36 resets) in 550 ms. (72 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
[2024-05-25 09:24:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 653/656 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/917 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 954/1871 variables, 917/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1871 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/1959 variables, 88/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1959 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1959 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1959/1959 variables, and 1056 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1338 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 1005/1005 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 653/656 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/917 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 954/1871 variables, 917/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1871 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1871 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 88/1959 variables, 88/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1959 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1959 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1959/1959 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1609 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 1005/1005 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2965ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 3 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Graph (complete) has 1918 edges and 1005 vertex of which 960 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.4 ms
Discarding 45 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 469 rules applied. Total rules applied 470 place count 960 transition count 485
Reduce places removed 424 places and 0 transitions.
Graph (complete) has 936 edges and 536 vertex of which 211 are kept as prefixes of interest. Removing 325 places using SCC suffix rule.2 ms
Discarding 325 places :
Also discarding 99 output transitions
Drop transitions (Output transitions of discarded places.) removed 99 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 427 rules applied. Total rules applied 897 place count 211 transition count 384
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 2 with 216 rules applied. Total rules applied 1113 place count 209 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1113 place count 209 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1117 place count 207 transition count 168
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 207 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1121 place count 205 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1122 place count 205 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1123 place count 204 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 1124 place count 204 transition count 165
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 1157 place count 171 transition count 132
Reduce places removed 33 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 4 with 144 rules applied. Total rules applied 1301 place count 138 transition count 21
Reduce places removed 111 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 112 rules applied. Total rules applied 1413 place count 27 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1414 place count 26 transition count 20
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 1414 place count 26 transition count 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1438 place count 12 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 4 rules applied. Total rules applied 1442 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1445 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1445 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1447 place count 7 transition count 6
Applied a total of 1447 rules in 153 ms. Remains 7 /1005 variables (removed 998) and now considering 6/954 (removed 948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 7/1005 places, 6/954 transitions.
RANDOM walk for 22 steps (2 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 837 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-05-25 09:24:25] [INFO ] Invariant cache hit.
[2024-05-25 09:24:26] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 242 ms returned sat
[2024-05-25 09:24:40] [INFO ] [Real]Absence check using state equation in 13631 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 960 transition count 485
Reduce places removed 424 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 426 rules applied. Total rules applied 850 place count 536 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 852 place count 534 transition count 483
Applied a total of 852 rules in 65 ms. Remains 534 /1005 variables (removed 471) and now considering 483/954 (removed 471) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-05-25 09:24:40] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 09:24:40] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-25 09:24:40] [INFO ] Invariant cache hit.
[2024-05-25 09:24:44] [INFO ] Implicit Places using invariants and state equation in 3182 ms returned []
Implicit Place search using SMT with State Equation took 4041 ms to find 0 implicit places.
[2024-05-25 09:24:44] [INFO ] Redundant transitions in 41 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-25 09:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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)
(s89 0.0)
(s91 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1005 places, 483/954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64303 ms. Remains : 534/1005 places, 483/954 transitions.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 683 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 40002 steps (72 resets) in 280 ms. (142 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
[2024-05-25 09:25:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/843 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/843 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/1017 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1110ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 1178 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-05-25 09:25:48] [INFO ] Invariant cache hit.
[2024-05-25 09:25:49] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 270 ms returned sat
[2024-05-25 09:26:00] [INFO ] [Real]Absence check using state equation in 11015 ms returned sat
[2024-05-25 09:26:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:26:01] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 370 ms returned sat
[2024-05-25 09:26:01] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-05-25 09:26:01] [INFO ] Computed and/alt/rep : 394/401/394 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-25 09:26:02] [INFO ] Added : 102 causal constraints over 21 iterations in 787 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 470 reset in 654 ms.
Product exploration explored 100000 steps with 471 reset in 677 ms.
Built C files in :
/tmp/ltsmin12236831442942819687
[2024-05-25 09:26:03] [INFO ] Computing symmetric may disable matrix : 483 transitions.
[2024-05-25 09:26:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:26:03] [INFO ] Computing symmetric may enable matrix : 483 transitions.
[2024-05-25 09:26:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:26:03] [INFO ] Computing Do-Not-Accords matrix : 483 transitions.
[2024-05-25 09:26:03] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:26:03] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12236831442942819687
Running compilation step : cd /tmp/ltsmin12236831442942819687;'/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 2354 ms.
Running link step : cd /tmp/ltsmin12236831442942819687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin12236831442942819687;'/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/stateBased12383092747229910294.hoa' '--buchi-type=spotba'
LTSmin run took 9698 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-05 finished in 189654 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) U p1))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 422 place count 971 transition count 499
Reduce places removed 421 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 550 transition count 498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 549 transition count 498
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 851 place count 543 transition count 492
Iterating global reduction 3 with 6 rules applied. Total rules applied 857 place count 543 transition count 492
Applied a total of 857 rules in 97 ms. Remains 543 /1018 variables (removed 475) and now considering 492/964 (removed 472) transitions.
// Phase 1: matrix 492 rows 543 cols
[2024-05-25 09:26:16] [INFO ] Computed 51 invariants in 5 ms
[2024-05-25 09:26:17] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2024-05-25 09:26:17] [INFO ] Invariant cache hit.
[2024-05-25 09:26:20] [INFO ] Implicit Places using invariants and state equation in 3361 ms returned []
Implicit Place search using SMT with State Equation took 4486 ms to find 0 implicit places.
[2024-05-25 09:26:20] [INFO ] Redundant transitions in 5 ms returned []
Running 406 sub problems to find dead transitions.
[2024-05-25 09:26:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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 0.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)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.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 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/1035 variables, and 511 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 406/917 constraints. Problems are: Problem set: 0 solved, 406 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 869/1035 variables, and 917 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 543/1018 places, 492/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64689 ms. Remains : 543/1018 places, 492/964 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-06
Stuttering criterion allowed to conclude after 529 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-06 finished in 64867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 971 transition count 488
Reduce places removed 432 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 433 rules applied. Total rules applied 866 place count 539 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 867 place count 538 transition count 487
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 873 place count 532 transition count 481
Iterating global reduction 3 with 6 rules applied. Total rules applied 879 place count 532 transition count 481
Applied a total of 879 rules in 58 ms. Remains 532 /1018 variables (removed 486) and now considering 481/964 (removed 483) transitions.
// Phase 1: matrix 481 rows 532 cols
[2024-05-25 09:27:20] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 09:27:21] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-25 09:27:21] [INFO ] Invariant cache hit.
[2024-05-25 09:27:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 09:27:26] [INFO ] Implicit Places using invariants and state equation in 4236 ms returned []
Implicit Place search using SMT with State Equation took 5062 ms to find 0 implicit places.
[2024-05-25 09:27:26] [INFO ] Redundant transitions in 3 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-25 09:27:26] [INFO ] Invariant cache hit.
[2024-05-25 09:27:26] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/1013 variables, and 509 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 395/904 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/1013 variables, and 904 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1018 places, 481/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65255 ms. Remains : 532/1018 places, 481/964 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-08
Product exploration explored 100000 steps with 335 reset in 838 ms.
Product exploration explored 100000 steps with 365 reset in 571 ms.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 701 steps (0 resets) in 10 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 24 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-25 09:28:28] [INFO ] Invariant cache hit.
[2024-05-25 09:28:29] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2024-05-25 09:28:29] [INFO ] Invariant cache hit.
[2024-05-25 09:28:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 09:28:34] [INFO ] Implicit Places using invariants and state equation in 4532 ms returned []
Implicit Place search using SMT with State Equation took 5608 ms to find 0 implicit places.
[2024-05-25 09:28:34] [INFO ] Redundant transitions in 2 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-25 09:28:34] [INFO ] Invariant cache hit.
[2024-05-25 09:28:34] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/1013 variables, and 509 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 395/904 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/1013 variables, and 904 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65761 ms. Remains : 532/532 places, 481/481 transitions.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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 p0), (NOT p0)]
RANDOM walk for 711 steps (0 resets) in 9 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 342 reset in 465 ms.
Product exploration explored 100000 steps with 347 reset in 519 ms.
Built C files in :
/tmp/ltsmin4974511831009161447
[2024-05-25 09:29:35] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-25 09:29:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:29:35] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-25 09:29:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:29:35] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-25 09:29:35] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:29:35] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4974511831009161447
Running compilation step : cd /tmp/ltsmin4974511831009161447;'/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 2029 ms.
Running link step : cd /tmp/ltsmin4974511831009161447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4974511831009161447;'/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/stateBased411967452842868837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 22 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-25 09:29:51] [INFO ] Invariant cache hit.
[2024-05-25 09:29:52] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2024-05-25 09:29:52] [INFO ] Invariant cache hit.
[2024-05-25 09:29:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 09:29:56] [INFO ] Implicit Places using invariants and state equation in 4688 ms returned []
Implicit Place search using SMT with State Equation took 5870 ms to find 0 implicit places.
[2024-05-25 09:29:56] [INFO ] Redundant transitions in 4 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-25 09:29:56] [INFO ] Invariant cache hit.
[2024-05-25 09:29:56] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/1013 variables, and 509 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 395/904 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/1013 variables, and 904 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66033 ms. Remains : 532/532 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin607175740445513113
[2024-05-25 09:30:57] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-25 09:30:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:30:57] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-25 09:30:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:30:57] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-25 09:30:57] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:30:57] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin607175740445513113
Running compilation step : cd /tmp/ltsmin607175740445513113;'/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 2959 ms.
Running link step : cd /tmp/ltsmin607175740445513113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin607175740445513113;'/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/stateBased4704609565386623680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 09:31:12] [INFO ] Flatten gal took : 28 ms
[2024-05-25 09:31:12] [INFO ] Flatten gal took : 28 ms
[2024-05-25 09:31:12] [INFO ] Time to serialize gal into /tmp/LTL16343479739162754812.gal : 8 ms
[2024-05-25 09:31:12] [INFO ] Time to serialize properties into /tmp/LTL3510572303910921369.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/LTL16343479739162754812.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12930533698424385936.hoa' '-atoms' '/tmp/LTL3510572303910921369.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/LTL3510572303910921369.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12930533698424385936.hoa
Detected timeout of ITS tools.
[2024-05-25 09:31:27] [INFO ] Flatten gal took : 38 ms
[2024-05-25 09:31:27] [INFO ] Flatten gal took : 30 ms
[2024-05-25 09:31:27] [INFO ] Time to serialize gal into /tmp/LTL4389501429729627955.gal : 6 ms
[2024-05-25 09:31:27] [INFO ] Time to serialize properties into /tmp/LTL13303158034933454647.ltl : 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/LTL4389501429729627955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13303158034933454647.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("(election_45_2_4_to_left_42<=init16)"))))
Formula 0 simplified : FG!"(election_45_2_4_to_left_42<=init16)"
Detected timeout of ITS tools.
[2024-05-25 09:31:42] [INFO ] Flatten gal took : 20 ms
[2024-05-25 09:31:42] [INFO ] Applying decomposition
[2024-05-25 09:31:42] [INFO ] Flatten gal took : 20 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/graph559529140597118749.txt' '-o' '/tmp/graph559529140597118749.bin' '-w' '/tmp/graph559529140597118749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph559529140597118749.bin' '-l' '-1' '-v' '-w' '/tmp/graph559529140597118749.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:31:42] [INFO ] Decomposing Gal with order
[2024-05-25 09:31:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:31:42] [INFO ] Removed a total of 336 redundant transitions.
[2024-05-25 09:31:43] [INFO ] Flatten gal took : 112 ms
[2024-05-25 09:31:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 18 ms.
[2024-05-25 09:31:43] [INFO ] Time to serialize gal into /tmp/LTL2983201059461413710.gal : 15 ms
[2024-05-25 09:31:43] [INFO ] Time to serialize properties into /tmp/LTL15159834260813116164.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/LTL2983201059461413710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15159834260813116164.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("(gu0.election_45_2_4_to_left_42<=gu0.init16)"))))
Formula 0 simplified : FG!"(gu0.election_45_2_4_to_left_42<=gu0.init16)"
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-08 finished in 277491 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)||G(p1)))'
Support contains 4 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 430 place count 971 transition count 491
Reduce places removed 429 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 432 rules applied. Total rules applied 862 place count 542 transition count 488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 865 place count 539 transition count 488
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 870 place count 534 transition count 483
Iterating global reduction 3 with 5 rules applied. Total rules applied 875 place count 534 transition count 483
Applied a total of 875 rules in 65 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-05-25 09:31:58] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 09:31:59] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2024-05-25 09:31:59] [INFO ] Invariant cache hit.
[2024-05-25 09:32:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 09:32:03] [INFO ] Implicit Places using invariants and state equation in 3477 ms returned []
Implicit Place search using SMT with State Equation took 4594 ms to find 0 implicit places.
[2024-05-25 09:32:03] [INFO ] Redundant transitions in 3 ms returned []
Running 397 sub problems to find dead transitions.
[2024-05-25 09:32:03] [INFO ] Invariant cache hit.
[2024-05-25 09:32:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 3/451 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 401/852 variables, 451/502 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/1017 variables, and 512 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 451/534 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 3/451 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 401/852 variables, 451/502 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 397/909 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/1017 variables, and 909 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 451/534 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64765 ms. Remains : 534/1018 places, 483/964 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 204 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-09 finished in 64979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 429 place count 970 transition count 491
Reduce places removed 428 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 430 rules applied. Total rules applied 859 place count 542 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 861 place count 540 transition count 489
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 867 place count 534 transition count 483
Iterating global reduction 3 with 6 rules applied. Total rules applied 873 place count 534 transition count 483
Applied a total of 873 rules in 90 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-05-25 09:33:03] [INFO ] Computed 51 invariants in 6 ms
[2024-05-25 09:33:04] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-25 09:33:04] [INFO ] Invariant cache hit.
[2024-05-25 09:33:08] [INFO ] Implicit Places using invariants and state equation in 3561 ms returned []
Implicit Place search using SMT with State Equation took 4520 ms to find 0 implicit places.
[2024-05-25 09:33:08] [INFO ] Redundant transitions in 4 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-25 09:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64747 ms. Remains : 534/1018 places, 483/964 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-12
Product exploration explored 100000 steps with 189 reset in 695 ms.
Product exploration explored 100000 steps with 189 reset in 748 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40001 steps (72 resets) in 271 ms. (147 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
[2024-05-25 09:34:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/405 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/447 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 605 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/405 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/447 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 843/1017 variables, and 498 constraints, problems are : Problem set: 1 solved, 0 unsolved in 512 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1129ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-12 finished in 68273 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)))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 1012 transition count 960
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 1012 transition count 960
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 1008 transition count 956
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 1008 transition count 956
Applied a total of 18 rules in 221 ms. Remains 1008 /1018 variables (removed 10) and now considering 956/964 (removed 8) transitions.
// Phase 1: matrix 956 rows 1008 cols
[2024-05-25 09:34:11] [INFO ] Computed 52 invariants in 12 ms
[2024-05-25 09:34:13] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-05-25 09:34:13] [INFO ] Invariant cache hit.
[2024-05-25 09:34:21] [INFO ] Implicit Places using invariants and state equation in 8489 ms returned []
Implicit Place search using SMT with State Equation took 9838 ms to find 0 implicit places.
Running 911 sub problems to find dead transitions.
[2024-05-25 09:34:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/1964 variables, and 6 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 911/911 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 911 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/962 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 2 (OVERLAPS) 2/964 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 911 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 964/1964 variables, and 7 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 0/911 constraints, Known Traps: 0/0 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 911 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in LTL mode, iteration 1 : 1008/1018 places, 956/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70410 ms. Remains : 1008/1018 places, 956/964 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 848 ms.
Product exploration explored 100000 steps with 50000 reset in 754 ms.
Computed a total of 1008 stabilizing places and 956 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1008 transition count 956
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 31 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-14 finished in 72882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-25 09:35:24] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13094283393485154755
[2024-05-25 09:35:25] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-25 09:35:25] [INFO ] Applying decomposition
[2024-05-25 09:35:25] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:35:25] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-25 09:35:25] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:35:25] [INFO ] Flatten gal took : 47 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/graph3309558420747864250.txt' '-o' '/tmp/graph3309558420747864250.bin' '-w' '/tmp/graph3309558420747864250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3309558420747864250.bin' '-l' '-1' '-v' '-w' '/tmp/graph3309558420747864250.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:35:25] [INFO ] Decomposing Gal with order
[2024-05-25 09:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:35:25] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-25 09:35:25] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:35:25] [INFO ] Built C files in 421ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13094283393485154755
[2024-05-25 09:35:25] [INFO ] Removed a total of 117 redundant transitions.
Running compilation step : cd /tmp/ltsmin13094283393485154755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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-25 09:35:25] [INFO ] Flatten gal took : 130 ms
[2024-05-25 09:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-25 09:35:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality17556549192046700725.gal : 14 ms
[2024-05-25 09:35:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality2967955427116213785.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/LTLCardinality17556549192046700725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2967955427116213785.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...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu63.election_45_2_4_to_left_42<=gu63.init16)"))))
Formula 0 simplified : FG!"(gu63.election_45_2_4_to_left_42<=gu63.init16)"
Compilation finished in 6060 ms.
Running link step : cd /tmp/ltsmin13094283393485154755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin13094283393485154755;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu5.t66, gi0.gi0.gu6.t70, gi0.gi0.gu7.t74, gi0.gi0.gu8.t78, gi0.gi0.gu9.t82, gi0.gi0....2250
Computing Next relation with stutter on 1.0184e+33 deadlock states
Detected timeout of ITS tools.
[2024-05-25 10:00:47] [INFO ] Flatten gal took : 113 ms
[2024-05-25 10:00:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality17548562551005126467.gal : 24 ms
[2024-05-25 10:00:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality3920310909376912685.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/LTLCardinality17548562551005126467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3920310909376912685.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...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(election_45_2_4_to_left_42<=init16)"))))
Formula 0 simplified : FG!"(election_45_2_4_to_left_42<=init16)"
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-45"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-45, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-171649587500123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-45.tgz
mv HirschbergSinclair-PT-45 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;