About the Execution of LTSMin+red for SimpleLoadBal-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
476.023 | 10162.00 | 17853.00 | 104.60 | F | 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.r439-tajo-167905986300319.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-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-tajo-167905986300319
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.6K Feb 26 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 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 155K 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
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1679553106654
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=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:31:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-23 06:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:31:48] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-23 06:31:48] [INFO ] Transformed 59 places.
[2023-03-23 06:31:48] [INFO ] Transformed 180 transitions.
[2023-03-23 06:31:48] [INFO ] Found NUPN structural information;
[2023-03-23 06:31:48] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5]
[2023-03-23 06:31:48] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 116 ms.
Built sparse matrix representations for Structural reductions in 7 ms.30059KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 59/59 places, 180/180 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 29 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 29 ms. Remains : 59/59 places, 180/180 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 59/59 places, 180/180 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 13 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-23 06:31:48] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2023-03-23 06:31:48] [INFO ] Computed 19 place invariants in 15 ms
[2023-03-23 06:31:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-23 06:31:48] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2023-03-23 06:31:48] [INFO ] Invariant cache hit.
[2023-03-23 06:31:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-23 06:31:48] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-23 06:31:48] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-23 06:31:48] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2023-03-23 06:31:48] [INFO ] Invariant cache hit.
[2023-03-23 06:31:49] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 39 transitions.
Found 39 dead transitions using SMT.
Drop transitions removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 59/59 places, 141/180 transitions.
Computed a total of 3 stabilizing places and 11 stable transitions
Reduce places removed 0 places and 4 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Graph (complete) has 407 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 137
Reduce places removed 0 places and 8 transitions.
Computed a total of 1 stabilizing places and 0 stable transitions
Graph (complete) has 382 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 129
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 2 rules in 16 ms. Remains 56 /59 variables (removed 3) and now considering 129/141 (removed 12) transitions.
[2023-03-23 06:31:49] [INFO ] Flow matrix only has 104 transitions (discarded 25 similar events)
// Phase 1: matrix 104 rows 56 cols
[2023-03-23 06:31:49] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-23 06:31:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-23 06:31:49] [INFO ] Flow matrix only has 104 transitions (discarded 25 similar events)
[2023-03-23 06:31:49] [INFO ] Invariant cache hit.
[2023-03-23 06:31:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 06:31:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 56/59 places, 129/180 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 540 ms. Remains : 56/59 places, 129/180 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2230 ms (no deadlock found). (steps per millisecond=560 )
Random directed walk for 1250000 steps, including 0 resets, run took 2289 ms (no deadlock found). (steps per millisecond=546 )
[2023-03-23 06:31:53] [INFO ] Flow matrix only has 104 transitions (discarded 25 similar events)
[2023-03-23 06:31:53] [INFO ] Invariant cache hit.
[2023-03-23 06:31:53] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 06:31:53] [INFO ] [Real]Absence check using 17 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 06:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:31:53] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-23 06:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:31:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-23 06:31:53] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 06:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:31:53] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-23 06:31:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 06:31:53] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2023-03-23 06:31:54] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
[2023-03-23 06:31:54] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-23 06:31:54] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-23 06:31:54] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-23 06:31:54] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-23 06:31:54] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2023-03-23 06:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 265 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 59/59 places, 180/180 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 178
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 19 place count 47 transition count 173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 29 place count 42 transition count 168
Applied a total of 29 rules in 11 ms. Remains 42 /59 variables (removed 17) and now considering 168/180 (removed 12) transitions.
[2023-03-23 06:31:54] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 42 cols
[2023-03-23 06:31:54] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-23 06:31:54] [INFO ] Implicit Places using invariants in 75 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 40/59 places, 168/180 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 166
Applied a total of 4 rules in 3 ms. Remains 38 /40 variables (removed 2) and now considering 166/168 (removed 2) transitions.
[2023-03-23 06:31:54] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
// Phase 1: matrix 126 rows 38 cols
[2023-03-23 06:31:54] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-23 06:31:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-23 06:31:54] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2023-03-23 06:31:54] [INFO ] Invariant cache hit.
[2023-03-23 06:31:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-23 06:31:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 38/59 places, 166/180 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 325 ms. Remains : 38/59 places, 166/180 transitions.
Initial state reduction rules removed 5 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 161) seen :109
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Running SMT prover for 52 properties.
[2023-03-23 06:31:55] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2023-03-23 06:31:55] [INFO ] Invariant cache hit.
[2023-03-23 06:31:55] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-23 06:31:55] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 06:31:55] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :41 sat :0 real:11
[2023-03-23 06:31:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-23 06:31:55] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 06:31:56] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :41 sat :11
[2023-03-23 06:31:56] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-23 06:31:56] [INFO ] After 108ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :41 sat :11
[2023-03-23 06:31:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-23 06:31:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-23 06:31:56] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-23 06:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-23 06:31:56] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-23 06:31:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2023-03-23 06:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 86 ms
[2023-03-23 06:31:56] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :44 sat :8
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-23 06:31:56] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :44 sat :8
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 8192 ms.
ITS solved all properties within timeout
BK_STOP 1679553116816
--------------------
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 Liveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SimpleLoadBal-PT-05, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r439-tajo-167905986300319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;