fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905978300518
Last Updated
May 14, 2023

About the Execution of LTSMin+red for SimpleLoadBal-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
949.392 3584219.00 14301955.00 86.30 TTTTTFTFFFTFTTTF normal

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-167905978300518.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978300518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-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 6.8K Jan 29 11:41 GenericPropertiesVerdict.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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679321783319

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=ReachabilityCardinality
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:16:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 14:16:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:16:25] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-20 14:16:25] [INFO ] Transformed 104 places.
[2023-03-20 14:16:25] [INFO ] Transformed 605 transitions.
[2023-03-20 14:16:25] [INFO ] Found NUPN structural information;
[2023-03-20 14:16:25] [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:16:25] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :10
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:16:25] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-20 14:16:25] [INFO ] Computed 29 place invariants in 39 ms
[2023-03-20 14:16:25] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:16:25] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-20 14:16:25] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-20 14:16:25] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:16:25] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:26] [INFO ] After 73ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:16:26] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 6 ms to minimize.
[2023-03-20 14:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-20 14:16:26] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 14:16:26] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 605/605 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 28 place count 86 transition count 595
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 44 place count 78 transition count 587
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 78 transition count 578
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 62 place count 69 transition count 578
Applied a total of 62 rules in 136 ms. Remains 69 /104 variables (removed 35) and now considering 578/605 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 69/104 places, 578/605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 841628 steps, run timeout after 3002 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 841628 steps, saw 440953 distinct states, run finished after 3023 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:16:29] [INFO ] Flow matrix only has 448 transitions (discarded 130 similar events)
// Phase 1: matrix 448 rows 69 cols
[2023-03-20 14:16:29] [INFO ] Computed 21 place invariants in 22 ms
[2023-03-20 14:16:29] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:16:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-20 14:16:29] [INFO ] [Nat]Absence check using 17 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-20 14:16:29] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:16:29] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:29] [INFO ] After 83ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:16:29] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 14:16:29] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 578/578 transitions.
Applied a total of 0 rules in 25 ms. Remains 69 /69 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 69/69 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 578/578 transitions.
Applied a total of 0 rules in 22 ms. Remains 69 /69 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2023-03-20 14:16:29] [INFO ] Flow matrix only has 448 transitions (discarded 130 similar events)
[2023-03-20 14:16:29] [INFO ] Invariant cache hit.
[2023-03-20 14:16:30] [INFO ] Implicit Places using invariants in 190 ms returned [18, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 194 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 578/578 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 65 transition count 576
Applied a total of 4 rules in 51 ms. Remains 65 /67 variables (removed 2) and now considering 576/578 (removed 2) transitions.
[2023-03-20 14:16:30] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
// Phase 1: matrix 446 rows 65 cols
[2023-03-20 14:16:30] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-20 14:16:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-20 14:16:30] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-20 14:16:30] [INFO ] Invariant cache hit.
[2023-03-20 14:16:30] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:30] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 65/69 places, 576/578 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 938 ms. Remains : 65/69 places, 576/578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1020937 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1020937 steps, saw 339337 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:16:34] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-20 14:16:34] [INFO ] Invariant cache hit.
[2023-03-20 14:16:34] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:16:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-20 14:16:34] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-20 14:16:34] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:16:34] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:34] [INFO ] After 41ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:16:34] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-20 14:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-20 14:16:34] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 14:16:34] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 576/576 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 65/65 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 576/576 transitions.
Applied a total of 0 rules in 30 ms. Remains 65 /65 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-20 14:16:34] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-20 14:16:34] [INFO ] Invariant cache hit.
[2023-03-20 14:16:34] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-20 14:16:34] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-20 14:16:34] [INFO ] Invariant cache hit.
[2023-03-20 14:16:34] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-20 14:16:35] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-20 14:16:35] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-20 14:16:35] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-20 14:16:35] [INFO ] Invariant cache hit.
[2023-03-20 14:16:35] [INFO ] Dead Transitions using invariants and state equation in 311 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 : 65/65 places, 384/576 transitions.
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 380
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 62 transition count 376
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 60 transition count 372
Reduce places removed 2 places and 24 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7 place count 58 transition count 348
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 7 rules in 18 ms. Remains 58 /65 variables (removed 7) and now considering 348/384 (removed 36) transitions.
[2023-03-20 14:16:35] [INFO ] Flow matrix only has 270 transitions (discarded 78 similar events)
// Phase 1: matrix 270 rows 58 cols
[2023-03-20 14:16:35] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-20 14:16:35] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-20 14:16:35] [INFO ] Flow matrix only has 270 transitions (discarded 78 similar events)
[2023-03-20 14:16:35] [INFO ] Invariant cache hit.
[2023-03-20 14:16:35] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-20 14:16:35] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/65 places, 348/576 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1465 ms. Remains : 58/65 places, 348/576 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 10818 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/529/inv_0_ --invariant=/tmp/529/inv_1_ --invariant=/tmp/529/inv_2_ --invariant=/tmp/529/inv_3_ --invariant=/tmp/529/inv_4_ --invariant=/tmp/529/inv_5_ --invariant=/tmp/529/inv_6_ --invariant=/tmp/529/inv_7_ --invariant=/tmp/529/inv_8_ --invariant=/tmp/529/inv_9_ --invariant=/tmp/529/inv_10_ --invariant=/tmp/529/inv_11_ --invariant=/tmp/529/inv_12_ --invariant=/tmp/529/inv_13_ --invariant=/tmp/529/inv_14_ --invariant=/tmp/529/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 15194244 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097060 kB
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-00
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-01
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-02
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-03
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-04
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-05
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-06
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-07
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-08
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-09
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-10
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-11
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-12
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-13
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-14
Could not compute solution for formula : SimpleLoadBal-PT-10-ReachabilityCardinality-15

BK_STOP 1679325367538

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/529/inv_0_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_1_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/529/inv_2_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_3_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_4_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_5_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_6_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_7_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_8_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_9_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_10_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/529/inv_11_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/529/inv_12_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/529/inv_13_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/529/inv_14_
rfs formula name SimpleLoadBal-PT-10-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/529/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 104 places, 605 transitions and 4148 arcs
pnml2lts-sym: Petri net SimpleLoadBal-PT-10 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 605->605 groups
pnml2lts-sym: Regrouping took 0.240 real 0.240 user 0.000 sys
pnml2lts-sym: state vector length is 104; there are 605 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 535
Killing (9) : 535

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167905978300518"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;