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.r532-smll-171683810900174.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SimpleLoadBal-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810900174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.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 5.0K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:57 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 1.2M 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-15-ReachabilityCardinality-2023-00
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2023-01
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-02
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-03
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-04
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-05
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-06
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-07
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-08
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-09
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-10
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-11
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2023-12
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-13
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2024-14
FORMULA_NAME SimpleLoadBal-PT-15-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717252943880

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:42:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:42:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:42:26] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2024-06-01 14:42:26] [INFO ] Transformed 149 places.
[2024-06-01 14:42:26] [INFO ] Transformed 1280 transitions.
[2024-06-01 14:42:26] [INFO ] Found NUPN structural information;
[2024-06-01 14:42:26] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2024-06-01 14:42:26] [INFO ] Parsed PT model containing 149 places and 1280 transitions and 8988 arcs in 730 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3746 ms. (10 steps per ms) remains 7/13 properties
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 6/7 properties
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 823 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
[2024-06-01 14:42:28] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2024-06-01 14:42:28] [INFO ] Computed 39 invariants in 56 ms
[2024-06-01 14:42:28] [INFO ] State equation strengthened by 465 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 83/128 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 83/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/136 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 13/149 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1010/1159 variables, 149/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1159 variables, 465/802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1159 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1159 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 802 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1980 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 149/149 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem SimpleLoadBal-PT-15-ReachabilityCardinality-2024-14 is UNSAT
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 83/128 variables, 26/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 83/155 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/136 variables, 8/163 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 13/149 variables, 4/175 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/188 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 14:42:31] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 48 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 1/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1010/1159 variables, 149/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1159 variables, 465/803 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1159 variables, 5/808 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 0/808 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1159 variables, 0/808 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 808 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 149/149 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 7358ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 1280/1280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 1279
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 136 transition count 1273
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 32 place count 130 transition count 1267
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 130 transition count 1256
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 54 place count 119 transition count 1256
Applied a total of 54 rules in 562 ms. Remains 119 /149 variables (removed 30) and now considering 1256/1280 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 119/149 places, 1256/1280 transitions.
RANDOM walk for 40000 steps (8 resets) in 1093 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 148139 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :1 out of 5
Probabilistic random walk after 148139 steps, saw 123187 distinct states, run finished after 3009 ms. (steps per millisecond=49 ) properties seen :1
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 14:42:40] [INFO ] Flow matrix only has 986 transitions (discarded 270 similar events)
// Phase 1: matrix 986 rows 119 cols
[2024-06-01 14:42:40] [INFO ] Invariants computation overflowed in 17 ms
[2024-06-01 14:42:40] [INFO ] State equation strengthened by 465 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 399/411 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 668/1079 variables, 87/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 87/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 390/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/1103 variables, 18/681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 18/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/1105 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1105 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1105 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1105 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1366 ms.
Refiners :[Domain max(s): 119/119 constraints, State Equation: 119/119 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 399/411 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 668/1079 variables, 87/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 87/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 390/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 4/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1079 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 18 places in 413 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1079 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 24/1103 variables, 18/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1103 variables, 18/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1103 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1105 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1105 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1105 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4655 ms.
Refiners :[Domain max(s): 119/119 constraints, State Equation: 119/119 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 6143ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 10607 ms.
Support contains 12 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1256/1256 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 1255
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 106 transition count 1249
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 101 transition count 1244
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 101 transition count 1242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 99 transition count 1242
Applied a total of 34 rules in 300 ms. Remains 99 /119 variables (removed 20) and now considering 1242/1256 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 99/119 places, 1242/1256 transitions.
RANDOM walk for 40000 steps (8 resets) in 840 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 211546 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 211546 steps, saw 159628 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 14:43:00] [INFO ] Flow matrix only has 972 transitions (discarded 270 similar events)
// Phase 1: matrix 972 rows 99 cols
[2024-06-01 14:43:00] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 14:43:00] [INFO ] State equation strengthened by 465 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 399/411 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 658/1069 variables, 85/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 85/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1069 variables, 390/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/1071 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1071 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1071 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1071 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1071/1071 variables, and 663 constraints, problems are : Problem set: 0 solved, 4 unsolved in 725 ms.
Refiners :[Domain max(s): 99/99 constraints, State Equation: 99/99 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 399/411 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 658/1069 variables, 85/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 85/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1069 variables, 390/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 4/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1069 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/1071 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1071 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1071 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1071 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1071/1071 variables, and 667 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3117 ms.
Refiners :[Domain max(s): 99/99 constraints, State Equation: 99/99 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3919ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2108 ms.
Support contains 12 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 1242/1242 transitions.
Applied a total of 0 rules in 71 ms. Remains 99 /99 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 99/99 places, 1242/1242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 1242/1242 transitions.
Applied a total of 0 rules in 67 ms. Remains 99 /99 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 14:43:06] [INFO ] Flow matrix only has 972 transitions (discarded 270 similar events)
// Phase 1: matrix 972 rows 99 cols
[2024-06-01 14:43:06] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 14:43:07] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 14:43:07] [INFO ] Flow matrix only has 972 transitions (discarded 270 similar events)
// Phase 1: matrix 972 rows 99 cols
[2024-06-01 14:43:07] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 14:43:07] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-06-01 14:43:09] [INFO ] Implicit Places using invariants and state equation in 2640 ms returned [3, 5, 27, 28]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 2951 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 95/99 places, 1242/1242 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 91 transition count 1238
Applied a total of 8 rules in 106 ms. Remains 91 /95 variables (removed 4) and now considering 1238/1242 (removed 4) transitions.
[2024-06-01 14:43:09] [INFO ] Flow matrix only has 968 transitions (discarded 270 similar events)
// Phase 1: matrix 968 rows 91 cols
[2024-06-01 14:43:09] [INFO ] Invariants computation overflowed in 13 ms
[2024-06-01 14:43:10] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-06-01 14:43:10] [INFO ] Flow matrix only has 968 transitions (discarded 270 similar events)
// Phase 1: matrix 968 rows 91 cols
[2024-06-01 14:43:10] [INFO ] Invariants computation overflowed in 14 ms
[2024-06-01 14:43:10] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-06-01 14:43:11] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/99 places, 1238/1242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5178 ms. Remains : 91/99 places, 1238/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 810 ms. (49 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 250909 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 250909 steps, saw 130021 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 14:43:15] [INFO ] Flow matrix only has 968 transitions (discarded 270 similar events)
// Phase 1: matrix 968 rows 91 cols
[2024-06-01 14:43:15] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 14:43:15] [INFO ] State equation strengthened by 465 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 399/411 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 648/1059 variables, 79/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 79/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1059 variables, 390/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1059 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1059/1059 variables, and 647 constraints, problems are : Problem set: 0 solved, 4 unsolved in 638 ms.
Refiners :[Domain max(s): 91/91 constraints, State Equation: 91/91 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 399/411 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 648/1059 variables, 79/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 79/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1059 variables, 390/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:43:17] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1059 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1059 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1059/1059 variables, and 652 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2742 ms.
Refiners :[Domain max(s): 91/91 constraints, State Equation: 91/91 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3445ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7841 ms.
Support contains 12 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1238/1238 transitions.
Applied a total of 0 rules in 69 ms. Remains 91 /91 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 91/91 places, 1238/1238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1238/1238 transitions.
Applied a total of 0 rules in 64 ms. Remains 91 /91 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2024-06-01 14:43:26] [INFO ] Flow matrix only has 968 transitions (discarded 270 similar events)
// Phase 1: matrix 968 rows 91 cols
[2024-06-01 14:43:26] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 14:43:27] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 14:43:27] [INFO ] Flow matrix only has 968 transitions (discarded 270 similar events)
// Phase 1: matrix 968 rows 91 cols
[2024-06-01 14:43:27] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 14:43:27] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-06-01 14:43:28] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2024-06-01 14:43:28] [INFO ] Redundant transitions in 122 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 14:43:28] [INFO ] Flow matrix only has 968 transitions (discarded 270 similar events)
// Phase 1: matrix 968 rows 91 cols
[2024-06-01 14:43:28] [INFO ] Invariants computation overflowed in 9 ms
[2024-06-01 14:43:29] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 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 TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 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 TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 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 TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 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 TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 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 TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 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 TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 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 TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 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 TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
At refinement iteration 2 (OVERLAPS) 968/1056 variables, 88/176 constraints. Problems are: Problem set: 417 solved, 806 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1056 variables, 465/641 constraints. Problems are: Problem set: 417 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1056/1059 variables, and 641 constraints, problems are : Problem set: 417 solved, 806 unsolved in 30068 ms.
Refiners :[Domain max(s): 88/91 constraints, State Equation: 88/91 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 417 solved, 806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 417 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 417 solved, 806 unsolved
At refinement iteration 2 (OVERLAPS) 968/1056 variables, 88/176 constraints. Problems are: Problem set: 417 solved, 806 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1056 variables, 465/641 constraints. Problems are: Problem set: 417 solved, 806 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 679/1320 constraints. Problems are: Problem set: 417 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1056/1059 variables, and 1320 constraints, problems are : Problem set: 417 solved, 806 unsolved in 30028 ms.
Refiners :[Domain max(s): 88/91 constraints, State Equation: 88/91 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 679/1223 constraints, Known Traps: 0/0 constraints]
After SMT, in 74440ms problems are : Problem set: 417 solved, 806 unsolved
Search for dead transitions found 417 dead transitions in 74478ms
Found 417 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 417 transitions
Dead transitions reduction (with SMT) removed 417 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/91 places, 821/1238 transitions.
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 817
Reduce places removed 0 places and 4 transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 5 places and 12 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 85 transition count 801
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 6 rules in 41 ms. Remains 85 /91 variables (removed 6) and now considering 801/821 (removed 20) transitions.
[2024-06-01 14:44:43] [INFO ] Flow matrix only has 635 transitions (discarded 166 similar events)
// Phase 1: matrix 635 rows 85 cols
[2024-06-01 14:44:43] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 14:44:43] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 14:44:43] [INFO ] Flow matrix only has 635 transitions (discarded 166 similar events)
[2024-06-01 14:44:43] [INFO ] Invariant cache hit.
[2024-06-01 14:44:43] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-06-01 14:44:44] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/91 places, 801/1238 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78053 ms. Remains : 85/91 places, 801/1238 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 684 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 345489 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 345489 steps, saw 175430 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 14:44:48] [INFO ] Flow matrix only has 635 transitions (discarded 166 similar events)
// Phase 1: matrix 635 rows 81 cols
[2024-06-01 14:44:48] [INFO ] Computed 23 invariants in 11 ms
[2024-06-01 14:44:48] [INFO ] State equation strengthened by 292 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 55/63 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/81 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 635/716 variables, 81/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/716 variables, 292/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/716 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/716 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 716/716 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 55/63 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/81 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:44:49] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 2 ms to minimize.
[2024-06-01 14:44:49] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 635/716 variables, 81/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/716 variables, 292/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/716 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/716 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/716 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 716/716 variables, and 481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1658 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2180ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1666 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 801/801 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 81 transition count 799
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 799
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 6 place count 78 transition count 798
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 76 transition count 797
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 11 place count 75 transition count 796
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 75 transition count 794
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 73 transition count 794
Applied a total of 15 rules in 129 ms. Remains 73 /81 variables (removed 8) and now considering 794/801 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 73/81 places, 794/801 transitions.
RANDOM walk for 40000 steps (8 resets) in 1390 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 355499 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 355499 steps, saw 175507 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-01 14:44:55] [INFO ] Flow matrix only has 628 transitions (discarded 166 similar events)
// Phase 1: matrix 628 rows 73 cols
[2024-06-01 14:44:55] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 14:44:55] [INFO ] State equation strengthened by 292 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 22/25 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/57 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/71 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 627/698 variables, 71/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 292/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/701 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/701 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/701 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/701 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/701 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 548 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 22/25 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/57 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:44:56] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/71 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:44:57] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 627/698 variables, 71/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/698 variables, 292/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/698 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/701 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/701 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/701 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/701 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/701 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 701/701 variables, and 464 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1619 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2195ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1422 ms.
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 794/794 transitions.
Applied a total of 0 rules in 47 ms. Remains 73 /73 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 73/73 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 794/794 transitions.
Applied a total of 0 rules in 46 ms. Remains 73 /73 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-06-01 14:44:59] [INFO ] Flow matrix only has 628 transitions (discarded 166 similar events)
[2024-06-01 14:44:59] [INFO ] Invariant cache hit.
[2024-06-01 14:44:59] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 14:44:59] [INFO ] Flow matrix only has 628 transitions (discarded 166 similar events)
[2024-06-01 14:44:59] [INFO ] Invariant cache hit.
[2024-06-01 14:45:00] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-06-01 14:45:01] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2024-06-01 14:45:01] [INFO ] Redundant transitions in 45 ms returned []
Running 779 sub problems to find dead transitions.
[2024-06-01 14:45:01] [INFO ] Flow matrix only has 628 transitions (discarded 166 similar events)
[2024-06-01 14:45:01] [INFO ] Invariant cache hit.
[2024-06-01 14:45:01] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 4/95 constraints. Problems are: Problem set: 82 solved, 697 unsolved
[2024-06-01 14:45:13] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 14:45:13] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:45:17] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2024-06-01 14:45:17] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 2 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 2 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 2 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 2 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 2 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 1 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 2 ms to minimize.
Problem TDEAD699 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 18/113 constraints. Problems are: Problem set: 85 solved, 694 unsolved
[2024-06-01 14:45:29] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2024-06-01 14:45:29] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 1 ms to minimize.
[2024-06-01 14:45:29] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 1 ms to minimize.
[2024-06-01 14:45:29] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 4/117 constraints. Problems are: Problem set: 85 solved, 694 unsolved
[2024-06-01 14:45:35] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/118 constraints. Problems are: Problem set: 85 solved, 694 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 73/701 variables, and 118 constraints, problems are : Problem set: 85 solved, 694 unsolved in 30041 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/73 constraints, ReadFeed: 0/292 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 85 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 85 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 18/91 constraints. Problems are: Problem set: 85 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 4/95 constraints. Problems are: Problem set: 85 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 23/118 constraints. Problems are: Problem set: 85 solved, 694 unsolved
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 6 ms to minimize.
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 4/122 constraints. Problems are: Problem set: 87 solved, 692 unsolved
[2024-06-01 14:45:53] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/123 constraints. Problems are: Problem set: 87 solved, 692 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/123 constraints. Problems are: Problem set: 87 solved, 692 unsolved
At refinement iteration 7 (OVERLAPS) 628/701 variables, 73/196 constraints. Problems are: Problem set: 87 solved, 692 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 292/488 constraints. Problems are: Problem set: 87 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 1180 constraints, problems are : Problem set: 87 solved, 692 unsolved in 31472 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 692/779 constraints, Known Traps: 28/28 constraints]
After SMT, in 68991ms problems are : Problem set: 87 solved, 692 unsolved
Search for dead transitions found 87 dead transitions in 69007ms
Found 87 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 87 transitions
Dead transitions reduction (with SMT) removed 87 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/73 places, 707/794 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 705
Reduce places removed 0 places and 16 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 1 rules in 30 ms. Remains 72 /73 variables (removed 1) and now considering 689/707 (removed 18) transitions.
[2024-06-01 14:46:10] [INFO ] Flow matrix only has 545 transitions (discarded 144 similar events)
// Phase 1: matrix 545 rows 72 cols
[2024-06-01 14:46:10] [INFO ] Computed 24 invariants in 4 ms
[2024-06-01 14:46:10] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 14:46:10] [INFO ] Flow matrix only has 545 transitions (discarded 144 similar events)
[2024-06-01 14:46:10] [INFO ] Invariant cache hit.
[2024-06-01 14:46:10] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-06-01 14:46:11] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 72/73 places, 689/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72172 ms. Remains : 72/73 places, 689/794 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2023-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-ReachabilityCardinality-2023-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 225633 ms.
ITS solved all properties within timeout

BK_STOP 1717253171794

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SimpleLoadBal-PT-15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810900174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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