MCC'2024- Execution of r532-smll-171683810900162

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
1895.479	87591.00	133525.00	262.00	?????F???T?F??FF	normal

Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717252190313

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:29:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:29:52] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-06-01 14:29:52] [INFO ] Transformed 104 places.
[2024-06-01 14:29:52] [INFO ] Transformed 605 transitions.
[2024-06-01 14:29:52] [INFO ] Found NUPN structural information;
[2024-06-01 14:29:52] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2024-06-01 14:29:52] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 101 ms.
Support contains 68 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 605/605 transitions.
Applied a total of 0 rules in 29 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-06-01 14:29:52] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-06-01 14:29:52] [INFO ] Computed 29 invariants in 36 ms
[2024-06-01 14:29:53] [INFO ] Implicit Places using invariants in 348 ms returned [10, 11, 12, 13, 14, 17, 18, 19, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 402 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 605/605 transitions.
Applied a total of 0 rules in 8 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 467 ms. Remains : 94/104 places, 605/605 transitions.
Support contains 68 out of 94 places after structural reductions.
[2024-06-01 14:29:53] [INFO ] Flatten gal took : 150 ms
[2024-06-01 14:29:53] [INFO ] Flatten gal took : 98 ms
[2024-06-01 14:29:53] [INFO ] Input system was already deterministic with 605 transitions.
Reduction of identical properties reduced properties to check from 87 to 85
RANDOM walk for 40000 steps (8 resets) in 3181 ms. (12 steps per ms) remains 39/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
[2024-06-01 14:29:55] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 94 cols
[2024-06-01 14:29:55] [INFO ] Computed 19 invariants in 10 ms
[2024-06-01 14:29:55] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 39/88 variables, 13/62 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 39/101 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/102 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/102 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 2/90 variables, 2/104 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/106 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/106 constraints. Problems are: Problem set: 11 solved, 25 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 9 (OVERLAPS) 4/94 variables, 3/109 constraints. Problems are: Problem set: 32 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 4/113 constraints. Problems are: Problem set: 32 solved, 4 unsolved
[2024-06-01 14:29:57] [INFO ] Deduced a trap composed of 55 places in 329 ms of which 31 ms to minimize.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 1/114 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/114 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 475/569 variables, 94/208 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/569 variables, 210/418 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 0/418 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/569 variables, 0/418 constraints. Problems are: Problem set: 34 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 418 constraints, problems are : Problem set: 34 solved, 2 unsolved in 1748 ms.
Refiners :[Domain max(s): 94/94 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 34 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 27/32 variables, 4/9 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 27/36 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/77 variables, 9/45 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 45/90 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/90 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/79 variables, 2/92 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/94 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/94 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/94 variables, 4/98 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 15/113 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 1/114 constraints. Problems are: Problem set: 34 solved, 2 unsolved
[2024-06-01 14:29:58] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:29:58] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 2/116 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/94 variables, 0/116 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 475/569 variables, 94/210 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 210/420 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 2/422 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/569 variables, 0/422 constraints. Problems are: Problem set: 34 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/569 variables, 0/422 constraints. Problems are: Problem set: 34 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 422 constraints, problems are : Problem set: 34 solved, 2 unsolved in 1934 ms.
Refiners :[Domain max(s): 94/94 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/36 constraints, Known Traps: 3/3 constraints]
After SMT, in 4360ms problems are : Problem set: 34 solved, 2 unsolved
Parikh walk visited 0 properties in 1506 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 94 transition count 597
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 86 transition count 597
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 36 place count 76 transition count 587
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 72 transition count 585
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 46 place count 70 transition count 583
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 70 transition count 573
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 66 place count 60 transition count 573
Applied a total of 66 rules in 176 ms. Remains 60 /94 variables (removed 34) and now considering 573/605 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 60/94 places, 573/605 transitions.
RANDOM walk for 40000 steps (8 resets) in 652 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 280748 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 280748 steps, saw 140945 distinct states, run finished after 3006 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 14:30:05] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
// Phase 1: matrix 443 rows 60 cols
[2024-06-01 14:30:05] [INFO ] Computed 17 invariants in 7 ms
[2024-06-01 14:30:05] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/50 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 443/503 variables, 60/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 210/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 703 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/50 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:30:06] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:30:06] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 443/503 variables, 60/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 210/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/503 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1353 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2110ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 857 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 573/573 transitions.
Applied a total of 0 rules in 33 ms. Remains 60 /60 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 60/60 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 573/573 transitions.
Applied a total of 0 rules in 36 ms. Remains 60 /60 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-06-01 14:30:08] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-06-01 14:30:08] [INFO ] Invariant cache hit.
[2024-06-01 14:30:08] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 14:30:08] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-06-01 14:30:08] [INFO ] Invariant cache hit.
[2024-06-01 14:30:08] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 14:30:09] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2024-06-01 14:30:09] [INFO ] Redundant transitions in 58 ms returned []
Running 563 sub problems to find dead transitions.
[2024-06-01 14:30:09] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-06-01 14:30:09] [INFO ] Invariant cache hit.
[2024-06-01 14:30:09] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/77 constraints. Problems are: Problem set: 192 solved, 371 unsolved
[2024-06-01 14:30:16] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:30:17] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
[2024-06-01 14:30:17] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:30:19] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:30:19] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 1 ms to minimize.
[2024-06-01 14:30:19] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:30:19] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 12/89 constraints. Problems are: Problem set: 220 solved, 343 unsolved
[2024-06-01 14:30:23] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:30:23] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/91 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/91 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 6 (OVERLAPS) 443/503 variables, 60/151 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 210/361 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/361 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 0/503 variables, 0/361 constraints. Problems are: Problem set: 221 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 361 constraints, problems are : Problem set: 221 solved, 342 unsolved in 30041 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 221 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 13/73 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/77 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 14/91 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/91 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 443/503 variables, 60/151 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 210/361 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 342/703 constraints. Problems are: Problem set: 221 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/703 constraints. Problems are: Problem set: 221 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 703 constraints, problems are : Problem set: 221 solved, 342 unsolved in 30023 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 342/563 constraints, Known Traps: 14/14 constraints]
After SMT, in 64534ms problems are : Problem set: 221 solved, 342 unsolved
Search for dead transitions found 221 dead transitions in 64554ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/60 places, 352/573 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 350
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 348
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 55 transition count 346
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 54 transition count 344
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 28 ms. Remains 54 /60 variables (removed 6) and now considering 344/352 (removed 8) transitions.
[2024-06-01 14:31:14] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
// Phase 1: matrix 267 rows 54 cols
[2024-06-01 14:31:14] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 14:31:14] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 14:31:14] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
[2024-06-01 14:31:14] [INFO ] Invariant cache hit.
[2024-06-01 14:31:14] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 14:31:14] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 54/60 places, 344/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66612 ms. Remains : 54/60 places, 344/573 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 36 atomic propositions for a total of 16 simplifications.
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:31:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 14:31:14] [INFO ] Flatten gal took : 62 ms
FORMULA SimpleLoadBal-PT-10-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:31:14] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:31:14] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 51 out of 94 places (down from 55) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 45 ms
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 47 ms
[2024-06-01 14:31:15] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 94 transition count 596
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 85 transition count 596
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 76 transition count 587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 39 place count 74 transition count 586
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 73 transition count 585
Applied a total of 41 rules in 72 ms. Remains 73 /94 variables (removed 21) and now considering 585/605 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 73/94 places, 585/605 transitions.
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 45 ms
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 49 ms
[2024-06-01 14:31:15] [INFO ] Input system was already deterministic with 585 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 94 transition count 597
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 86 transition count 597
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 34 place count 77 transition count 588
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 73 transition count 586
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 44 place count 71 transition count 584
Applied a total of 44 rules in 54 ms. Remains 71 /94 variables (removed 23) and now considering 584/605 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 71/94 places, 584/605 transitions.
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:31:15] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:31:15] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:31:15] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 94 transition count 596
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 85 transition count 596
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 75 transition count 586
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 73 transition count 585
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 72 transition count 584
Applied a total of 43 rules in 45 ms. Remains 72 /94 variables (removed 22) and now considering 584/605 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 72/94 places, 584/605 transitions.
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:31:16] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:31:16] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:31:16] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:31:16] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:31:16] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:31:16] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:31:17] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/94 places, 605/605 transitions.
[2024-06-01 14:31:17] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:31:17] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:31:17] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 605/605 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 94 transition count 595
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 20 place count 84 transition count 595
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 74 transition count 585
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 70 transition count 583
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 50 place count 68 transition count 581
Applied a total of 50 rules in 42 ms. Remains 68 /94 variables (removed 26) and now considering 581/605 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 68/94 places, 581/605 transitions.
[2024-06-01 14:31:17] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:31:17] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:31:17] [INFO ] Input system was already deterministic with 581 transitions.
RANDOM walk for 1135 steps (0 resets) in 13 ms. (81 steps per ms) remains 0/1 properties
FORMULA SimpleLoadBal-PT-10-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-01 14:31:17] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:31:17] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:31:17] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 14:31:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 605 transitions and 4128 arcs took 7 ms.
Total runtime 85485 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-00
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-01
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-02
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-03
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-04
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-06
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-07
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-08
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2024-10
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2023-12
Could not compute solution for formula : SimpleLoadBal-PT-10-CTLFireability-2023-13

BK_STOP 1717252277904

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/615/ctl_0_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/615/ctl_1_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/615/ctl_2_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/615/ctl_3_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/615/ctl_4_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/615/ctl_5_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/615/ctl_6_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/615/ctl_7_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/615/ctl_8_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/615/ctl_9_
ctl formula name SimpleLoadBal-PT-10-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/615/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SimpleLoadBal-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810900162"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;