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.r377-smll-171683809800161.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 greatspnxred
Input is SimpleLoadBal-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809800161
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-01
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-02
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-03
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-04
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-05
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-06
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-07
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-08
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-09
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-10
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2024-11
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2023-12
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2023-13
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2023-14
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716936878530

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 22:54:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 22:54:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:54:40] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-28 22:54:40] [INFO ] Transformed 104 places.
[2024-05-28 22:54:40] [INFO ] Transformed 605 transitions.
[2024-05-28 22:54:40] [INFO ] Found NUPN structural information;
[2024-05-28 22:54:40] [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-05-28 22:54:40] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 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 33 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-28 22:54:40] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-05-28 22:54:40] [INFO ] Computed 29 invariants in 36 ms
[2024-05-28 22:54:41] [INFO ] Implicit Places using invariants in 453 ms returned [10, 12, 13, 15, 17, 18, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 513 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/104 places, 605/605 transitions.
Applied a total of 0 rules in 10 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 97/104 places, 605/605 transitions.
Support contains 67 out of 97 places after structural reductions.
[2024-05-28 22:54:41] [INFO ] Flatten gal took : 141 ms
[2024-05-28 22:54:41] [INFO ] Flatten gal took : 76 ms
[2024-05-28 22:54:42] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 61 out of 97 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 54 to 53
RANDOM walk for 40000 steps (8 resets) in 2604 ms. (15 steps per ms) remains 6/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
[2024-05-28 22:54:43] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 97 cols
[2024-05-28 22:54:43] [INFO ] Computed 22 invariants in 14 ms
[2024-05-28 22:54:43] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 16/25 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/37 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 35/72 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/73 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 14 (OVERLAPS) 18/91 variables, 4/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/91 variables, 18/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/91 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/97 variables, 4/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 6/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/97 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 475/572 variables, 97/216 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/572 variables, 210/426 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-28 22:54:44] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 20 ms to minimize.
[2024-05-28 22:54:44] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 4 ms to minimize.
[2024-05-28 22:54:44] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/572 variables, 3/429 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/572 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/572 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 429 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1777 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 97/97 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 12/31 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 12/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 40/71 variables, 8/43 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 40/83 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/73 variables, 2/85 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 2/87 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 18/91 variables, 4/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/91 variables, 18/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/91 variables, 3/112 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-28 22:54:45] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2024-05-28 22:54:45] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 2 ms to minimize.
[2024-05-28 22:54:46] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2024-05-28 22:54:46] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2024-05-28 22:54:46] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-05-28 22:54:46] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-28 22:54:46] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2024-05-28 22:54:46] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/91 variables, 8/120 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-28 22:54:47] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/91 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/91 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 6/97 variables, 4/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/97 variables, 6/131 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/97 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 475/572 variables, 97/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/572 variables, 210/438 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/572 variables, 5/443 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-28 22:54:47] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/572 variables, 1/444 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/572 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/572 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 444 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3136 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 97/97 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 5055ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 3983 ms.
Support contains 7 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 605/605 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 97 transition count 598
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 90 transition count 598
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 32 place count 81 transition count 589
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 75 transition count 586
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 72 transition count 583
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 57 place count 72 transition count 573
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 67 place count 62 transition count 573
Applied a total of 67 rules in 181 ms. Remains 62 /97 variables (removed 35) and now considering 573/605 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 62/97 places, 573/605 transitions.
RANDOM walk for 40000 steps (8 resets) in 795 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 237753 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 5
Probabilistic random walk after 237753 steps, saw 121589 distinct states, run finished after 3008 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-28 22:54:56] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
// Phase 1: matrix 443 rows 62 cols
[2024-05-28 22:54:56] [INFO ] Computed 19 invariants in 8 ms
[2024-05-28 22:54:56] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 9/16 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 32/48 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 32/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/60 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 442/502 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 210/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 3/505 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:54:57] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/505 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 354 constraints, problems are : Problem set: 0 solved, 5 unsolved in 856 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 9/16 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 32/48 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 32/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/60 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:54:57] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-28 22:54:57] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-28 22:54:57] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 442/502 variables, 60/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 210/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/505 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/505 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 362 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1875 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 2788ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4626 ms.
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 573/573 transitions.
Applied a total of 0 rules in 42 ms. Remains 62 /62 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 62/62 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 573/573 transitions.
Applied a total of 0 rules in 35 ms. Remains 62 /62 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-28 22:55:03] [INFO ] Flow matrix only has 443 transitions (discarded 130 similar events)
[2024-05-28 22:55:03] [INFO ] Invariant cache hit.
[2024-05-28 22:55:04] [INFO ] Implicit Places using invariants in 223 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 226 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 573/573 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 571
Applied a total of 4 rules in 51 ms. Remains 58 /60 variables (removed 2) and now considering 571/573 (removed 2) transitions.
[2024-05-28 22:55:04] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
// Phase 1: matrix 441 rows 58 cols
[2024-05-28 22:55:04] [INFO ] Computed 17 invariants in 6 ms
[2024-05-28 22:55:04] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-28 22:55:04] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2024-05-28 22:55:04] [INFO ] Invariant cache hit.
[2024-05-28 22:55:04] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-28 22:55:04] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 571/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1124 ms. Remains : 58/62 places, 571/573 transitions.
RANDOM walk for 40000 steps (8 resets) in 595 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 370478 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 5
Probabilistic random walk after 370478 steps, saw 118008 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-28 22:55:08] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2024-05-28 22:55:08] [INFO ] Invariant cache hit.
[2024-05-28 22:55:08] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 36/45 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 11/56 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 440/496 variables, 56/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 210/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 3/499 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:55:09] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2024-05-28 22:55:09] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-28 22:55:09] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/499 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 346 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1070 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 36/45 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 11/56 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:55:09] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-28 22:55:09] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-28 22:55:10] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:55:10] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-28 22:55:10] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-05-28 22:55:10] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2024-05-28 22:55:10] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 440/496 variables, 56/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 210/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 3/499 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/499 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/499 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/499 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/499 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 358 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2063 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 3193ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1393 ms.
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 571/571 transitions.
Applied a total of 0 rules in 24 ms. Remains 58 /58 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 58/58 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 571/571 transitions.
Applied a total of 0 rules in 23 ms. Remains 58 /58 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2024-05-28 22:55:13] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2024-05-28 22:55:13] [INFO ] Invariant cache hit.
[2024-05-28 22:55:13] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-28 22:55:13] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2024-05-28 22:55:13] [INFO ] Invariant cache hit.
[2024-05-28 22:55:13] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-28 22:55:13] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-28 22:55:13] [INFO ] Redundant transitions in 37 ms returned []
Running 561 sub problems to find dead transitions.
[2024-05-28 22:55:13] [INFO ] Flow matrix only has 441 transitions (discarded 130 similar events)
[2024-05-28 22:55:13] [INFO ] Invariant cache hit.
[2024-05-28 22:55:13] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 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 TDEAD181 is UNSAT
Problem TDEAD182 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 TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/75 constraints. Problems are: Problem set: 192 solved, 369 unsolved
[2024-05-28 22:55:20] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 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
[2024-05-28 22:55:21] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2024-05-28 22:55:21] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-28 22:55:21] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-28 22:55:21] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 2 ms to minimize.
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 6 ms to minimize.
Problem TDEAD538 is UNSAT
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-28 22:55:22] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-28 22:55:23] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 13/88 constraints. Problems are: Problem set: 221 solved, 340 unsolved
[2024-05-28 22:55:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/89 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/89 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 441/499 variables, 58/147 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 210/357 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/357 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/357 constraints. Problems are: Problem set: 221 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 357 constraints, problems are : Problem set: 221 solved, 340 unsolved in 23656 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 221 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 13/71 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/75 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 14/89 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/89 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 441/499 variables, 58/147 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 210/357 constraints. Problems are: Problem set: 221 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 340/697 constraints. Problems are: Problem set: 221 solved, 340 unsolved
[2024-05-28 22:55:56] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/698 constraints. Problems are: Problem set: 221 solved, 340 unsolved
[2024-05-28 22:56:06] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 699 constraints, problems are : Problem set: 221 solved, 340 unsolved in 30039 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 340/561 constraints, Known Traps: 16/16 constraints]
After SMT, in 57611ms problems are : Problem set: 221 solved, 340 unsolved
Search for dead transitions found 221 dead transitions in 57625ms
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 : 58/58 places, 350/571 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 348
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 346
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 55 transition count 344
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 3 rules in 15 ms. Remains 55 /58 variables (removed 3) and now considering 342/350 (removed 8) transitions.
[2024-05-28 22:56:11] [INFO ] Flow matrix only has 265 transitions (discarded 77 similar events)
// Phase 1: matrix 265 rows 55 cols
[2024-05-28 22:56:11] [INFO ] Computed 22 invariants in 4 ms
[2024-05-28 22:56:11] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-28 22:56:11] [INFO ] Flow matrix only has 265 transitions (discarded 77 similar events)
[2024-05-28 22:56:11] [INFO ] Invariant cache hit.
[2024-05-28 22:56:11] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 22:56:12] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/58 places, 342/571 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59070 ms. Remains : 55/58 places, 342/571 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 70 ms
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 53 ms
[2024-05-28 22:56:12] [INFO ] Input system was already deterministic with 605 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 86 ms
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 38 ms
[2024-05-28 22:56:12] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 18 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 32 ms
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 34 ms
[2024-05-28 22:56:12] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:56:12] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 97 transition count 598
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 90 transition count 598
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 32 place count 81 transition count 589
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 75 transition count 586
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 72 transition count 583
Applied a total of 47 rules in 52 ms. Remains 72 /97 variables (removed 25) and now considering 583/605 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 72/97 places, 583/605 transitions.
[2024-05-28 22:56:12] [INFO ] Flatten gal took : 31 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 32 ms
[2024-05-28 22:56:13] [INFO ] Input system was already deterministic with 583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:56:13] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:56:13] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 26 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 26 ms
[2024-05-28 22:56:13] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:56:13] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:56:13] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 97 transition count 600
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 92 transition count 600
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 26 place count 84 transition count 592
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 78 transition count 589
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 75 transition count 586
Applied a total of 41 rules in 48 ms. Remains 75 /97 variables (removed 22) and now considering 586/605 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 75/97 places, 586/605 transitions.
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 31 ms
[2024-05-28 22:56:13] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:56:14] [INFO ] Input system was already deterministic with 586 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:14] [INFO ] Flatten gal took : 23 ms
[2024-05-28 22:56:14] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:56:14] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 605/605 transitions.
[2024-05-28 22:56:14] [INFO ] Flatten gal took : 22 ms
[2024-05-28 22:56:14] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:56:14] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-28 22:56:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 22:56:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 22:56:14] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-28 22:56:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 605 transitions and 4134 arcs took 7 ms.
Total runtime 94086 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SimpleLoadBal-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 97
TRANSITIONS: 605
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 733
MODEL NAME: /home/mcc/execution/412/model
97 places, 605 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SimpleLoadBal-PT-10-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716937024749

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SimpleLoadBal-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809800161"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;