Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r223-tall-174902009300066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is SimpleLoadBal-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009300066
=====================================================================

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-00
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-01
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-02
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-03
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-04
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-05
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-06
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-07
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-08
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-09
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-10
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-11
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-12
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-13
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-14
FORMULA_NAME SimpleLoadBal-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749107783113

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 07:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:16:24] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2025-06-05 07:16:24] [INFO ] Transformed 149 places.
[2025-06-05 07:16:24] [INFO ] Transformed 1280 transitions.
[2025-06-05 07:16:24] [INFO ] Found NUPN structural information;
[2025-06-05 07:16:24] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2025-06-05 07:16:24] [INFO ] Parsed PT model containing 149 places and 1280 transitions and 8988 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SimpleLoadBal-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 07:16:24] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2025-06-05 07:16:24] [INFO ] Computed 39 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 104 ms. (95 steps per ms)
FORMULA SimpleLoadBal-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 07:16:24] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-05 07:16:24] [INFO ] Invariant cache hit.
[2025-06-05 07:16:25] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-06-05 07:16:25] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 6 ms returned sat
[2025-06-05 07:16:25] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-06-05 07:16:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-06-05 07:16:25] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 8 ms returned sat
[2025-06-05 07:16:25] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-06-05 07:16:25] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-05 07:16:26] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 07:16:26] [INFO ] [Nat]Added 465 Read/Feed constraints in 1097 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 149 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place P_lb_load_1_15) removed 34 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 1246/1246 transitions.
Reduce places removed 1 places and 33 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 1213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 146 transition count 1211
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 50 place count 116 transition count 1196
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 80 place count 101 transition count 1181
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 95 place count 101 transition count 1166
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 110 place count 86 transition count 1166
Applied a total of 110 rules in 375 ms. Remains 86 /149 variables (removed 63) and now considering 1166/1246 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 86/149 places, 1166/1246 transitions.
[2025-06-05 07:16:27] [INFO ] Flow matrix only has 914 transitions (discarded 252 similar events)
// Phase 1: matrix 914 rows 86 cols
[2025-06-05 07:16:27] [INFO ] Invariants computation overflowed in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 8753 ms. (114 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1622 ms. (616 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 07:16:37] [INFO ] Flow matrix only has 914 transitions (discarded 252 similar events)
// Phase 1: matrix 914 rows 86 cols
[2025-06-05 07:16:37] [INFO ] Invariants computation overflowed in 14 ms
[2025-06-05 07:16:37] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-06-05 07:16:37] [INFO ] State equation strengthened by 448 read => feed constraints.
[2025-06-05 07:16:38] [INFO ] [Real]Added 448 Read/Feed constraints in 75 ms returned sat
[2025-06-05 07:16:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:38] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-05 07:16:38] [INFO ] [Nat]Added 448 Read/Feed constraints in 161 ms returned sat
[2025-06-05 07:16:38] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 5 ms to minimize.
[2025-06-05 07:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-06-05 07:16:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 899 transitions) in 168 ms.
[2025-06-05 07:16:38] [INFO ] Added : 0 causal constraints over 0 iterations in 262 ms. Result :sat
Minimization took 425 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1166/1166 transitions.
Applied a total of 0 rules in 84 ms. Remains 86 /86 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 86/86 places, 1166/1166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1166/1166 transitions.
Applied a total of 0 rules in 106 ms. Remains 86 /86 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
[2025-06-05 07:16:39] [INFO ] Flow matrix only has 914 transitions (discarded 252 similar events)
// Phase 1: matrix 914 rows 86 cols
[2025-06-05 07:16:39] [INFO ] Invariants computation overflowed in 13 ms
[2025-06-05 07:16:39] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-05 07:16:39] [INFO ] Flow matrix only has 914 transitions (discarded 252 similar events)
// Phase 1: matrix 914 rows 86 cols
[2025-06-05 07:16:39] [INFO ] Invariants computation overflowed in 11 ms
[2025-06-05 07:16:40] [INFO ] State equation strengthened by 448 read => feed constraints.
[2025-06-05 07:16:41] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned [17, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1604 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/86 places, 1166/1166 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 1164
Applied a total of 4 rules in 77 ms. Remains 82 /84 variables (removed 2) and now considering 1164/1166 (removed 2) transitions.
[2025-06-05 07:16:41] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:41] [INFO ] Invariants computation overflowed in 13 ms
[2025-06-05 07:16:41] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-05 07:16:41] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:41] [INFO ] Invariants computation overflowed in 19 ms
[2025-06-05 07:16:41] [INFO ] State equation strengthened by 448 read => feed constraints.
[2025-06-05 07:16:42] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/86 places, 1164/1166 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3103 ms. Remains : 82/86 places, 1164/1166 transitions.
[2025-06-05 07:16:42] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:42] [INFO ] Invariants computation overflowed in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 10244 ms. (97 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1543 ms. (647 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 07:16:54] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:54] [INFO ] Invariants computation overflowed in 8 ms
[2025-06-05 07:16:54] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-05 07:16:54] [INFO ] State equation strengthened by 448 read => feed constraints.
[2025-06-05 07:16:54] [INFO ] [Real]Added 448 Read/Feed constraints in 61 ms returned sat
[2025-06-05 07:16:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:54] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-06-05 07:16:55] [INFO ] [Nat]Added 448 Read/Feed constraints in 168 ms returned sat
[2025-06-05 07:16:55] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 4 ms to minimize.
[2025-06-05 07:16:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2025-06-05 07:16:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 897 transitions) in 88 ms.
[2025-06-05 07:16:55] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Minimization took 999 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1164/1164 transitions.
Applied a total of 0 rules in 69 ms. Remains 82 /82 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 82/82 places, 1164/1164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1164/1164 transitions.
Applied a total of 0 rules in 68 ms. Remains 82 /82 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
[2025-06-05 07:16:56] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:56] [INFO ] Invariants computation overflowed in 11 ms
[2025-06-05 07:16:56] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-05 07:16:56] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:56] [INFO ] Invariants computation overflowed in 5 ms
[2025-06-05 07:16:57] [INFO ] State equation strengthened by 448 read => feed constraints.
[2025-06-05 07:16:57] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2025-06-05 07:16:57] [INFO ] Redundant transitions in 63 ms returned []
Running 1149 sub problems to find dead transitions.
[2025-06-05 07:16:57] [INFO ] Flow matrix only has 912 transitions (discarded 252 similar events)
// Phase 1: matrix 912 rows 82 cols
[2025-06-05 07:16:57] [INFO ] Invariants computation overflowed in 6 ms
[2025-06-05 07:16:58] [INFO ] State equation strengthened by 448 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
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 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 TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem 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 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 TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 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 TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 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 TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 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 TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 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 TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 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 TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 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 TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 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 TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 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 TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 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 TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 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 TDEAD1050 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 TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
At refinement iteration 2 (OVERLAPS) 912/993 variables, 81/162 constraints. Problems are: Problem set: 436 solved, 713 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/993 variables, 448/610 constraints. Problems are: Problem set: 436 solved, 713 unsolved
[2025-06-05 07:17:22] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2025-06-05 07:17:23] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2025-06-05 07:17:26] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2025-06-05 07:17:32] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2025-06-05 07:17:32] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2025-06-05 07:17:32] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2025-06-05 07:17:33] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2025-06-05 07:17:33] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2025-06-05 07:17:33] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:17:33] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2025-06-05 07:17:33] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2025-06-05 07:17:34] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2025-06-05 07:17:34] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
[2025-06-05 07:17:34] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1147 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 14/624 constraints. Problems are: Problem set: 444 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/994 variables, and 624 constraints, problems are : Problem set: 444 solved, 705 unsolved in 30027 ms.
Refiners :[Domain max(s): 81/82 constraints, State Equation: 81/82 constraints, ReadFeed: 448/448 constraints, PredecessorRefiner: 1149/1149 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 444 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 444 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 14/95 constraints. Problems are: Problem set: 444 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/95 constraints. Problems are: Problem set: 444 solved, 705 unsolved
At refinement iteration 3 (OVERLAPS) 912/993 variables, 81/176 constraints. Problems are: Problem set: 444 solved, 705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 448/624 constraints. Problems are: Problem set: 444 solved, 705 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 209/833 constraints. Problems are: Problem set: 444 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/994 variables, and 833 constraints, problems are : Problem set: 444 solved, 705 unsolved in 30020 ms.
Refiners :[Domain max(s): 81/82 constraints, State Equation: 81/82 constraints, ReadFeed: 448/448 constraints, PredecessorRefiner: 209/1149 constraints, Known Traps: 14/14 constraints]
After SMT, in 70000ms problems are : Problem set: 444 solved, 705 unsolved
Search for dead transitions found 444 dead transitions in 70031ms
Found 444 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 444 transitions
Dead transitions reduction (with SMT) removed 444 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 720/1164 transitions.
Graph (complete) has 1769 edges and 82 vertex of which 1 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.2 ms
Discarding 81 places :
Also discarding 720 output transitions
Drop transitions (Output transitions of discarded places.) removed 720 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 16 ms. Remains 1 /82 variables (removed 81) and now considering 0/720 (removed 720) transitions.
[2025-06-05 07:18:07] [INFO ] Computed 0 invariants in 1 ms
[2025-06-05 07:18:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-05 07:18:08] [INFO ] Invariant cache hit.
[2025-06-05 07:18:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/82 places, 0/1164 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71466 ms. Remains : 1/82 places, 0/1164 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-15-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 103735 ms.

BK_STOP 1749107888158

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SimpleLoadBal-PT-15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-174902009300066"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;