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.r377-smll-171683809900177.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 greatspnxred
Input is SimpleLoadBal-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809900177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.0M May 18 16:43 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 SimpleLoadBal-PT-20-CTLCardinality-2024-00
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-01
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-02
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-03
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-04
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-05
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-06
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-07
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-08
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-09
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-10
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2024-11
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2023-12
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2023-13
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2023-14
FORMULA_NAME SimpleLoadBal-PT-20-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716940032097

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 23:47:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 23:47:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:47:14] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2024-05-28 23:47:14] [INFO ] Transformed 194 places.
[2024-05-28 23:47:14] [INFO ] Transformed 2205 transitions.
[2024-05-28 23:47:14] [INFO ] Found NUPN structural information;
[2024-05-28 23:47:14] [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_idle_16, P_client_idle_17, P_client_idle_18, P_client_idle_19, P_client_idle_20, 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_waiting_16, P_client_waiting_17, P_client_waiting_18, P_client_waiting_19, P_client_waiting_20, 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_request_16, P_client_request_17, P_client_request_18, P_client_request_19, P_client_request_20, 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_client_ack_16, P_client_ack_17, P_client_ack_18, P_client_ack_19, P_client_ack_20, 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_server_request_16_1, P_server_request_16_2, P_server_request_17_1, P_server_request_17_2, P_server_request_18_1, P_server_request_18_2, P_server_request_19_1, P_server_request_19_2, P_server_request_20_1, P_server_request_20_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_routing_1_16, P_lb_routing_1_17, P_lb_routing_1_18, P_lb_routing_1_19, P_lb_routing_1_20, 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_1_16, P_lb_load_1_17, P_lb_load_1_18, P_lb_load_1_19, P_lb_load_1_20, 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, P_lb_load_2_16, P_lb_load_2_17, P_lb_load_2_18, P_lb_load_2_19, P_lb_load_2_20]
[2024-05-28 23:47:14] [INFO ] Parsed PT model containing 194 places and 2205 transitions and 15678 arcs in 692 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 67 ms.
FORMULA SimpleLoadBal-PT-20-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Applied a total of 0 rules in 61 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-05-28 23:47:14] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2024-05-28 23:47:15] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-28 23:47:15] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-28 23:47:15] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2024-05-28 23:47:15] [INFO ] Invariants computation overflowed in 18 ms
[2024-05-28 23:47:16] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-05-28 23:47:20] [INFO ] Implicit Places using invariants and state equation in 4953 ms returned [25, 26, 28, 31, 33, 35, 36, 37, 38, 39]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 5673 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/194 places, 2205/2205 transitions.
Applied a total of 0 rules in 19 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5783 ms. Remains : 184/194 places, 2205/2205 transitions.
Support contains 104 out of 184 places after structural reductions.
[2024-05-28 23:47:21] [INFO ] Flatten gal took : 333 ms
[2024-05-28 23:47:21] [INFO ] Flatten gal took : 185 ms
[2024-05-28 23:47:22] [INFO ] Input system was already deterministic with 2205 transitions.
Support contains 100 out of 184 places (down from 104) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4296 ms. (9 steps per ms) remains 9/77 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
[2024-05-28 23:47:24] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 184 cols
[2024-05-28 23:47:24] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-28 23:47:24] [INFO ] State equation strengthened by 820 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 992/1013 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1013 variables, 168/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 827/1840 variables, 105/315 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1840 variables, 105/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 652/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 72/1912 variables, 41/1113 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1912 variables, 41/1154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 23:47:27] [INFO ] Deduced a trap composed of 27 places in 577 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1912 variables, 1/1155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1912 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5309ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 184 transition count 2195
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 174 transition count 2195
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 27 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 42 place count 163 transition count 2184
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 27 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 66 place count 147 transition count 2176
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 23 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 82 place count 139 transition count 2168
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 101 place count 139 transition count 2149
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 120 place count 120 transition count 2149
Applied a total of 120 rules in 792 ms. Remains 120 /184 variables (removed 64) and now considering 2149/2205 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 793 ms. Remains : 120/184 places, 2149/2205 transitions.
RANDOM walk for 40000 steps (8 resets) in 1338 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 138879 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 9
Probabilistic random walk after 138879 steps, saw 106013 distinct states, run finished after 3008 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-28 23:47:34] [INFO ] Flow matrix only has 1689 transitions (discarded 460 similar events)
// Phase 1: matrix 1689 rows 120 cols
[2024-05-28 23:47:34] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-28 23:47:34] [INFO ] State equation strengthened by 820 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 992/1013 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1013 variables, 168/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 796/1809 variables, 99/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 99/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1809 variables, 652/1060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 23:47:37] [INFO ] Deduced a trap composed of 27 places in 563 ms of which 2 ms to minimize.
[2024-05-28 23:47:37] [INFO ] Deduced a trap composed of 28 places in 595 ms of which 2 ms to minimize.
[2024-05-28 23:47:38] [INFO ] Deduced a trap composed of 25 places in 490 ms of which 2 ms to minimize.
[2024-05-28 23:47:39] [INFO ] Deduced a trap composed of 27 places in 528 ms of which 2 ms to minimize.
[2024-05-28 23:47:39] [INFO ] Deduced a trap composed of 27 places in 518 ms of which 2 ms to minimize.
[2024-05-28 23:47:40] [INFO ] Deduced a trap composed of 25 places in 569 ms of which 2 ms to minimize.
[2024-05-28 23:47:40] [INFO ] Deduced a trap composed of 27 places in 571 ms of which 2 ms to minimize.
[2024-05-28 23:47:41] [INFO ] Deduced a trap composed of 24 places in 484 ms of which 2 ms to minimize.
[2024-05-28 23:47:42] [INFO ] Deduced a trap composed of 25 places in 500 ms of which 2 ms to minimize.
[2024-05-28 23:47:42] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2024-05-28 23:47:43] [INFO ] Deduced a trap composed of 25 places in 527 ms of which 1 ms to minimize.
[2024-05-28 23:47:43] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1809 variables, 12/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1809 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1809 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1809/1809 variables, and 1072 constraints, problems are : Problem set: 0 solved, 9 unsolved in 12275 ms.
Refiners :[Domain max(s): 120/120 constraints, State Equation: 120/120 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 992/1013 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1013 variables, 168/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 796/1809 variables, 99/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 99/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1809 variables, 652/1060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1809 variables, 9/1069 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1809 variables, 12/1081 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-28 23:47:51] [INFO ] Deduced a trap composed of 57 places in 374 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1809 variables, 1/1082 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1809 variables, 0/1082 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1809 variables, 0/1082 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1809/1809 variables, and 1082 constraints, problems are : Problem set: 1 solved, 8 unsolved in 9241 ms.
Refiners :[Domain max(s): 120/120 constraints, State Equation: 120/120 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 13/13 constraints]
After SMT, in 21673ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 21829 ms.
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 2149/2149 transitions.
Applied a total of 0 rules in 230 ms. Remains 120 /120 variables (removed 0) and now considering 2149/2149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 120/120 places, 2149/2149 transitions.
RANDOM walk for 40000 steps (8 resets) in 1114 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 134879 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 8
Probabilistic random walk after 134879 steps, saw 102868 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 23:48:21] [INFO ] Flow matrix only has 1689 transitions (discarded 460 similar events)
// Phase 1: matrix 1689 rows 120 cols
[2024-05-28 23:48:21] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-28 23:48:21] [INFO ] State equation strengthened by 820 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 976/996 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/996 variables, 132/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 813/1809 variables, 100/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 100/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1809 variables, 688/1060 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 23:48:24] [INFO ] Deduced a trap composed of 27 places in 462 ms of which 13 ms to minimize.
[2024-05-28 23:48:24] [INFO ] Deduced a trap composed of 25 places in 467 ms of which 1 ms to minimize.
[2024-05-28 23:48:25] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 3 ms to minimize.
[2024-05-28 23:48:25] [INFO ] Deduced a trap composed of 29 places in 478 ms of which 1 ms to minimize.
[2024-05-28 23:48:26] [INFO ] Deduced a trap composed of 25 places in 457 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1809 variables, 5/1065 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1809 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1809 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1809/1809 variables, and 1065 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6470 ms.
Refiners :[Domain max(s): 120/120 constraints, State Equation: 120/120 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 976/996 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/996 variables, 132/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 813/1809 variables, 100/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 100/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1809 variables, 688/1060 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1809 variables, 8/1068 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1809 variables, 5/1073 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1809 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1809 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1809/1809 variables, and 1073 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6845 ms.
Refiners :[Domain max(s): 120/120 constraints, State Equation: 120/120 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 13441ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14959 ms.
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 2149/2149 transitions.
Applied a total of 0 rules in 223 ms. Remains 120 /120 variables (removed 0) and now considering 2149/2149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 120/120 places, 2149/2149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 2149/2149 transitions.
Applied a total of 0 rules in 219 ms. Remains 120 /120 variables (removed 0) and now considering 2149/2149 (removed 0) transitions.
[2024-05-28 23:48:50] [INFO ] Flow matrix only has 1689 transitions (discarded 460 similar events)
// Phase 1: matrix 1689 rows 120 cols
[2024-05-28 23:48:50] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-28 23:48:51] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-28 23:48:51] [INFO ] Flow matrix only has 1689 transitions (discarded 460 similar events)
// Phase 1: matrix 1689 rows 120 cols
[2024-05-28 23:48:51] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-28 23:48:51] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-05-28 23:48:55] [INFO ] Implicit Places using invariants and state equation in 4346 ms returned [12, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4764 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/120 places, 2149/2149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 2148
Applied a total of 2 rules in 230 ms. Remains 117 /118 variables (removed 1) and now considering 2148/2149 (removed 1) transitions.
[2024-05-28 23:48:55] [INFO ] Flow matrix only has 1688 transitions (discarded 460 similar events)
// Phase 1: matrix 1688 rows 117 cols
[2024-05-28 23:48:55] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-28 23:48:56] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-28 23:48:56] [INFO ] Flow matrix only has 1688 transitions (discarded 460 similar events)
// Phase 1: matrix 1688 rows 117 cols
[2024-05-28 23:48:56] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-28 23:48:56] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-05-28 23:49:00] [INFO ] Implicit Places using invariants and state equation in 4389 ms returned []
Implicit Place search using SMT with State Equation took 4778 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 117/120 places, 2148/2149 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9999 ms. Remains : 117/120 places, 2148/2149 transitions.
RANDOM walk for 40000 steps (8 resets) in 1012 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 125571 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 8
Probabilistic random walk after 125571 steps, saw 91114 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-28 23:49:04] [INFO ] Flow matrix only has 1688 transitions (discarded 460 similar events)
// Phase 1: matrix 1688 rows 117 cols
[2024-05-28 23:49:04] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-28 23:49:04] [INFO ] State equation strengthened by 820 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 976/996 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/996 variables, 132/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 809/1805 variables, 97/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1805 variables, 97/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1805 variables, 688/1054 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 23:49:06] [INFO ] Deduced a trap composed of 25 places in 490 ms of which 1 ms to minimize.
[2024-05-28 23:49:06] [INFO ] Deduced a trap composed of 26 places in 485 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1805 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1805 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1805 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1805/1805 variables, and 1056 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3645 ms.
Refiners :[Domain max(s): 117/117 constraints, State Equation: 117/117 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 976/996 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/996 variables, 132/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 809/1805 variables, 97/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1805 variables, 97/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1805 variables, 688/1054 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1805 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1805 variables, 2/1064 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 23:49:11] [INFO ] Deduced a trap composed of 49 places in 395 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1805 variables, 1/1065 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1805 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 23:49:15] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1805 variables, 1/1066 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1805 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1805 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1805/1805 variables, and 1066 constraints, problems are : Problem set: 0 solved, 8 unsolved in 11799 ms.
Refiners :[Domain max(s): 117/117 constraints, State Equation: 117/117 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 15541ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14467 ms.
Support contains 20 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 2148/2148 transitions.
Applied a total of 0 rules in 225 ms. Remains 117 /117 variables (removed 0) and now considering 2148/2148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 117/117 places, 2148/2148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 2148/2148 transitions.
Applied a total of 0 rules in 207 ms. Remains 117 /117 variables (removed 0) and now considering 2148/2148 (removed 0) transitions.
[2024-05-28 23:49:34] [INFO ] Flow matrix only has 1688 transitions (discarded 460 similar events)
// Phase 1: matrix 1688 rows 117 cols
[2024-05-28 23:49:34] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-28 23:49:35] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 23:49:35] [INFO ] Flow matrix only has 1688 transitions (discarded 460 similar events)
// Phase 1: matrix 1688 rows 117 cols
[2024-05-28 23:49:35] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-28 23:49:35] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-05-28 23:49:39] [INFO ] Implicit Places using invariants and state equation in 4439 ms returned []
Implicit Place search using SMT with State Equation took 4835 ms to find 0 implicit places.
[2024-05-28 23:49:39] [INFO ] Redundant transitions in 137 ms returned []
Running 2128 sub problems to find dead transitions.
[2024-05-28 23:49:39] [INFO ] Flow matrix only has 1688 transitions (discarded 460 similar events)
// Phase 1: matrix 1688 rows 117 cols
[2024-05-28 23:49:39] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-28 23:49:39] [INFO ] State equation strengthened by 820 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD125 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 TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 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 TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 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 TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 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 TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 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 TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 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 TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 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 TDEAD529 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 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 TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 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 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 TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 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 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 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 TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2078 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
At refinement iteration 2 (OVERLAPS) 1688/1803 variables, 115/230 constraints. Problems are: Problem set: 863 solved, 1265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1803 variables, 820/1050 constraints. Problems are: Problem set: 863 solved, 1265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1803/1805 variables, and 1050 constraints, problems are : Problem set: 863 solved, 1265 unsolved in 30067 ms.
Refiners :[Domain max(s): 115/117 constraints, State Equation: 115/117 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 2128/2128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 863 solved, 1265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 863 solved, 1265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 863 solved, 1265 unsolved
At refinement iteration 2 (OVERLAPS) 1688/1803 variables, 115/230 constraints. Problems are: Problem set: 863 solved, 1265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1803 variables, 820/1050 constraints. Problems are: Problem set: 863 solved, 1265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1803/1805 variables, and 2313 constraints, problems are : Problem set: 863 solved, 1265 unsolved in 35628 ms.
Refiners :[Domain max(s): 115/117 constraints, State Equation: 115/117 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 1263/2128 constraints, Known Traps: 0/0 constraints]
After SMT, in 111389ms problems are : Problem set: 863 solved, 1265 unsolved
Search for dead transitions found 863 dead transitions in 111425ms
Found 863 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 863 transitions
Dead transitions reduction (with SMT) removed 863 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 117/117 places, 1285/2148 transitions.
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 1281
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 114 transition count 1277
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 112 transition count 1273
Reduce places removed 0 places and 4 transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 5 places and 16 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 10 place count 107 transition count 1253
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 10 rules in 109 ms. Remains 107 /117 variables (removed 10) and now considering 1253/1285 (removed 32) transitions.
[2024-05-28 23:51:31] [INFO ] Flow matrix only has 997 transitions (discarded 256 similar events)
// Phase 1: matrix 997 rows 107 cols
[2024-05-28 23:51:31] [INFO ] Computed 35 invariants in 12 ms
[2024-05-28 23:51:31] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-28 23:51:31] [INFO ] Flow matrix only has 997 transitions (discarded 256 similar events)
[2024-05-28 23:51:31] [INFO ] Invariant cache hit.
[2024-05-28 23:51:31] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-05-28 23:51:33] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/117 places, 1253/2148 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 119022 ms. Remains : 107/117 places, 1253/2148 transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA SimpleLoadBal-PT-20-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 23:51:33] [INFO ] Flatten gal took : 138 ms
[2024-05-28 23:51:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SimpleLoadBal-PT-20-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 23:51:33] [INFO ] Flatten gal took : 135 ms
[2024-05-28 23:51:34] [INFO ] Input system was already deterministic with 2205 transitions.
Support contains 70 out of 184 places (down from 87) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:34] [INFO ] Flatten gal took : 112 ms
[2024-05-28 23:51:34] [INFO ] Flatten gal took : 119 ms
[2024-05-28 23:51:34] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 23 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:34] [INFO ] Flatten gal took : 113 ms
[2024-05-28 23:51:35] [INFO ] Flatten gal took : 106 ms
[2024-05-28 23:51:35] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:35] [INFO ] Flatten gal took : 90 ms
[2024-05-28 23:51:35] [INFO ] Flatten gal took : 100 ms
[2024-05-28 23:51:35] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:35] [INFO ] Flatten gal took : 86 ms
[2024-05-28 23:51:35] [INFO ] Flatten gal took : 96 ms
[2024-05-28 23:51:36] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:36] [INFO ] Flatten gal took : 83 ms
[2024-05-28 23:51:36] [INFO ] Flatten gal took : 89 ms
[2024-05-28 23:51:36] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:36] [INFO ] Flatten gal took : 83 ms
[2024-05-28 23:51:36] [INFO ] Flatten gal took : 90 ms
[2024-05-28 23:51:36] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:36] [INFO ] Flatten gal took : 80 ms
[2024-05-28 23:51:37] [INFO ] Flatten gal took : 91 ms
[2024-05-28 23:51:37] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 184 transition count 2195
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 174 transition count 2195
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 44 place count 162 transition count 2183
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 74 place count 142 transition count 2173
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 132 transition count 2163
Applied a total of 94 rules in 505 ms. Remains 132 /184 variables (removed 52) and now considering 2163/2205 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 505 ms. Remains : 132/184 places, 2163/2205 transitions.
[2024-05-28 23:51:37] [INFO ] Flatten gal took : 117 ms
[2024-05-28 23:51:38] [INFO ] Flatten gal took : 120 ms
[2024-05-28 23:51:38] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:38] [INFO ] Flatten gal took : 144 ms
[2024-05-28 23:51:38] [INFO ] Flatten gal took : 102 ms
[2024-05-28 23:51:38] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:38] [INFO ] Flatten gal took : 78 ms
[2024-05-28 23:51:38] [INFO ] Flatten gal took : 89 ms
[2024-05-28 23:51:39] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:39] [INFO ] Flatten gal took : 77 ms
[2024-05-28 23:51:39] [INFO ] Flatten gal took : 87 ms
[2024-05-28 23:51:39] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:39] [INFO ] Flatten gal took : 78 ms
[2024-05-28 23:51:39] [INFO ] Flatten gal took : 89 ms
[2024-05-28 23:51:39] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2205/2205 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 184/184 places, 2205/2205 transitions.
[2024-05-28 23:51:39] [INFO ] Flatten gal took : 78 ms
[2024-05-28 23:51:40] [INFO ] Flatten gal took : 87 ms
[2024-05-28 23:51:40] [INFO ] Input system was already deterministic with 2205 transitions.
[2024-05-28 23:51:40] [INFO ] Flatten gal took : 85 ms
[2024-05-28 23:51:40] [INFO ] Flatten gal took : 87 ms
[2024-05-28 23:51:40] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-28 23:51:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 2205 transitions and 15658 arcs took 29 ms.
Total runtime 266535 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SimpleLoadBal-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 184
TRANSITIONS: 2205
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.096s, Sys 0.018s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.009s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 697
MODEL NAME: /home/mcc/execution/415/model
184 places, 2205 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SimpleLoadBal-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809900177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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