Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902010100329.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SimpleLoadBal-PT-15, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902010100329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1749107826077

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:17:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:17:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:17:07] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-06-05 07:17:07] [INFO ] Transformed 149 places.
[2025-06-05 07:17:07] [INFO ] Transformed 1280 transitions.
[2025-06-05 07:17:07] [INFO ] Found NUPN structural information;
[2025-06-05 07:17:07] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2025-06-05 07:17:07] [INFO ] Parsed PT model containing 149 places and 1280 transitions and 8988 arcs in 265 ms.
Built sparse matrix representations for Structural reductions in 16 ms.16613KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 149/149 places, 1280/1280 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 107 ms. Remains 149 /149 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 121 ms. Remains : 149/149 places, 1280/1280 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 149/149 places, 1280/1280 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 74 ms. Remains 149 /149 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-05 07:17:08] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2025-06-05 07:17:08] [INFO ] Computed 39 invariants in 49 ms
[2025-06-05 07:17:08] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-06-05 07:17:08] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-05 07:17:08] [INFO ] Invariant cache hit.
[2025-06-05 07:17:08] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-05 07:17:08] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2025-06-05 07:17:08] [INFO ] Redundant transitions in 62 ms returned []
Running 1265 sub problems to find dead transitions.
[2025-06-05 07:17:08] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-05 07:17:08] [INFO ] Invariant cache hit.
[2025-06-05 07:17:09] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
At refinement iteration 3 (OVERLAPS) 15/149 variables, 29/169 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/188 constraints. Problems are: Problem set: 499 solved, 766 unsolved
[2025-06-05 07:17:32] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 12 ms to minimize.
[2025-06-05 07:17:35] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2025-06-05 07:17:35] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 1 ms to minimize.
[2025-06-05 07:17:35] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 1 ms to minimize.
[2025-06-05 07:17:36] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
[2025-06-05 07:17:36] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2025-06-05 07:17:36] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 2 ms to minimize.
Problem TDEAD777 is UNSAT
[2025-06-05 07:17:36] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 1 ms to minimize.
[2025-06-05 07:17:36] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2025-06-05 07:17:37] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD809 is UNSAT
[2025-06-05 07:17:37] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 1 ms to minimize.
Problem TDEAD810 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 11/199 constraints. Problems are: Problem set: 507 solved, 758 unsolved
[2025-06-05 07:17:42] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:17:42] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2025-06-05 07:17:45] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 1 ms to minimize.
[2025-06-05 07:17:45] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 2 ms to minimize.
[2025-06-05 07:17:45] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2025-06-05 07:17:46] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2025-06-05 07:17:46] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2025-06-05 07:17:46] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2025-06-05 07:17:46] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
[2025-06-05 07:17:46] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 1 ms to minimize.
SMT process timed out in 38030ms, After SMT, problems are : Problem set: 507 solved, 758 unsolved
Search for dead transitions found 509 dead transitions in 38080ms
Found 509 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 509 transitions
Dead transitions reduction (with SMT) removed 509 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 149/149 places, 771/1280 transitions.
Computed a total of 13 stabilizing places and 33 stable transitions
Reduce places removed 0 places and 2 transitions.
Computed a total of 13 stabilizing places and 31 stable transitions
Graph (complete) has 1896 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 147 transition count 769
Reduce places removed 0 places and 2 transitions.
Computed a total of 11 stabilizing places and 29 stable transitions
Graph (complete) has 1886 edges and 147 vertex of which 145 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 145 transition count 767
Reduce places removed 0 places and 3 transitions.
Computed a total of 9 stabilizing places and 26 stable transitions
Graph (complete) has 1875 edges and 145 vertex of which 143 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 143 transition count 764
Reduce places removed 0 places and 3 transitions.
Computed a total of 7 stabilizing places and 23 stable transitions
Graph (complete) has 1864 edges and 143 vertex of which 141 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 141 transition count 761
Reduce places removed 0 places and 4 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 1852 edges and 141 vertex of which 139 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 139 transition count 757
Reduce places removed 0 places and 3 transitions.
Computed a total of 3 stabilizing places and 16 stable transitions
Graph (complete) has 1841 edges and 139 vertex of which 137 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 137 transition count 754
Reduce places removed 0 places and 16 transitions.
Computed a total of 1 stabilizing places and 0 stable transitions
Graph (complete) has 1790 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 136 transition count 738
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 7 rules in 64 ms. Remains 136 /149 variables (removed 13) and now considering 738/771 (removed 33) transitions.
[2025-06-05 07:17:47] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
// Phase 1: matrix 594 rows 136 cols
[2025-06-05 07:17:47] [INFO ] Computed 39 invariants in 19 ms
[2025-06-05 07:17:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 07:17:47] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
[2025-06-05 07:17:47] [INFO ] Invariant cache hit.
[2025-06-05 07:17:47] [INFO ] State equation strengthened by 257 read => feed constraints.
[2025-06-05 07:17:47] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 136/149 places, 738/1280 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 39251 ms. Remains : 136/149 places, 738/1280 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4929 ms (no deadlock found). (steps per millisecond=253 )
Random directed walk for 1250003 steps, including 0 resets, run took 4715 ms (no deadlock found). (steps per millisecond=265 )
[2025-06-05 07:17:56] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
[2025-06-05 07:17:56] [INFO ] Invariant cache hit.
[2025-06-05 07:17:57] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2025-06-05 07:17:57] [INFO ] [Real]Absence check using 36 positive and 3 generalized place invariants in 12 ms returned sat
[2025-06-05 07:17:57] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2025-06-05 07:17:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:17:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-06-05 07:17:57] [INFO ] [Nat]Absence check using 36 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-05 07:17:57] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-05 07:17:57] [INFO ] State equation strengthened by 257 read => feed constraints.
[2025-06-05 07:17:57] [INFO ] [Nat]Added 257 Read/Feed constraints in 106 ms returned sat
[2025-06-05 07:17:59] [INFO ] Deduced a trap composed of 14 places in 1107 ms of which 1 ms to minimize.
[2025-06-05 07:17:59] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 1 ms to minimize.
[2025-06-05 07:17:59] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2025-06-05 07:17:59] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2025-06-05 07:17:59] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2025-06-05 07:18:00] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 4 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 11 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 3 ms to minimize.
[2025-06-05 07:18:01] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2025-06-05 07:18:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4915 ms
[2025-06-05 07:18:02] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4918 ms
[2025-06-05 07:18:03] [INFO ] Computed and/alt/rep : 30/60/30 causal constraints (skipped 549 transitions) in 97 ms.
[2025-06-05 07:18:03] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 1 ms to minimize.
[2025-06-05 07:18:03] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2025-06-05 07:18:03] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2025-06-05 07:18:03] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 1 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 10 ms to minimize.
[2025-06-05 07:18:04] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2025-06-05 07:18:05] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2025-06-05 07:18:06] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2025-06-05 07:18:07] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2025-06-05 07:18:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 5010 ms
[2025-06-05 07:18:08] [INFO ] Solution in real domain found non-integer solution.
Random directed walk for 500004 steps, including 0 resets, run took 1679 ms (no deadlock found). (steps per millisecond=297 )
Random walk for 500000 steps, including 0 resets, run took 1887 ms (no deadlock found). (steps per millisecond=264 )
Random directed walk for 500001 steps, including 0 resets, run took 1705 ms (no deadlock found). (steps per millisecond=293 )
Random walk for 500000 steps, including 0 resets, run took 1849 ms (no deadlock found). (steps per millisecond=270 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 136/136 places, 738/738 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 738/738 (removed 0) transitions.
[2025-06-05 07:18:15] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
[2025-06-05 07:18:15] [INFO ] Invariant cache hit.
[2025-06-05 07:18:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-05 07:18:15] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
[2025-06-05 07:18:15] [INFO ] Invariant cache hit.
[2025-06-05 07:18:15] [INFO ] State equation strengthened by 257 read => feed constraints.
[2025-06-05 07:18:15] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2025-06-05 07:18:15] [INFO ] Redundant transitions in 16 ms returned []
Running 723 sub problems to find dead transitions.
[2025-06-05 07:18:15] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
[2025-06-05 07:18:15] [INFO ] Invariant cache hit.
[2025-06-05 07:18:15] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (OVERLAPS) 15/136 variables, 31/159 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 15/174 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2025-06-05 07:18:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2025-06-05 07:18:29] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2025-06-05 07:18:29] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2025-06-05 07:18:30] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2025-06-05 07:18:30] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2025-06-05 07:18:31] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2025-06-05 07:18:33] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2025-06-05 07:18:34] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2025-06-05 07:18:35] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2025-06-05 07:18:35] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2025-06-05 07:18:35] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2025-06-05 07:18:35] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2025-06-05 07:18:35] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2025-06-05 07:18:36] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 17/197 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2025-06-05 07:18:37] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 1 ms to minimize.
[2025-06-05 07:18:39] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2025-06-05 07:18:45] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2025-06-05 07:18:45] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2025-06-05 07:18:45] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/730 variables, and 202 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30031 ms.
Refiners :[Domain max(s): 136/136 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/136 constraints, ReadFeed: 0/257 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 16/144 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (OVERLAPS) 15/136 variables, 31/175 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 15/190 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 11/202 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 10 (OVERLAPS) 594/730 variables, 136/338 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 257/595 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/730 variables, 723/1318 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/730 variables, and 1318 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30025 ms.
Refiners :[Domain max(s): 136/136 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 27/27 constraints]
After SMT, in 63016ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 63024ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 63405 ms. Remains : 136/136 places, 738/738 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4816 ms (no deadlock found). (steps per millisecond=259 )
Random directed walk for 1250002 steps, including 0 resets, run took 4418 ms (no deadlock found). (steps per millisecond=282 )
[2025-06-05 07:19:27] [INFO ] Flow matrix only has 594 transitions (discarded 144 similar events)
[2025-06-05 07:19:27] [INFO ] Invariant cache hit.
[2025-06-05 07:19:28] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2025-06-05 07:19:28] [INFO ] [Real]Absence check using 36 positive and 3 generalized place invariants in 6 ms returned sat
[2025-06-05 07:19:28] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2025-06-05 07:19:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:19:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-06-05 07:19:28] [INFO ] [Nat]Absence check using 36 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-05 07:19:28] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-05 07:19:28] [INFO ] State equation strengthened by 257 read => feed constraints.
[2025-06-05 07:19:28] [INFO ] [Nat]Added 257 Read/Feed constraints in 82 ms returned sat
[2025-06-05 07:19:28] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2025-06-05 07:19:29] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2025-06-05 07:19:30] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2025-06-05 07:19:31] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2025-06-05 07:19:32] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2025-06-05 07:19:32] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2025-06-05 07:19:32] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2025-06-05 07:19:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3524 ms
[2025-06-05 07:19:32] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3524 ms
[2025-06-05 07:19:32] [INFO ] Computed and/alt/rep : 30/60/30 causal constraints (skipped 549 transitions) in 54 ms.
[2025-06-05 07:19:32] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2025-06-05 07:19:32] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2025-06-05 07:19:33] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 4 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2025-06-05 07:19:34] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2025-06-05 07:19:35] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2025-06-05 07:19:36] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2025-06-05 07:19:37] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2025-06-05 07:19:37] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2025-06-05 07:19:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 4926 ms
[2025-06-05 07:19:37] [INFO ] Solution in real domain found non-integer solution.
Random directed walk for 500000 steps, including 0 resets, run took 1845 ms (no deadlock found). (steps per millisecond=271 )
Random walk for 500000 steps, including 0 resets, run took 1928 ms (no deadlock found). (steps per millisecond=259 )
Random directed walk for 500000 steps, including 0 resets, run took 1798 ms (no deadlock found). (steps per millisecond=278 )
Random walk for 500000 steps, including 0 resets, run took 1966 ms (no deadlock found). (steps per millisecond=254 )
[2025-06-05 07:19:45] [INFO ] Flatten gal took : 220 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 149/149 places, 1280/1280 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 147 transition count 1278
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 49 place count 117 transition count 1263
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 79 place count 102 transition count 1248
Applied a total of 79 rules in 35 ms. Remains 102 /149 variables (removed 47) and now considering 1248/1280 (removed 32) transitions.
[2025-06-05 07:19:45] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 102 cols
[2025-06-05 07:19:45] [INFO ] Computed 24 invariants in 21 ms
[2025-06-05 07:19:45] [INFO ] Implicit Places using invariants in 353 ms returned [17, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 358 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 100/149 places, 1248/1280 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 1246
Applied a total of 4 rules in 23 ms. Remains 98 /100 variables (removed 2) and now considering 1246/1248 (removed 2) transitions.
[2025-06-05 07:19:45] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
// Phase 1: matrix 976 rows 98 cols
[2025-06-05 07:19:45] [INFO ] Computed 22 invariants in 11 ms
[2025-06-05 07:19:46] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-06-05 07:19:46] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2025-06-05 07:19:46] [INFO ] Invariant cache hit.
[2025-06-05 07:19:46] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-05 07:19:47] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 98/149 places, 1246/1280 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2075 ms. Remains : 98/149 places, 1246/1280 transitions.
Initial state reduction rules removed 15 formulas.
RANDOM walk for 40000 steps (8 resets) in 4066 ms. (9 steps per ms) remains 572/1231 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/572 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 13 ms. (8 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 571/571 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 571/571 properties
[2025-06-05 07:19:48] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2025-06-05 07:19:48] [INFO ] Invariant cache hit.
[2025-06-05 07:19:48] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 19/94 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/1074 variables, and 113 constraints, problems are : Problem set: 0 solved, 571 unsolved in 5019 ms.
Refiners :[Domain max(s): 94/98 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/4 constraints, State Equation: 0/98 constraints, ReadFeed: 0/465 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 19/94 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem qltransition_32 is UNSAT
SMT process timed out in 13042ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 1246/1246 transitions.
Applied a total of 0 rules in 44 ms. Remains 98 /98 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 98/98 places, 1246/1246 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 174551 ms.
ITS solved all properties within timeout

BK_STOP 1749108002084

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-15"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is SimpleLoadBal-PT-15, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902010100329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-15.tgz
mv SimpleLoadBal-PT-15 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;