Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text 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 1717252290643

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:31:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:31:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:31:33] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2024-06-01 14:31:33] [INFO ] Transformed 104 places.
[2024-06-01 14:31:33] [INFO ] Transformed 605 transitions.
[2024-06-01 14:31:33] [INFO ] Found NUPN structural information;
[2024-06-01 14:31:33] [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]
[2024-06-01 14:31:33] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 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-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-04 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]
[2024-06-01 14:31:33] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-06-01 14:31:33] [INFO ] Computed 29 invariants in 36 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 109 ms. (90 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-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-09 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-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-02 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 10001 steps (2 resets) in 31 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 14:31:33] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-06-01 14:31:33] [INFO ] Invariant cache hit.
[2024-06-01 14:31:34] [INFO ] [Real]Absence check using 25 positive place invariants in 21 ms returned sat
[2024-06-01 14:31:34] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 13 ms returned sat
[2024-06-01 14:31:34] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-06-01 14:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:34] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2024-06-01 14:31:34] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned sat
[2024-06-01 14:31:34] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-06-01 14:31:34] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 14:31:35] [INFO ] [Nat]Added 210 Read/Feed constraints in 299 ms returned sat
[2024-06-01 14:31:35] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 36 ms to minimize.
[2024-06-01 14:31:35] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 2 ms to minimize.
[2024-06-01 14:31:36] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:31:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1204 ms
[2024-06-01 14:31:36] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 151 ms.
[2024-06-01 14:31:36] [INFO ] Added : 12 causal constraints over 3 iterations in 406 ms. Result :sat
Minimization took 576 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 104 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place P_lb_load_1_9) removed 45 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 560/560 transitions.
Reduce places removed 1 places and 24 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 536
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 524
Reduce places removed 1 places and 23 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 101 transition count 501
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 3 with 4 rules applied. Total rules applied 7 place count 99 transition count 499
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 37 place count 79 transition count 489
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 69 transition count 479
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 67 place count 69 transition count 469
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 77 place count 59 transition count 469
Applied a total of 77 rules in 277 ms. Remains 59 /104 variables (removed 45) and now considering 469/560 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 59/104 places, 469/560 transitions.
[2024-06-01 14:31:37] [INFO ] Flow matrix only has 365 transitions (discarded 104 similar events)
// Phase 1: matrix 365 rows 59 cols
[2024-06-01 14:31:37] [INFO ] Computed 19 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 7028 ms. (142 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1392 ms. (717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 14:31:46] [INFO ] Flow matrix only has 365 transitions (discarded 104 similar events)
[2024-06-01 14:31:46] [INFO ] Invariant cache hit.
[2024-06-01 14:31:46] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 14:31:46] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 14:31:46] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 14:31:46] [INFO ] State equation strengthened by 176 read => feed constraints.
[2024-06-01 14:31:46] [INFO ] [Real]Added 176 Read/Feed constraints in 44 ms returned sat
[2024-06-01 14:31:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 14:31:46] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 14:31:46] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 14:31:46] [INFO ] [Nat]Added 176 Read/Feed constraints in 62 ms returned sat
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:31:47] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 4 ms to minimize.
[2024-06-01 14:31:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 484 ms
[2024-06-01 14:31:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 355 transitions) in 55 ms.
[2024-06-01 14:31:47] [INFO ] Added : 0 causal constraints over 0 iterations in 96 ms. Result :sat
Minimization took 171 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 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 469/469 transitions.
Applied a total of 0 rules in 33 ms. Remains 59 /59 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 59/59 places, 469/469 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 469/469 transitions.
Applied a total of 0 rules in 33 ms. Remains 59 /59 variables (removed 0) and now considering 469/469 (removed 0) transitions.
[2024-06-01 14:31:47] [INFO ] Flow matrix only has 365 transitions (discarded 104 similar events)
[2024-06-01 14:31:47] [INFO ] Invariant cache hit.
[2024-06-01 14:31:47] [INFO ] Implicit Places using invariants in 272 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 277 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/59 places, 469/469 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 55 transition count 467
Applied a total of 4 rules in 27 ms. Remains 55 /57 variables (removed 2) and now considering 467/469 (removed 2) transitions.
[2024-06-01 14:31:47] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
// Phase 1: matrix 363 rows 55 cols
[2024-06-01 14:31:47] [INFO ] Computed 17 invariants in 6 ms
[2024-06-01 14:31:48] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 14:31:48] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
[2024-06-01 14:31:48] [INFO ] Invariant cache hit.
[2024-06-01 14:31:48] [INFO ] State equation strengthened by 176 read => feed constraints.
[2024-06-01 14:31:48] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/59 places, 467/469 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1276 ms. Remains : 55/59 places, 467/469 transitions.
[2024-06-01 14:31:48] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
[2024-06-01 14:31:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 8013 ms. (124 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1785 ms. (559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 14:31:58] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
[2024-06-01 14:31:58] [INFO ] Invariant cache hit.
[2024-06-01 14:31:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:31:58] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:31:58] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-01 14:31:58] [INFO ] State equation strengthened by 176 read => feed constraints.
[2024-06-01 14:31:58] [INFO ] [Real]Added 176 Read/Feed constraints in 44 ms returned sat
[2024-06-01 14:31:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:31:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:31:58] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:31:59] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-01 14:31:59] [INFO ] [Nat]Added 176 Read/Feed constraints in 94 ms returned sat
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-06-01 14:31:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 353 transitions) in 64 ms.
[2024-06-01 14:31:59] [INFO ] Added : 0 causal constraints over 0 iterations in 107 ms. Result :sat
Minimization took 413 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 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 467/467 transitions.
Applied a total of 0 rules in 30 ms. Remains 55 /55 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 55/55 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 467/467 transitions.
Applied a total of 0 rules in 30 ms. Remains 55 /55 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2024-06-01 14:31:59] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
[2024-06-01 14:31:59] [INFO ] Invariant cache hit.
[2024-06-01 14:32:00] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 14:32:00] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
[2024-06-01 14:32:00] [INFO ] Invariant cache hit.
[2024-06-01 14:32:00] [INFO ] State equation strengthened by 176 read => feed constraints.
[2024-06-01 14:32:00] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2024-06-01 14:32:00] [INFO ] Redundant transitions in 42 ms returned []
Running 457 sub problems to find dead transitions.
[2024-06-01 14:32:00] [INFO ] Flow matrix only has 363 transitions (discarded 104 similar events)
[2024-06-01 14:32:00] [INFO ] Invariant cache hit.
[2024-06-01 14:32:00] [INFO ] State equation strengthened by 176 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-01 14:32:07] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD18 is UNSAT
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 TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 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 TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/55 variables, 2/72 constraints. Problems are: Problem set: 117 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/73 constraints. Problems are: Problem set: 117 solved, 340 unsolved
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 16/89 constraints. Problems are: Problem set: 121 solved, 336 unsolved
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 1/90 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/90 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 363/418 variables, 55/145 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 176/321 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/321 constraints. Problems are: Problem set: 121 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/418 variables, and 321 constraints, problems are : Problem set: 121 solved, 336 unsolved in 30039 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 121 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/69 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 12/81 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/81 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 1/55 variables, 2/83 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/84 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 6/90 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/90 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 363/418 variables, 55/145 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 176/321 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 336/657 constraints. Problems are: Problem set: 121 solved, 336 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/657 constraints. Problems are: Problem set: 121 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 657 constraints, problems are : Problem set: 121 solved, 336 unsolved in 30026 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 336/457 constraints, Known Traps: 18/18 constraints]
After SMT, in 63076ms problems are : Problem set: 121 solved, 336 unsolved
Search for dead transitions found 121 dead transitions in 63115ms
Found 121 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 121 transitions
Dead transitions reduction (with SMT) removed 121 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 55/55 places, 346/467 transitions.
Graph (complete) has 891 edges and 55 vertex of which 1 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.3 ms
Discarding 54 places :
Also discarding 346 output transitions
Drop transitions (Output transitions of discarded places.) removed 346 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 12 ms. Remains 1 /55 variables (removed 54) and now considering 0/346 (removed 346) transitions.
[2024-06-01 14:33:03] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 14:33:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 14:33:03] [INFO ] Invariant cache hit.
[2024-06-01 14:33:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/55 places, 0/467 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64063 ms. Remains : 1/55 places, 0/467 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 90851 ms.
ITS solved all properties within timeout

BK_STOP 1717252384077

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SimpleLoadBal-PT-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 r532-smll-171683810900165"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;