Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902010000319.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-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902010000319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K 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 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 155K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1749107687205

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:14:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:14:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:14:48] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2025-06-05 07:14:48] [INFO ] Transformed 59 places.
[2025-06-05 07:14:48] [INFO ] Transformed 180 transitions.
[2025-06-05 07:14:48] [INFO ] Found NUPN structural information;
[2025-06-05 07:14:48] [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_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, 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_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_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_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]
[2025-06-05 07:14:48] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 166 ms.
Built sparse matrix representations for Structural reductions in 5 ms.18026KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 59/59 places, 180/180 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 26 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 38 ms. Remains : 59/59 places, 180/180 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 59/59 places, 180/180 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 23 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-05 07:14:48] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2025-06-05 07:14:48] [INFO ] Computed 19 invariants in 16 ms
[2025-06-05 07:14:48] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-05 07:14:48] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2025-06-05 07:14:48] [INFO ] Invariant cache hit.
[2025-06-05 07:14:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 07:14:49] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2025-06-05 07:14:49] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2025-06-05 07:14:49] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2025-06-05 07:14:49] [INFO ] Invariant cache hit.
[2025-06-05 07:14:49] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-05 07:14:49] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 7 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 5/59 variables, 9/72 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 5/77 constraints. Problems are: Problem set: 1 solved, 174 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/79 constraints. Problems are: Problem set: 39 solved, 136 unsolved
[2025-06-05 07:14:51] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
[2025-06-05 07:14:51] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2025-06-05 07:14:51] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2025-06-05 07:14:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
[2025-06-05 07:14:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2025-06-05 07:14:51] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 6/85 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/85 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 140/199 variables, 59/144 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 55/199 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/199 constraints. Problems are: Problem set: 44 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 199 constraints, problems are : Problem set: 44 solved, 131 unsolved in 4556 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 44 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/62 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/66 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 5/59 variables, 9/75 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 5/80 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/82 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 3/85 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/85 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 140/199 variables, 59/144 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 55/199 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 131/330 constraints. Problems are: Problem set: 44 solved, 131 unsolved
[2025-06-05 07:14:56] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 1/331 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/331 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/199 variables, 0/331 constraints. Problems are: Problem set: 44 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 331 constraints, problems are : Problem set: 44 solved, 131 unsolved in 6326 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 131/175 constraints, Known Traps: 8/8 constraints]
After SMT, in 11204ms problems are : Problem set: 44 solved, 131 unsolved
Search for dead transitions found 44 dead transitions in 11217ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 59/59 places, 136/180 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Reduce places removed 0 places and 2 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Graph (complete) has 401 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 134
Reduce places removed 0 places and 6 transitions.
Computed a total of 1 stabilizing places and 0 stable transitions
Graph (complete) has 380 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 128
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 2 rules in 28 ms. Remains 56 /59 variables (removed 3) and now considering 128/136 (removed 8) transitions.
[2025-06-05 07:15:00] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
// Phase 1: matrix 104 rows 56 cols
[2025-06-05 07:15:00] [INFO ] Computed 19 invariants in 5 ms
[2025-06-05 07:15:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 07:15:00] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
[2025-06-05 07:15:00] [INFO ] Invariant cache hit.
[2025-06-05 07:15:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 07:15:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 56/59 places, 128/180 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 11691 ms. Remains : 56/59 places, 128/180 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2181 ms (no deadlock found). (steps per millisecond=573 )
Random directed walk for 1250000 steps, including 0 resets, run took 1669 ms (no deadlock found). (steps per millisecond=748 )
[2025-06-05 07:15:04] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
[2025-06-05 07:15:04] [INFO ] Invariant cache hit.
[2025-06-05 07:15:04] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-05 07:15:04] [INFO ] [Real]Absence check using 17 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:15:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-05 07:15:04] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:04] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:15:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 07:15:04] [INFO ] [Nat]Added 37 Read/Feed constraints in 22 ms returned sat
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2025-06-05 07:15:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 381 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 59/59 places, 180/180 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 57 transition count 178
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 19 place count 47 transition count 173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 29 place count 42 transition count 168
Applied a total of 29 rules in 10 ms. Remains 42 /59 variables (removed 17) and now considering 168/180 (removed 12) transitions.
[2025-06-05 07:15:04] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 42 cols
[2025-06-05 07:15:04] [INFO ] Computed 14 invariants in 2 ms
[2025-06-05 07:15:04] [INFO ] Implicit Places using invariants in 78 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 40/59 places, 168/180 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 38 transition count 166
Applied a total of 4 rules in 5 ms. Remains 38 /40 variables (removed 2) and now considering 166/168 (removed 2) transitions.
[2025-06-05 07:15:04] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
// Phase 1: matrix 126 rows 38 cols
[2025-06-05 07:15:04] [INFO ] Computed 12 invariants in 2 ms
[2025-06-05 07:15:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 07:15:05] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2025-06-05 07:15:05] [INFO ] Invariant cache hit.
[2025-06-05 07:15:05] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 07:15:05] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 38/59 places, 166/180 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 294 ms. Remains : 38/59 places, 166/180 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 1853 ms. (21 steps per ms) remains 52/161 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
[2025-06-05 07:15:06] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2025-06-05 07:15:06] [INFO ] Invariant cache hit.
[2025-06-05 07:15:06] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 10/36 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem qltransition_13 is UNSAT
SMT process timed out in 308ms, After SMT, problems are : Problem set: 0 solved, 52 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 166/166 transitions.
Applied a total of 0 rules in 9 ms. Remains 38 /38 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 38/38 places, 166/166 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 18129 ms.
ITS solved all properties within timeout

BK_STOP 1749107706936

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;