Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978300517.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r425-tajo-167905978300517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 8.8K Feb 26 03:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 03:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 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 1679321740947

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 14:15:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 14:15:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:15:42] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-20 14:15:42] [INFO ] Transformed 104 places.
[2023-03-20 14:15:42] [INFO ] Transformed 605 transitions.
[2023-03-20 14:15:42] [INFO ] Found NUPN structural information;
[2023-03-20 14:15:42] [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]
[2023-03-20 14:15:42] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA SimpleLoadBal-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 475 out of 605 initially.
// Phase 1: matrix 475 rows 104 cols
[2023-03-20 14:15:42] [INFO ] Computed 29 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :12
FORMULA SimpleLoadBal-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
[2023-03-20 14:15:42] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-20 14:15:42] [INFO ] Computed 29 place invariants in 14 ms
[2023-03-20 14:15:43] [INFO ] [Real]Absence check using 25 positive place invariants in 18 ms returned sat
[2023-03-20 14:15:43] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-20 14:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:43] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-20 14:15:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:15:43] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2023-03-20 14:15:43] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-20 14:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:43] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-20 14:15:43] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:15:43] [INFO ] [Nat]Added 210 Read/Feed constraints in 257 ms returned sat
[2023-03-20 14:15:44] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 8 ms to minimize.
[2023-03-20 14:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-20 14:15:44] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 102 ms.
[2023-03-20 14:15:44] [INFO ] Added : 11 causal constraints over 3 iterations in 211 ms. Result :sat
Minimization took 86 ms.
[2023-03-20 14:15:44] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-20 14:15:44] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 14:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:44] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-20 14:15:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:15:44] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-20 14:15:44] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 14:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:44] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-20 14:15:45] [INFO ] [Nat]Added 210 Read/Feed constraints in 444 ms returned sat
[2023-03-20 14:15:45] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2023-03-20 14:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-20 14:15:45] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 77 ms.
[2023-03-20 14:15:45] [INFO ] Added : 10 causal constraints over 2 iterations in 166 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 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 4 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 2 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 157 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 158 ms. Remains : 62/104 places, 573/605 transitions.
Normalized transition count is 443 out of 573 initially.
// Phase 1: matrix 443 rows 62 cols
[2023-03-20 14:15:46] [INFO ] Computed 19 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5526 ms. (steps per millisecond=180 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1178 ms. (steps per millisecond=848 ) properties (out of 2) seen :0
[2023-03-20 14:15:54] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
// Phase 1: matrix 443 rows 62 cols
[2023-03-20 14:15:54] [INFO ] Computed 19 place invariants in 16 ms
[2023-03-20 14:15:54] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-20 14:15:54] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 14:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:54] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-20 14:15:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:15:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-20 14:15:54] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-20 14:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:54] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-20 14:15:54] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:15:54] [INFO ] [Nat]Added 210 Read/Feed constraints in 61 ms returned sat
[2023-03-20 14:15:54] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-20 14:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-20 14:15:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 433 transitions) in 53 ms.
[2023-03-20 14:15:54] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Minimization took 167 ms.
[2023-03-20 14:15:55] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-20 14:15:55] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-20 14:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:55] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-20 14:15:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:15:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-20 14:15:55] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-20 14:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:15:55] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-20 14:15:55] [INFO ] [Nat]Added 210 Read/Feed constraints in 46 ms returned sat
[2023-03-20 14:15:55] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2023-03-20 14:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-20 14:15:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 433 transitions) in 48 ms.
[2023-03-20 14:15:55] [INFO ] Added : 0 causal constraints over 0 iterations in 87 ms. Result :sat
Minimization took 536 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 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 37 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 37 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 56 ms. Remains 62 /62 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-20 14:15:56] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2023-03-20 14:15:56] [INFO ] Invariant cache hit.
[2023-03-20 14:15:56] [INFO ] Implicit Places using invariants in 209 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 214 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 30 ms. Remains 58 /60 variables (removed 2) and now considering 571/573 (removed 2) transitions.
[2023-03-20 14:15:56] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
// Phase 1: matrix 441 rows 58 cols
[2023-03-20 14:15:56] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-20 14:15:56] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-20 14:15:56] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2023-03-20 14:15:56] [INFO ] Invariant cache hit.
[2023-03-20 14:15:56] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:15:57] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 701 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 1004 ms. Remains : 58/62 places, 571/573 transitions.
Normalized transition count is 441 out of 571 initially.
// Phase 1: matrix 441 rows 58 cols
[2023-03-20 14:15:57] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6278 ms. (steps per millisecond=159 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 2) seen :0
[2023-03-20 14:16:05] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
// Phase 1: matrix 441 rows 58 cols
[2023-03-20 14:16:05] [INFO ] Computed 17 place invariants in 9 ms
[2023-03-20 14:16:05] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 14:16:05] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 14:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:06] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-20 14:16:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:16:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 14:16:06] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 14:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:06] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-20 14:16:06] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:06] [INFO ] [Nat]Added 210 Read/Feed constraints in 90 ms returned sat
[2023-03-20 14:16:06] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-20 14:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-20 14:16:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 431 transitions) in 59 ms.
[2023-03-20 14:16:06] [INFO ] Added : 0 causal constraints over 0 iterations in 100 ms. Result :sat
Minimization took 194 ms.
[2023-03-20 14:16:06] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-20 14:16:06] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 14:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:06] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-20 14:16:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:16:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-20 14:16:06] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-20 14:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:07] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-20 14:16:07] [INFO ] [Nat]Added 210 Read/Feed constraints in 97 ms returned sat
[2023-03-20 14:16:07] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2023-03-20 14:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-20 14:16:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 431 transitions) in 48 ms.
[2023-03-20 14:16:07] [INFO ] Added : 0 causal constraints over 0 iterations in 82 ms. Result :sat
Minimization took 224 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 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 28 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 29 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 25 ms. Remains 58 /58 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-20 14:16:07] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2023-03-20 14:16:07] [INFO ] Invariant cache hit.
[2023-03-20 14:16:07] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-20 14:16:07] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2023-03-20 14:16:07] [INFO ] Invariant cache hit.
[2023-03-20 14:16:08] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:08] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2023-03-20 14:16:08] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-20 14:16:08] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2023-03-20 14:16:08] [INFO ] Invariant cache hit.
[2023-03-20 14:16:08] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 192 transitions.
Found 192 dead transitions using SMT.
Drop transitions removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 379/571 transitions.
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 375
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 371
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 53 transition count 367
Reduce places removed 1 places and 24 transitions.
Graph (complete) has 875 edges and 52 vertex of which 2 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.4 ms
Discarding 50 places :
Also discarding 343 output transitions
Drop transitions removed 343 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 7 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 7 rules in 23 ms. Remains 2 /58 variables (removed 56) and now considering 0/379 (removed 379) transitions.
[2023-03-20 14:16:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 14:16:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 14:16:08] [INFO ] Invariant cache hit.
[2023-03-20 14:16:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/58 places, 0/571 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1168 ms. Remains : 2/58 places, 0/571 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 26409 ms.
ITS solved all properties within timeout

BK_STOP 1679321769136

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-5348"
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 r425-tajo-167905978300517"
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 ;