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-174902009300065.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-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009300065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 535K 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-10-UpperBounds-00
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-01
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-02
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-03
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-04
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-05
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-06
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-07
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-08
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-09
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-10
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-11
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-12
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-13
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-14
FORMULA_NAME SimpleLoadBal-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749107746148

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:15:47] [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:15:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:15:47] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-05 07:15:47] [INFO ] Transformed 104 places.
[2025-06-05 07:15:47] [INFO ] Transformed 605 transitions.
[2025-06-05 07:15:47] [INFO ] Found NUPN structural information;
[2025-06-05 07:15:47] [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_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_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_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_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_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_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_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]
[2025-06-05 07:15:47] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SimpleLoadBal-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-08 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 07:15:47] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2025-06-05 07:15:47] [INFO ] Computed 29 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (2 resets) in 78 ms. (126 steps per ms)
FORMULA SimpleLoadBal-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-05 07:15:47] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-05 07:15:47] [INFO ] Invariant cache hit.
[2025-06-05 07:15:48] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2025-06-05 07:15:48] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 6 ms returned sat
[2025-06-05 07:15:48] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-05 07:15:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 21 ms returned sat
[2025-06-05 07:15:48] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:48] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-05 07:15:48] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-05 07:15:48] [INFO ] [Nat]Added 210 Read/Feed constraints in 100 ms returned sat
[2025-06-05 07:15:48] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 7 ms to minimize.
[2025-06-05 07:15:48] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 4 ms to minimize.
[2025-06-05 07:15:48] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2025-06-05 07:15:49] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2025-06-05 07:15:49] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2025-06-05 07:15:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 685 ms
[2025-06-05 07:15:49] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 84 ms.
[2025-06-05 07:15:49] [INFO ] Added : 9 causal constraints over 2 iterations in 158 ms. Result :sat
Minimization took 504 ms.
[2025-06-05 07:15:49] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2025-06-05 07:15:49] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:49] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-06-05 07:15:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:50] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2025-06-05 07:15:50] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:50] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-05 07:15:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 07:15:51] [INFO ] [Nat]Added 210 Read/Feed constraints in 1020 ms returned unknown
[2025-06-05 07:15:51] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2025-06-05 07:15:51] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:51] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-05 07:15:51] [INFO ] [Real]Added 210 Read/Feed constraints in 34 ms returned sat
[2025-06-05 07:15:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:51] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2025-06-05 07:15:51] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:51] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-05 07:15:51] [INFO ] [Nat]Added 210 Read/Feed constraints in 188 ms returned sat
[2025-06-05 07:15:51] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2025-06-05 07:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-06-05 07:15:51] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 47 ms.
[2025-06-05 07:15:52] [INFO ] Added : 8 causal constraints over 2 iterations in 222 ms. Result :sat
Minimization took 510 ms.
[2025-06-05 07:15:52] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2025-06-05 07:15:52] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:52] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-05 07:15:52] [INFO ] [Real]Added 210 Read/Feed constraints in 31 ms returned sat
[2025-06-05 07:15:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:52] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2025-06-05 07:15:52] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:52] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-05 07:15:53] [INFO ] [Nat]Added 210 Read/Feed constraints in 433 ms returned sat
[2025-06-05 07:15:53] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2025-06-05 07:15:53] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2025-06-05 07:15:53] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2025-06-05 07:15:53] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2025-06-05 07:15:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 505 ms
[2025-06-05 07:15:53] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 38 ms.
[2025-06-05 07:15:53] [INFO ] Added : 11 causal constraints over 3 iterations in 162 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 605/605 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 603
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 34 place count 82 transition count 593
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 54 place count 72 transition count 583
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 72 transition count 573
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 62 transition count 573
Applied a total of 74 rules in 134 ms. Remains 62 /104 variables (removed 42) and now considering 573/605 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 62/104 places, 573/605 transitions.
[2025-06-05 07:15:54] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
// Phase 1: matrix 443 rows 62 cols
[2025-06-05 07:15:54] [INFO ] Computed 19 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 5458 ms. (183 steps per ms)
BEST_FIRST walk for 4000002 steps (8 resets) in 4689 ms. (852 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-05 07:16:04] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2025-06-05 07:16:04] [INFO ] Invariant cache hit.
[2025-06-05 07:16:04] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:04] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:04] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-05 07:16:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:04] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-05 07:16:04] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-05 07:16:04] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-05 07:16:05] [INFO ] [Nat]Added 210 Read/Feed constraints in 44 ms returned sat
[2025-06-05 07:16:05] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2025-06-05 07:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-05 07:16:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 433 transitions) in 34 ms.
[2025-06-05 07:16:05] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Minimization took 185 ms.
[2025-06-05 07:16:05] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:05] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-05 07:16:05] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-05 07:16:05] [INFO ] [Real]Added 210 Read/Feed constraints in 34 ms returned sat
[2025-06-05 07:16:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-05 07:16:05] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-05 07:16:05] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-05 07:16:05] [INFO ] [Nat]Added 210 Read/Feed constraints in 49 ms returned sat
[2025-06-05 07:16:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2025-06-05 07:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-06-05 07:16:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 433 transitions) in 34 ms.
[2025-06-05 07:16:05] [INFO ] Added : 0 causal constraints over 0 iterations in 68 ms. Result :sat
Minimization took 165 ms.
[2025-06-05 07:16:06] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Real]Added 210 Read/Feed constraints in 37 ms returned sat
[2025-06-05 07:16:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Nat]Added 210 Read/Feed constraints in 58 ms returned sat
[2025-06-05 07:16:06] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2025-06-05 07:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-06-05 07:16:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 433 transitions) in 42 ms.
[2025-06-05 07:16:06] [INFO ] Added : 0 causal constraints over 0 iterations in 85 ms. Result :sat
Minimization took 163 ms.
[2025-06-05 07:16:06] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-05 07:16:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:06] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:07] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-06-05 07:16:07] [INFO ] [Nat]Added 210 Read/Feed constraints in 70 ms returned sat
[2025-06-05 07:16:07] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2025-06-05 07:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-06-05 07:16:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 433 transitions) in 37 ms.
[2025-06-05 07:16:07] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 573/573 transitions.
Applied a total of 0 rules in 21 ms. Remains 62 /62 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 62/62 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 573/573 transitions.
Applied a total of 0 rules in 20 ms. Remains 62 /62 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2025-06-05 07:16:07] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2025-06-05 07:16:07] [INFO ] Invariant cache hit.
[2025-06-05 07:16:07] [INFO ] Implicit Places using invariants in 185 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 191 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 573/573 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 58 transition count 571
Applied a total of 4 rules in 27 ms. Remains 58 /60 variables (removed 2) and now considering 571/573 (removed 2) transitions.
[2025-06-05 07:16:07] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
// Phase 1: matrix 441 rows 58 cols
[2025-06-05 07:16:07] [INFO ] Computed 17 invariants in 4 ms
[2025-06-05 07:16:08] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-05 07:16:08] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2025-06-05 07:16:08] [INFO ] Invariant cache hit.
[2025-06-05 07:16:08] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-05 07:16:08] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 571/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 857 ms. Remains : 58/62 places, 571/573 transitions.
[2025-06-05 07:16:08] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2025-06-05 07:16:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 6378 ms. (156 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 4748 ms. (842 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-05 07:16:19] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2025-06-05 07:16:19] [INFO ] Invariant cache hit.
[2025-06-05 07:16:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:19] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:19] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-05 07:16:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:19] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:19] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-05 07:16:19] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-05 07:16:20] [INFO ] [Nat]Added 210 Read/Feed constraints in 98 ms returned sat
[2025-06-05 07:16:20] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2025-06-05 07:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-05 07:16:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 431 transitions) in 36 ms.
[2025-06-05 07:16:20] [INFO ] Added : 0 causal constraints over 0 iterations in 73 ms. Result :sat
Minimization took 788 ms.
[2025-06-05 07:16:21] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-05 07:16:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Nat]Added 210 Read/Feed constraints in 86 ms returned sat
[2025-06-05 07:16:21] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2025-06-05 07:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-05 07:16:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 431 transitions) in 51 ms.
[2025-06-05 07:16:21] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Minimization took 211 ms.
[2025-06-05 07:16:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-05 07:16:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:21] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-05 07:16:22] [INFO ] [Nat]Added 210 Read/Feed constraints in 169 ms returned sat
[2025-06-05 07:16:22] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2025-06-05 07:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-05 07:16:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 431 transitions) in 51 ms.
[2025-06-05 07:16:22] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Minimization took 217 ms.
[2025-06-05 07:16:22] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:22] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:16:22] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-05 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 07:16:22] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:16:22] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-05 07:16:22] [INFO ] [Nat]Added 210 Read/Feed constraints in 124 ms returned sat
[2025-06-05 07:16:23] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 8 ms to minimize.
[2025-06-05 07:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-05 07:16:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 431 transitions) in 31 ms.
[2025-06-05 07:16:23] [INFO ] Added : 0 causal constraints over 0 iterations in 66 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 571/571 transitions.
Applied a total of 0 rules in 20 ms. Remains 58 /58 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 58/58 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 571/571 transitions.
Applied a total of 0 rules in 20 ms. Remains 58 /58 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2025-06-05 07:16:23] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2025-06-05 07:16:23] [INFO ] Invariant cache hit.
[2025-06-05 07:16:24] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-06-05 07:16:24] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2025-06-05 07:16:24] [INFO ] Invariant cache hit.
[2025-06-05 07:16:24] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-05 07:16:24] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2025-06-05 07:16:24] [INFO ] Redundant transitions in 26 ms returned []
Running 561 sub problems to find dead transitions.
[2025-06-05 07:16:24] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2025-06-05 07:16:24] [INFO ] Invariant cache hit.
[2025-06-05 07:16:24] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 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 TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 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 TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 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 TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 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 TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 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 TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 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 TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 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 TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 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 TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/75 constraints. Problems are: Problem set: 192 solved, 369 unsolved
[2025-06-05 07:16:29] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 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
[2025-06-05 07:16:30] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2025-06-05 07:16:31] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 17 ms to minimize.
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 10/85 constraints. Problems are: Problem set: 221 solved, 340 unsolved
[2025-06-05 07:16:33] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:16:33] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/87 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/87 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 441/499 variables, 58/145 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 210/355 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/355 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/355 constraints. Problems are: Problem set: 221 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 355 constraints, problems are : Problem set: 221 solved, 340 unsolved in 17534 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 221 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 13/71 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/75 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/87 constraints. Problems are: Problem set: 221 solved, 340 unsolved
[2025-06-05 07:16:46] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/88 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/88 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 441/499 variables, 58/146 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 210/356 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 340/696 constraints. Problems are: Problem set: 221 solved, 340 unsolved
[2025-06-05 07:16:54] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/697 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/697 constraints. Problems are: Problem set: 221 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 697 constraints, problems are : Problem set: 221 solved, 340 unsolved in 30031 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 340/561 constraints, Known Traps: 14/14 constraints]
After SMT, in 50782ms problems are : Problem set: 221 solved, 340 unsolved
Search for dead transitions found 221 dead transitions in 50835ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 350/571 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 348
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 55 transition count 346
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 54 transition count 344
Reduce places removed 0 places and 2 transitions.
Graph (complete) has 875 edges and 54 vertex of which 4 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 342 output transitions
Drop transitions (Output transitions of discarded places.) removed 342 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 4 transition count 0
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 17 ms. Remains 4 /58 variables (removed 54) and now considering 0/350 (removed 350) transitions.
[2025-06-05 07:17:15] [INFO ] Computed 0 invariants in 0 ms
[2025-06-05 07:17:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-05 07:17:15] [INFO ] Invariant cache hit.
[2025-06-05 07:17:15] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4/58 places, 0/571 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51696 ms. Remains : 4/58 places, 0/571 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 88103 ms.

BK_STOP 1749107835529

--------------------
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-10"
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-10, 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-174902009300065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 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 ;