fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r212-tall-174901994500521
Last Updated
June 24, 2025

About the Execution of ITS-Tools for SimpleLoadBal-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 848028.00 0.00 0.00 TFFTTTTFFTFTTTFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994500521.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SimpleLoadBal-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994500521
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749203934754

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 09:58:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 09:58:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:58:56] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-06 09:58:56] [INFO ] Transformed 149 places.
[2025-06-06 09:58:56] [INFO ] Transformed 1280 transitions.
[2025-06-06 09:58:56] [INFO ] Found NUPN structural information;
[2025-06-06 09:58:56] [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_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, 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_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, 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_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, 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_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, 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_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_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_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, 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_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, 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, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2025-06-06 09:58:56] [INFO ] Parsed PT model containing 149 places and 1280 transitions and 8988 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 78 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1280/1280 transitions.
Applied a total of 0 rules in 29 ms. Remains 149 /149 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 09:58:56] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2025-06-06 09:58:56] [INFO ] Computed 39 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:58:57] [INFO ] Implicit Places using invariants in 883 ms returned [15, 16, 17, 18, 21, 22, 23, 25, 26, 27, 29, 63]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 922 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/149 places, 1280/1280 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 986 ms. Remains : 137/149 places, 1280/1280 transitions.
Support contains 78 out of 137 places after structural reductions.
[2025-06-06 09:58:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-06 09:58:57] [INFO ] Flatten gal took : 148 ms
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 09:58:57] [INFO ] Flatten gal took : 127 ms
[2025-06-06 09:58:57] [INFO ] Input system was already deterministic with 1280 transitions.
Support contains 69 out of 137 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1678 ms. (23 steps per ms) remains 6/49 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 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 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
[2025-06-06 09:58:58] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 137 cols
[2025-06-06 09:58:58] [INFO ] Computed 27 invariants in 19 ms
[2025-06-06 09:58:58] [INFO ] State equation strengthened by 465 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp37 is UNSAT
At refinement iteration 2 (OVERLAPS) 53/64 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 53/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 48/112 variables, 11/83 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 48/131 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/114 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 2/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/134 variables, 4/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 20/159 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:58:59] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 17 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/137 variables, 2/162 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 3/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1010/1147 variables, 137/302 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1147 variables, 465/767 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1147 variables, 0/767 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:00] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 13 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/1147 variables, 1/768 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1147 variables, 0/768 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1147 variables, 0/768 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1147/1147 variables, and 768 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2615 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/137 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 19/25 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 19/27 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 16/41 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 16/44 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 65/106 variables, 13/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 65/122 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/109 variables, 3/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 3/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 22/131 variables, 4/132 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/131 variables, 22/154 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/131 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:01] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 15 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/131 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 6/137 variables, 4/161 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/137 variables, 6/167 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:02] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 15 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/137 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/137 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1010/1147 variables, 137/305 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1147 variables, 465/770 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 25 (INCLUDED_ONLY) 0/1147 variables, 5/775 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1147 variables, 0/775 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1147 variables, 0/775 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 775 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3309 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/137 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6030ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 8177 ms.
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 137 transition count 1268
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 125 transition count 1268
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 50 place count 112 transition count 1255
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 104 transition count 1251
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 100 transition count 1247
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 100 transition count 1232
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 85 transition count 1232
Applied a total of 100 rules in 279 ms. Remains 85 /137 variables (removed 52) and now considering 1232/1280 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 85/137 places, 1232/1280 transitions.
RANDOM walk for 40000 steps (8 resets) in 769 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 239349 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 239349 steps, saw 117926 distinct states, run finished after 3005 ms. (steps per millisecond=79 ) properties seen :0
[2025-06-06 09:59:16] [INFO ] Flow matrix only has 962 transitions (discarded 270 similar events)
// Phase 1: matrix 962 rows 85 cols
[2025-06-06 09:59:16] [INFO ] Computed 23 invariants in 19 ms
[2025-06-06 09:59:16] [INFO ] State equation strengthened by 465 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/22 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 45/67 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 45/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/83 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 961/1044 variables, 83/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1044 variables, 465/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1047 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1047 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1047 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:17] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 11 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1047 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:17] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:18] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 11 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1047 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1047 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 661 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1669 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/22 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 45/67 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 45/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/83 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 961/1044 variables, 83/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1044 variables, 465/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1047 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1047 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1047 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1047 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1047 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1047 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 665 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3484 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5213ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1223 ms.
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1232/1232 transitions.
Applied a total of 0 rules in 85 ms. Remains 85 /85 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 85/85 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1232/1232 transitions.
Applied a total of 0 rules in 81 ms. Remains 85 /85 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-06 09:59:23] [INFO ] Flow matrix only has 962 transitions (discarded 270 similar events)
[2025-06-06 09:59:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:59:23] [INFO ] Implicit Places using invariants in 667 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 672 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/85 places, 1232/1232 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 1231
Applied a total of 2 rules in 114 ms. Remains 83 /84 variables (removed 1) and now considering 1231/1232 (removed 1) transitions.
[2025-06-06 09:59:23] [INFO ] Flow matrix only has 961 transitions (discarded 270 similar events)
// Phase 1: matrix 961 rows 83 cols
[2025-06-06 09:59:23] [INFO ] Computed 22 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:59:24] [INFO ] Implicit Places using invariants in 679 ms returned []
[2025-06-06 09:59:24] [INFO ] Flow matrix only has 961 transitions (discarded 270 similar events)
[2025-06-06 09:59:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:59:24] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 09:59:26] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/85 places, 1231/1232 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3112 ms. Remains : 83/85 places, 1231/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 565 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 294635 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 294635 steps, saw 204534 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-06-06 09:59:29] [INFO ] Flow matrix only has 961 transitions (discarded 270 similar events)
[2025-06-06 09:59:29] [INFO ] Invariant cache hit.
[2025-06-06 09:59:29] [INFO ] State equation strengthened by 465 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 58/65 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/81 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 960/1041 variables, 81/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1041 variables, 465/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1041 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1044 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1044 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:30] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 11 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1044 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1044/1044 variables, and 654 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1108 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 58/65 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/81 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 960/1041 variables, 81/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1041 variables, 465/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1041 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1044 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1044 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 4/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:31] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1044 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1044 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1044 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 659 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2519 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3660ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3652 ms.
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1231/1231 transitions.
Applied a total of 0 rules in 74 ms. Remains 83 /83 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 83/83 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1231/1231 transitions.
Applied a total of 0 rules in 70 ms. Remains 83 /83 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2025-06-06 09:59:36] [INFO ] Flow matrix only has 961 transitions (discarded 270 similar events)
[2025-06-06 09:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:59:37] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-06-06 09:59:37] [INFO ] Flow matrix only has 961 transitions (discarded 270 similar events)
[2025-06-06 09:59:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:59:37] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 09:59:39] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:59:39] [INFO ] Redundant transitions in 69 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-06 09:59:39] [INFO ] Flow matrix only has 961 transitions (discarded 270 similar events)
[2025-06-06 09:59:39] [INFO ] Invariant cache hit.
[2025-06-06 09:59:39] [INFO ] State equation strengthened by 465 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
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 TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 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
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 TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 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 TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 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 TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 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 TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 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 TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 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 TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 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 TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 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 TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 4/105 constraints. Problems are: Problem set: 499 solved, 717 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:45] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 10 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:46] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:47] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:47] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:47] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:48] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:49] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:49] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:49] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:49] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:49] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:49] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 9 ms to minimize.
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:52] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 6 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/125 constraints. Problems are: Problem set: 513 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:57] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:57] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:59:57] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 7 ms to minimize.
Problem TDEAD511 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 10:00:00] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 10:00:00] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 10:00:00] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 6/131 constraints. Problems are: Problem set: 514 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 10:00:03] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/132 constraints. Problems are: Problem set: 514 solved, 702 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 83/1044 variables, and 132 constraints, problems are : Problem set: 514 solved, 702 unsolved in 30031 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/83 constraints, ReadFeed: 0/465 constraints, PredecessorRefiner: 717/30 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 514 solved, 702 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 18/101 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 4/105 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 27/132 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/132 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 5 (OVERLAPS) 961/1044 variables, 83/215 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1044 variables, 465/680 constraints. Problems are: Problem set: 514 solved, 702 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 30/710 constraints. Problems are: Problem set: 514 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 710 constraints, problems are : Problem set: 514 solved, 702 unsolved in 30029 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 702/30 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62602ms problems are : Problem set: 514 solved, 702 unsolved
Search for dead transitions found 514 dead transitions in 62611ms
Found 514 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 514 transitions
Dead transitions reduction (with SMT) removed 514 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 717/1231 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 715
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 80 transition count 713
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 6 places and 22 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 74 transition count 689
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 9 rules in 38 ms. Remains 74 /83 variables (removed 9) and now considering 689/717 (removed 28) transitions.
[2025-06-06 10:00:41] [INFO ] Flow matrix only has 545 transitions (discarded 144 similar events)
// Phase 1: matrix 545 rows 74 cols
[2025-06-06 10:00:41] [INFO ] Computed 26 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:00:42] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-06-06 10:00:42] [INFO ] Flow matrix only has 545 transitions (discarded 144 similar events)
[2025-06-06 10:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:00:42] [INFO ] State equation strengthened by 257 read => feed constraints.
[2025-06-06 10:00:42] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/83 places, 689/1231 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65925 ms. Remains : 74/83 places, 689/1231 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2025-06-06 10:00:42] [INFO ] Flatten gal took : 57 ms
[2025-06-06 10:00:42] [INFO ] Flatten gal took : 57 ms
[2025-06-06 10:00:43] [INFO ] Input system was already deterministic with 1280 transitions.
Support contains 58 out of 137 places (down from 60) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:00:43] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 137 cols
[2025-06-06 10:00:43] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:00:43] [INFO ] Implicit Places using invariants in 771 ms returned [15, 16, 17, 18, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 774 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 788 ms. Remains : 132/137 places, 1280/1280 transitions.
[2025-06-06 10:00:43] [INFO ] Flatten gal took : 49 ms
[2025-06-06 10:00:43] [INFO ] Flatten gal took : 52 ms
[2025-06-06 10:00:44] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:00:44] [INFO ] Flatten gal took : 51 ms
[2025-06-06 10:00:44] [INFO ] Flatten gal took : 48 ms
[2025-06-06 10:00:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13917809380583034.gal : 30 ms
[2025-06-06 10:00:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality11030026253457840376.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13917809380583034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11030026253457840376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:01:14] [INFO ] Flatten gal took : 48 ms
[2025-06-06 10:01:14] [INFO ] Applying decomposition
[2025-06-06 10:01:14] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3160641795410789919.txt' '-o' '/tmp/graph3160641795410789919.bin' '-w' '/tmp/graph3160641795410789919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3160641795410789919.bin' '-l' '-1' '-v' '-w' '/tmp/graph3160641795410789919.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:01:14] [INFO ] Decomposing Gal with order
[2025-06-06 10:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:01:14] [INFO ] Removed a total of 3815 redundant transitions.
[2025-06-06 10:01:14] [INFO ] Flatten gal took : 208 ms
[2025-06-06 10:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 38 ms.
[2025-06-06 10:01:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality2611880219547211592.gal : 9 ms
[2025-06-06 10:01:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8515015498538394590.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2611880219547211592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8515015498538394590.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.42083,55616,1842,97,113555,357,1219,118680,106,1332,0


Converting to forward existential form...Done !
original formula: EX((EX(AG(EF((i15.u8.P_client_idle_11==0)))) * (AG((((((i6.u18.P_server_notification_ack_1==0)&&(i19.u37.P_lb_load_2_15==0))&&(i1.u27.P_s...310
=> equivalent forward existential formula: ([((EY(Init) * EX(!(E(TRUE U !(E(TRUE U (i15.u8.P_client_idle_11==0))))))) * !(E(TRUE U !((((((i6.u18.P_server_n...472
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...473
(forward)formula 0,1,4.50009,148800,1,0,332470,1404,5974,347604,402,4145,712794
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:01:19] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-06 10:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:01:20] [INFO ] Implicit Places using invariants in 905 ms returned [15, 16, 17, 18, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 908 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 927 ms. Remains : 132/137 places, 1280/1280 transitions.
[2025-06-06 10:01:20] [INFO ] Flatten gal took : 48 ms
[2025-06-06 10:01:20] [INFO ] Flatten gal took : 42 ms
[2025-06-06 10:01:20] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:01:20] [INFO ] Flatten gal took : 40 ms
[2025-06-06 10:01:20] [INFO ] Flatten gal took : 39 ms
[2025-06-06 10:01:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16670698945882712013.gal : 8 ms
[2025-06-06 10:01:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality15720847734273378510.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16670698945882712013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15720847734273378510.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:01:50] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:01:50] [INFO ] Applying decomposition
[2025-06-06 10:01:50] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10823355826900380361.txt' '-o' '/tmp/graph10823355826900380361.bin' '-w' '/tmp/graph10823355826900380361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10823355826900380361.bin' '-l' '-1' '-v' '-w' '/tmp/graph10823355826900380361.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:01:51] [INFO ] Decomposing Gal with order
[2025-06-06 10:01:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:01:51] [INFO ] Removed a total of 3711 redundant transitions.
[2025-06-06 10:01:51] [INFO ] Flatten gal took : 89 ms
[2025-06-06 10:01:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 26 ms.
[2025-06-06 10:01:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3536984260331687626.gal : 4 ms
[2025-06-06 10:01:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5495755503468455637.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3536984260331687626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5495755503468455637.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.13298,42212,1787,97,80092,383,967,79258,90,1739,0


Converting to forward existential form...Done !
original formula: EF(EX(EF((i17.u35.P_lb_load_1_3==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (i17.u35.P_lb_load_1_3==1))] != FALSE
(forward)formula 0,1,1.26521,42340,1,0,80092,383,1963,79258,144,1739,64741
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 137 transition count 1268
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 125 transition count 1268
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 113 transition count 1256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 105 transition count 1252
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 101 transition count 1248
Applied a total of 68 rules in 147 ms. Remains 101 /137 variables (removed 36) and now considering 1248/1280 (removed 32) transitions.
[2025-06-06 10:01:52] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:01:52] [INFO ] Invariants computation overflowed in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:01:52] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-06 10:01:52] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:01:52] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:01:53] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:01:55] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 10:01:55] [INFO ] Redundant transitions in 53 ms returned []
Running 1233 sub problems to find dead transitions.
[2025-06-06 10:01:55] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:01:55] [INFO ] Invariants computation overflowed in 11 ms
[2025-06-06 10:01:55] [INFO ] State equation strengthened by 465 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 2 (OVERLAPS) 978/1064 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1064 variables, 465/637 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1064/1079 variables, and 637 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30044 ms.
Refiners :[Domain max(s): 86/101 constraints, State Equation: 86/101 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1233/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 2 (OVERLAPS) 978/1064 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1064 variables, 465/637 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 676/1313 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1064/1079 variables, and 1313 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30034 ms.
Refiners :[Domain max(s): 86/101 constraints, State Equation: 86/101 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1202/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62362ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 62367ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/137 places, 1248/1280 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65395 ms. Remains : 101/137 places, 1248/1280 transitions.
[2025-06-06 10:02:57] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:02:58] [INFO ] Flatten gal took : 45 ms
[2025-06-06 10:02:58] [INFO ] Input system was already deterministic with 1248 transitions.
[2025-06-06 10:02:58] [INFO ] Flatten gal took : 46 ms
[2025-06-06 10:02:58] [INFO ] Flatten gal took : 48 ms
[2025-06-06 10:02:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11490183741841000016.gal : 8 ms
[2025-06-06 10:02:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5221333588684008311.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11490183741841000016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5221333588684008311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:03:28] [INFO ] Flatten gal took : 46 ms
[2025-06-06 10:03:28] [INFO ] Applying decomposition
[2025-06-06 10:03:28] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6876262467751648165.txt' '-o' '/tmp/graph6876262467751648165.bin' '-w' '/tmp/graph6876262467751648165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6876262467751648165.bin' '-l' '-1' '-v' '-w' '/tmp/graph6876262467751648165.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:03:28] [INFO ] Decomposing Gal with order
[2025-06-06 10:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:03:28] [INFO ] Removed a total of 3904 redundant transitions.
[2025-06-06 10:03:28] [INFO ] Flatten gal took : 91 ms
[2025-06-06 10:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 19 ms.
[2025-06-06 10:03:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15102329058740925501.gal : 5 ms
[2025-06-06 10:03:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality17700710808955805150.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15102329058740925501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17700710808955805150.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.54571e+08,0.483464,20860,1811,51,29734,314,1290,32175,75,821,0


Converting to forward existential form...Done !
original formula: (AG((i19.u24.P_lb_load_2_0==0)) + EG(((i16.u21.P_lb_load_1_8==0)||(i0.u0.P_server_waiting_1==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(((i16.u21.P_lb_load_1_8==0)||(i0.u0.P_server_waiting_1==1))))),TRUE) * !((i19.u24.P_lb_load_...173
Reverse transition relation is NOT exact ! Due to transitions t717, t1057, t1058, t1059, t1060, t1061, t1062, t1063, t1064, t1065, t1066, t1067, t1068, t10...558
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,1.6269,62460,1,0,124453,664,6772,122648,271,2186,348098
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:03:30] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-06 10:03:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:03:31] [INFO ] Implicit Places using invariants in 828 ms returned [15, 16, 17, 18, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 831 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 841 ms. Remains : 132/137 places, 1280/1280 transitions.
[2025-06-06 10:03:31] [INFO ] Flatten gal took : 35 ms
[2025-06-06 10:03:31] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:03:31] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:03:31] [INFO ] Flatten gal took : 39 ms
[2025-06-06 10:03:31] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:03:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17861575181826166705.gal : 7 ms
[2025-06-06 10:03:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality11683802518836741135.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17861575181826166705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11683802518836741135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:04:01] [INFO ] Flatten gal took : 40 ms
[2025-06-06 10:04:01] [INFO ] Applying decomposition
[2025-06-06 10:04:01] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14201454396361537326.txt' '-o' '/tmp/graph14201454396361537326.bin' '-w' '/tmp/graph14201454396361537326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14201454396361537326.bin' '-l' '-1' '-v' '-w' '/tmp/graph14201454396361537326.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:04:01] [INFO ] Decomposing Gal with order
[2025-06-06 10:04:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:04:01] [INFO ] Removed a total of 3477 redundant transitions.
[2025-06-06 10:04:01] [INFO ] Flatten gal took : 77 ms
[2025-06-06 10:04:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 15 ms.
[2025-06-06 10:04:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality8322836243266463654.gal : 5 ms
[2025-06-06 10:04:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality758156617487582310.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8322836243266463654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality758156617487582310.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.48581,48664,1761,198,89071,763,1276,86495,168,4910,0


Converting to forward existential form...Done !
original formula: AG(EX(EG(((i13.u22.P_lb_routing_1_8==0)&&(i9.u14.P_client_ack_15==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(((i13.u22.P_lb_routing_1_8==0)&&(i9.u14.P_client_ack_15==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...492
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,3.75927,113176,1,0,223616,3429,6511,184250,781,14298,821932
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:04:05] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-06 10:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:04:06] [INFO ] Implicit Places using invariants in 841 ms returned [15, 16, 18, 51]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 845 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 855 ms. Remains : 133/137 places, 1280/1280 transitions.
[2025-06-06 10:04:06] [INFO ] Flatten gal took : 35 ms
[2025-06-06 10:04:06] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:04:06] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:04:06] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:04:06] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:04:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality339180697546042733.gal : 6 ms
[2025-06-06 10:04:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality7117019376357733782.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality339180697546042733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7117019376357733782.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:04:36] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:04:36] [INFO ] Applying decomposition
[2025-06-06 10:04:36] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6100064368709558701.txt' '-o' '/tmp/graph6100064368709558701.bin' '-w' '/tmp/graph6100064368709558701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6100064368709558701.bin' '-l' '-1' '-v' '-w' '/tmp/graph6100064368709558701.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:04:36] [INFO ] Decomposing Gal with order
[2025-06-06 10:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:04:37] [INFO ] Removed a total of 3919 redundant transitions.
[2025-06-06 10:04:37] [INFO ] Flatten gal took : 75 ms
[2025-06-06 10:04:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 16 ms.
[2025-06-06 10:04:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1916499986699764773.gal : 5 ms
[2025-06-06 10:04:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality13791248173052092946.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1916499986699764773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13791248173052092946.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.26101,48916,1877,54,97328,288,1285,99932,79,750,0


Converting to forward existential form...Done !
original formula: AF(EX(((EG((i14.u2.P_client_idle_8==1)) * (i3.u10.P_client_idle_5==1)) * !(E((((i17.u40.P_lb_load_2_3==0)||(i5.u12.P_client_ack_9==1))||(...252
=> equivalent forward existential formula: [FwdG(Init,!(EX(((EG((i14.u2.P_client_idle_8==1)) * (i3.u10.P_client_idle_5==1)) * !(E((((i17.u40.P_lb_load_2_3=...297
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:05:07] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-06 10:05:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:05:08] [INFO ] Implicit Places using invariants in 999 ms returned [16, 17, 51]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1017 ms. Remains : 134/137 places, 1280/1280 transitions.
[2025-06-06 10:05:08] [INFO ] Flatten gal took : 36 ms
[2025-06-06 10:05:08] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:05:08] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:05:08] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:05:08] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:05:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality8411590851165904546.gal : 8 ms
[2025-06-06 10:05:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15707509846521708892.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8411590851165904546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15707509846521708892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:05:38] [INFO ] Flatten gal took : 41 ms
[2025-06-06 10:05:38] [INFO ] Applying decomposition
[2025-06-06 10:05:38] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11433824162646690524.txt' '-o' '/tmp/graph11433824162646690524.bin' '-w' '/tmp/graph11433824162646690524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11433824162646690524.bin' '-l' '-1' '-v' '-w' '/tmp/graph11433824162646690524.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:05:38] [INFO ] Decomposing Gal with order
[2025-06-06 10:05:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:05:38] [INFO ] Removed a total of 3815 redundant transitions.
[2025-06-06 10:05:38] [INFO ] Flatten gal took : 68 ms
[2025-06-06 10:05:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 12 ms.
[2025-06-06 10:05:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality253281330591557620.gal : 4 ms
[2025-06-06 10:05:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3509774880765990543.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality253281330591557620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3509774880765990543.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,3.15182,76544,2022,99,132397,444,1209,140341,100,1848,0


Converting to forward existential form...Done !
original formula: E(((A(EF(!(((i0.u5.P_client_idle_14==1)&&((i5.u17.P_server_notification_2==0)||(i16.u32.P_server_request_8_1==1))))) U EX(((EG((i15.u31.P...758
=> equivalent forward existential formula: [FwdG(FwdU(Init,((!((E(!(EX(((EG((i15.u31.P_lb_routing_1_5==0)) + (i14.u29.P_server_request_2_2==1)) + (i15.u1.P...1087
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...473
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,19.3841,442496,1,0,903078,1974,7358,805312,435,8671,2121499
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 137 transition count 1268
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 125 transition count 1268
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 50 place count 112 transition count 1255
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 59 place count 106 transition count 1252
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 63 place count 104 transition count 1250
Applied a total of 63 rules in 151 ms. Remains 104 /137 variables (removed 33) and now considering 1250/1280 (removed 30) transitions.
[2025-06-06 10:05:58] [INFO ] Flow matrix only has 980 transitions (discarded 270 similar events)
// Phase 1: matrix 980 rows 104 cols
[2025-06-06 10:05:58] [INFO ] Invariants computation overflowed in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:05:58] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-06 10:05:58] [INFO ] Flow matrix only has 980 transitions (discarded 270 similar events)
// Phase 1: matrix 980 rows 104 cols
[2025-06-06 10:05:58] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:05:58] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:06:01] [INFO ] Implicit Places using invariants and state equation in 2760 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2947 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 103/137 places, 1250/1280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 1249
Applied a total of 2 rules in 48 ms. Remains 102 /103 variables (removed 1) and now considering 1249/1250 (removed 1) transitions.
[2025-06-06 10:06:01] [INFO ] Flow matrix only has 979 transitions (discarded 270 similar events)
// Phase 1: matrix 979 rows 102 cols
[2025-06-06 10:06:01] [INFO ] Computed 23 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:06:02] [INFO ] Implicit Places using invariants in 718 ms returned []
[2025-06-06 10:06:02] [INFO ] Flow matrix only has 979 transitions (discarded 270 similar events)
[2025-06-06 10:06:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:06:02] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:06:04] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/137 places, 1249/1280 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5869 ms. Remains : 102/137 places, 1249/1280 transitions.
[2025-06-06 10:06:04] [INFO ] Flatten gal took : 41 ms
[2025-06-06 10:06:04] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:06:04] [INFO ] Input system was already deterministic with 1249 transitions.
[2025-06-06 10:06:04] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:06:04] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:06:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1152057154927352923.gal : 7 ms
[2025-06-06 10:06:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality14880102771130756693.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1152057154927352923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14880102771130756693.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:06:34] [INFO ] Flatten gal took : 47 ms
[2025-06-06 10:06:34] [INFO ] Applying decomposition
[2025-06-06 10:06:34] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3910853933701685763.txt' '-o' '/tmp/graph3910853933701685763.bin' '-w' '/tmp/graph3910853933701685763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3910853933701685763.bin' '-l' '-1' '-v' '-w' '/tmp/graph3910853933701685763.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:06:34] [INFO ] Decomposing Gal with order
[2025-06-06 10:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:06:34] [INFO ] Removed a total of 4010 redundant transitions.
[2025-06-06 10:06:34] [INFO ] Flatten gal took : 70 ms
[2025-06-06 10:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 13 ms.
[2025-06-06 10:06:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11131737266771493019.gal : 5 ms
[2025-06-06 10:06:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality3070424765193397692.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11131737266771493019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3070424765193397692.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.92171e+08,0.459212,19004,1813,53,26885,292,1389,27248,82,626,0


Converting to forward existential form...Done !
original formula: AF(!(A(((i5.u1.P_client_ack_6==0)||(i17.u21.P_lb_load_1_7==1)) U AG((i4.u0.P_client_waiting_5==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(E(TRUE U !((i4.u0.P_client_waiting_5==1))))) U (!(((i5.u1.P_client_ack_6==0)||(i17.u21.P...295
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t706, t1044, t1045, t1046, t1047, t1048, t1049, t1050, t1051, t1052, t1053, t1054, t1...556
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,3.53385,125372,1,0,253441,577,7219,286334,314,1986,675138
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 137 transition count 1268
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 125 transition count 1268
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 113 transition count 1256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 105 transition count 1252
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 101 transition count 1248
Applied a total of 68 rules in 52 ms. Remains 101 /137 variables (removed 36) and now considering 1248/1280 (removed 32) transitions.
[2025-06-06 10:06:38] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:06:38] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:06:38] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-06 10:06:38] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:06:38] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:06:38] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:06:41] [INFO ] Implicit Places using invariants and state equation in 2725 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2888 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/137 places, 1248/1280 transitions.
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 2 place count 99 transition count 1247
Applied a total of 2 rules in 42 ms. Remains 99 /100 variables (removed 1) and now considering 1247/1248 (removed 1) transitions.
[2025-06-06 10:06:41] [INFO ] Flow matrix only has 977 transitions (discarded 270 similar events)
// Phase 1: matrix 977 rows 99 cols
[2025-06-06 10:06:41] [INFO ] Invariants computation overflowed in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:06:41] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-06 10:06:41] [INFO ] Flow matrix only has 977 transitions (discarded 270 similar events)
// Phase 1: matrix 977 rows 99 cols
[2025-06-06 10:06:41] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:06:41] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:06:44] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 2845 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/137 places, 1247/1280 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5828 ms. Remains : 99/137 places, 1247/1280 transitions.
[2025-06-06 10:06:44] [INFO ] Flatten gal took : 42 ms
[2025-06-06 10:06:44] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:06:44] [INFO ] Input system was already deterministic with 1247 transitions.
[2025-06-06 10:06:44] [INFO ] Flatten gal took : 65 ms
[2025-06-06 10:06:44] [INFO ] Flatten gal took : 42 ms
[2025-06-06 10:06:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7067141953699365871.gal : 7 ms
[2025-06-06 10:06:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14036612681478996320.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7067141953699365871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14036612681478996320.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:07:14] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:07:14] [INFO ] Applying decomposition
[2025-06-06 10:07:14] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16173118227411894898.txt' '-o' '/tmp/graph16173118227411894898.bin' '-w' '/tmp/graph16173118227411894898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16173118227411894898.bin' '-l' '-1' '-v' '-w' '/tmp/graph16173118227411894898.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:07:14] [INFO ] Decomposing Gal with order
[2025-06-06 10:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:07:14] [INFO ] Removed a total of 3904 redundant transitions.
[2025-06-06 10:07:14] [INFO ] Flatten gal took : 67 ms
[2025-06-06 10:07:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 12 ms.
[2025-06-06 10:07:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3654880966065347331.gal : 3 ms
[2025-06-06 10:07:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14009649145958057963.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3654880966065347331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14009649145958057963.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65918e+08,0.331278,16872,1966,97,22814,407,1295,19252,107,849,0


Converting to forward existential form...Done !
original formula: EG((u1.P_server_notification_1==0))
=> equivalent forward existential formula: [FwdG(Init,(u1.P_server_notification_1==0))] != FALSE
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,0.765657,28520,1,0,44489,1207,4612,46072,379,4160,183612
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 137 transition count 1268
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 125 transition count 1268
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 50 place count 112 transition count 1255
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 104 transition count 1251
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 100 transition count 1247
Applied a total of 70 rules in 49 ms. Remains 100 /137 variables (removed 37) and now considering 1247/1280 (removed 33) transitions.
[2025-06-06 10:07:15] [INFO ] Flow matrix only has 977 transitions (discarded 270 similar events)
// Phase 1: matrix 977 rows 100 cols
[2025-06-06 10:07:15] [INFO ] Computed 23 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:07:16] [INFO ] Implicit Places using invariants in 702 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 706 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 99/137 places, 1247/1280 transitions.
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 2 place count 98 transition count 1246
Applied a total of 2 rules in 41 ms. Remains 98 /99 variables (removed 1) and now considering 1246/1247 (removed 1) transitions.
[2025-06-06 10:07:16] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
// Phase 1: matrix 976 rows 98 cols
[2025-06-06 10:07:16] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:07:17] [INFO ] Implicit Places using invariants in 703 ms returned []
[2025-06-06 10:07:17] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2025-06-06 10:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:07:17] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:07:19] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2616 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 98/137 places, 1246/1280 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 3413 ms. Remains : 98/137 places, 1246/1280 transitions.
[2025-06-06 10:07:19] [INFO ] Flatten gal took : 40 ms
[2025-06-06 10:07:19] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:07:19] [INFO ] Input system was already deterministic with 1246 transitions.
[2025-06-06 10:07:19] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:07:19] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:07:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality18136137444080719896.gal : 7 ms
[2025-06-06 10:07:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality10355385994584611060.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18136137444080719896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10355385994584611060.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:07:49] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:07:49] [INFO ] Applying decomposition
[2025-06-06 10:07:49] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4705065399801354903.txt' '-o' '/tmp/graph4705065399801354903.bin' '-w' '/tmp/graph4705065399801354903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4705065399801354903.bin' '-l' '-1' '-v' '-w' '/tmp/graph4705065399801354903.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:07:49] [INFO ] Decomposing Gal with order
[2025-06-06 10:07:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:07:49] [INFO ] Removed a total of 3904 redundant transitions.
[2025-06-06 10:07:49] [INFO ] Flatten gal took : 68 ms
[2025-06-06 10:07:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 13 ms.
[2025-06-06 10:07:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3719368511882693805.gal : 5 ms
[2025-06-06 10:07:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality8460596394785775546.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3719368511882693805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8460596394785775546.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77285e+08,0.43252,17620,2070,51,24179,329,1292,19479,77,1080,0


Converting to forward existential form...Done !
original formula: EG(AF(((u13.P_lb_routing_1_9==0)||(u6.P_server_request_11_1==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((u13.P_lb_routing_1_9==0)||(u6.P_server_request_11_1==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1040, t1041, t1042, t1043, t1044, t1045, t1046, t1047, t1048, t1049, t1050, t1051, t1052, t1...565
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,2.13313,84308,1,0,131482,876,7482,108653,279,2936,810859
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:07:51] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 137 cols
[2025-06-06 10:07:51] [INFO ] Computed 27 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:07:52] [INFO ] Implicit Places using invariants in 863 ms returned [15, 16, 17, 18, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 866 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 880 ms. Remains : 132/137 places, 1280/1280 transitions.
[2025-06-06 10:07:52] [INFO ] Flatten gal took : 34 ms
[2025-06-06 10:07:52] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:07:52] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:07:52] [INFO ] Flatten gal took : 36 ms
[2025-06-06 10:07:52] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:07:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality16767593139979245280.gal : 7 ms
[2025-06-06 10:07:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16278852584631404530.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16767593139979245280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16278852584631404530.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:08:23] [INFO ] Flatten gal took : 40 ms
[2025-06-06 10:08:23] [INFO ] Applying decomposition
[2025-06-06 10:08:23] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3173181403372074776.txt' '-o' '/tmp/graph3173181403372074776.bin' '-w' '/tmp/graph3173181403372074776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3173181403372074776.bin' '-l' '-1' '-v' '-w' '/tmp/graph3173181403372074776.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:08:23] [INFO ] Decomposing Gal with order
[2025-06-06 10:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:08:23] [INFO ] Removed a total of 3815 redundant transitions.
[2025-06-06 10:08:23] [INFO ] Flatten gal took : 66 ms
[2025-06-06 10:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 10 ms.
[2025-06-06 10:08:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15522243711304910112.gal : 3 ms
[2025-06-06 10:08:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11265867340861007511.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15522243711304910112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11265867340861007511.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.24583,49656,2087,54,96386,308,1205,92574,95,1049,0


Converting to forward existential form...Done !
original formula: AX(AF(((i13.u4.P_client_ack_10==0)&&(i10.u17.P_server_notification_1==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i13.u4.P_client_ack_10==0)&&(i10.u17.P_server_notification_1==1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,5.14984,179192,1,0,362600,778,4983,325668,324,3413,1042666
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 137 transition count 1268
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 125 transition count 1268
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 113 transition count 1256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 105 transition count 1252
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 101 transition count 1248
Applied a total of 68 rules in 59 ms. Remains 101 /137 variables (removed 36) and now considering 1248/1280 (removed 32) transitions.
[2025-06-06 10:08:28] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:08:28] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:08:28] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-06 10:08:28] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2025-06-06 10:08:28] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:08:28] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:08:31] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2987 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/137 places, 1248/1280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 1247
Applied a total of 2 rules in 40 ms. Remains 99 /100 variables (removed 1) and now considering 1247/1248 (removed 1) transitions.
[2025-06-06 10:08:31] [INFO ] Flow matrix only has 977 transitions (discarded 270 similar events)
// Phase 1: matrix 977 rows 99 cols
[2025-06-06 10:08:31] [INFO ] Invariants computation overflowed in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:08:31] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-06 10:08:31] [INFO ] Flow matrix only has 977 transitions (discarded 270 similar events)
// Phase 1: matrix 977 rows 99 cols
[2025-06-06 10:08:31] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:08:31] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:08:34] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/137 places, 1247/1280 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5676 ms. Remains : 99/137 places, 1247/1280 transitions.
[2025-06-06 10:08:34] [INFO ] Flatten gal took : 39 ms
[2025-06-06 10:08:34] [INFO ] Flatten gal took : 67 ms
[2025-06-06 10:08:34] [INFO ] Input system was already deterministic with 1247 transitions.
[2025-06-06 10:08:34] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:08:34] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:08:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3499589579335286897.gal : 7 ms
[2025-06-06 10:08:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality1706461992606328930.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3499589579335286897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1706461992606328930.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:09:04] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:09:04] [INFO ] Applying decomposition
[2025-06-06 10:09:04] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13073732961588979510.txt' '-o' '/tmp/graph13073732961588979510.bin' '-w' '/tmp/graph13073732961588979510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13073732961588979510.bin' '-l' '-1' '-v' '-w' '/tmp/graph13073732961588979510.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:09:04] [INFO ] Decomposing Gal with order
[2025-06-06 10:09:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:09:04] [INFO ] Removed a total of 3800 redundant transitions.
[2025-06-06 10:09:04] [INFO ] Flatten gal took : 65 ms
[2025-06-06 10:09:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 9 ms.
[2025-06-06 10:09:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4425275047841601218.gal : 3 ms
[2025-06-06 10:09:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality943816206216543538.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4425275047841601218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality943816206216543538.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66755e+08,0.275628,16404,1838,97,22673,412,1152,24047,100,1204,0


Converting to forward existential form...Done !
original formula: AF((u0.P_server_idle_2==0))
=> equivalent forward existential formula: [FwdG(Init,!((u0.P_server_idle_2==0)))] = FALSE
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,0.571643,23572,1,0,32650,1167,4253,46521,372,3394,142511
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:09:05] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-06 10:09:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:09:06] [INFO ] Implicit Places using invariants in 744 ms returned [15, 17, 18, 51]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 747 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 766 ms. Remains : 133/137 places, 1280/1280 transitions.
[2025-06-06 10:09:06] [INFO ] Flatten gal took : 34 ms
[2025-06-06 10:09:06] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:09:06] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:09:06] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:09:06] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:09:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality7643811448006503263.gal : 7 ms
[2025-06-06 10:09:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10256507194267247457.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7643811448006503263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10256507194267247457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:09:36] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:09:36] [INFO ] Applying decomposition
[2025-06-06 10:09:36] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17765315352235489694.txt' '-o' '/tmp/graph17765315352235489694.bin' '-w' '/tmp/graph17765315352235489694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17765315352235489694.bin' '-l' '-1' '-v' '-w' '/tmp/graph17765315352235489694.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:09:36] [INFO ] Decomposing Gal with order
[2025-06-06 10:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:09:36] [INFO ] Removed a total of 3919 redundant transitions.
[2025-06-06 10:09:36] [INFO ] Flatten gal took : 65 ms
[2025-06-06 10:09:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 11 ms.
[2025-06-06 10:09:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality16995885222123902289.gal : 3 ms
[2025-06-06 10:09:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17108034354247742016.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16995885222123902289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17108034354247742016.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,2.33083,71832,2042,54,139994,298,1417,132312,76,705,0


Converting to forward existential form...Done !
original formula: A(EG((((i12.u10.P_client_idle_3==0)||(i8.u27.P_lb_routing_1_13==1))&&((i18.u37.P_lb_load_2_15==0)||(i13.u23.P_lb_routing_1_8==1)))) U (EG...512
=> equivalent forward existential formula: [((Init * !(EG(!((EG(((i12.u36.P_lb_load_1_6==1) * !(((((u39.P_lb_load_2_9==0)||(i6.u9.P_client_ack_2==1))&&(i12...1379
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...509
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.4246,339352,1,0,716119,1006,7550,644532,328,4831,1731274
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2025-06-06 10:09:48] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2025-06-06 10:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:09:49] [INFO ] Implicit Places using invariants in 732 ms returned [15, 16, 17, 18, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 735 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 1280/1280 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 744 ms. Remains : 132/137 places, 1280/1280 transitions.
[2025-06-06 10:09:49] [INFO ] Flatten gal took : 35 ms
[2025-06-06 10:09:49] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:09:49] [INFO ] Input system was already deterministic with 1280 transitions.
[2025-06-06 10:09:49] [INFO ] Flatten gal took : 36 ms
[2025-06-06 10:09:49] [INFO ] Flatten gal took : 37 ms
[2025-06-06 10:09:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7114617909283177829.gal : 7 ms
[2025-06-06 10:09:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4631837049367907247.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7114617909283177829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4631837049367907247.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:10:19] [INFO ] Flatten gal took : 40 ms
[2025-06-06 10:10:19] [INFO ] Applying decomposition
[2025-06-06 10:10:19] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12258219456697707371.txt' '-o' '/tmp/graph12258219456697707371.bin' '-w' '/tmp/graph12258219456697707371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12258219456697707371.bin' '-l' '-1' '-v' '-w' '/tmp/graph12258219456697707371.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:10:19] [INFO ] Decomposing Gal with order
[2025-06-06 10:10:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:10:19] [INFO ] Removed a total of 3815 redundant transitions.
[2025-06-06 10:10:19] [INFO ] Flatten gal took : 74 ms
[2025-06-06 10:10:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 11 ms.
[2025-06-06 10:10:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality14486483636752042994.gal : 5 ms
[2025-06-06 10:10:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4294560119559635186.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14486483636752042994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4294560119559635186.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.44459,45540,2043,54,84157,300,1153,74739,95,1056,0


Converting to forward existential form...Done !
original formula: EX((AG(!(A((i16.u6.P_client_idle_1==1) U AX((i11.u16.P_server_processed_2==1))))) * ((EF((i5.u29.P_lb_routing_1_4==1)) + AF(((i5.u29.P_se...284
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !(E(TRUE U !(!(!((E(!(!(EX(!((i11.u16.P_server_processed_2==1))))) U (!((i16.u6.P_client_id...971
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...506
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,10.0733,396516,1,0,879089,1033,6691,729736,337,3761,2888190
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 1280/1280 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 137 transition count 1269
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 126 transition count 1269
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 46 place count 114 transition count 1257
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 55 place count 108 transition count 1254
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 61 place count 105 transition count 1251
Applied a total of 61 rules in 56 ms. Remains 105 /137 variables (removed 32) and now considering 1251/1280 (removed 29) transitions.
[2025-06-06 10:10:29] [INFO ] Flow matrix only has 981 transitions (discarded 270 similar events)
// Phase 1: matrix 981 rows 105 cols
[2025-06-06 10:10:29] [INFO ] Invariants computation overflowed in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:10:30] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-06 10:10:30] [INFO ] Flow matrix only has 981 transitions (discarded 270 similar events)
// Phase 1: matrix 981 rows 105 cols
[2025-06-06 10:10:30] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:10:30] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:10:33] [INFO ] Implicit Places using invariants and state equation in 3063 ms returned [12, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3242 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 103/137 places, 1251/1280 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 1249
Applied a total of 4 rules in 55 ms. Remains 101 /103 variables (removed 2) and now considering 1249/1251 (removed 2) transitions.
[2025-06-06 10:10:33] [INFO ] Flow matrix only has 979 transitions (discarded 270 similar events)
// Phase 1: matrix 979 rows 101 cols
[2025-06-06 10:10:33] [INFO ] Invariants computation overflowed in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:10:33] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-06 10:10:33] [INFO ] Flow matrix only has 979 transitions (discarded 270 similar events)
// Phase 1: matrix 979 rows 101 cols
[2025-06-06 10:10:33] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 10:10:33] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 10:10:36] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 2855 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 101/137 places, 1249/1280 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6208 ms. Remains : 101/137 places, 1249/1280 transitions.
[2025-06-06 10:10:36] [INFO ] Flatten gal took : 40 ms
[2025-06-06 10:10:36] [INFO ] Flatten gal took : 43 ms
[2025-06-06 10:10:36] [INFO ] Input system was already deterministic with 1249 transitions.
[2025-06-06 10:10:36] [INFO ] Flatten gal took : 42 ms
[2025-06-06 10:10:36] [INFO ] Flatten gal took : 42 ms
[2025-06-06 10:10:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10781926748719020061.gal : 7 ms
[2025-06-06 10:10:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17941246100432854194.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10781926748719020061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17941246100432854194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 10:11:06] [INFO ] Flatten gal took : 44 ms
[2025-06-06 10:11:06] [INFO ] Applying decomposition
[2025-06-06 10:11:06] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11429898987927741380.txt' '-o' '/tmp/graph11429898987927741380.bin' '-w' '/tmp/graph11429898987927741380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11429898987927741380.bin' '-l' '-1' '-v' '-w' '/tmp/graph11429898987927741380.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:11:06] [INFO ] Decomposing Gal with order
[2025-06-06 10:11:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:11:06] [INFO ] Removed a total of 4010 redundant transitions.
[2025-06-06 10:11:06] [INFO ] Flatten gal took : 66 ms
[2025-06-06 10:11:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 11 ms.
[2025-06-06 10:11:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5127382828565748375.gal : 3 ms
[2025-06-06 10:11:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality92037495536792809.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5127382828565748375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality92037495536792809.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.92171e+08,0.430874,19376,2086,52,24799,281,1436,20073,83,552,0


Converting to forward existential form...Done !
original formula: (AF(EG((i1.u1.P_client_request_14==0))) * AG((EG((i0.u0.P_client_idle_12==0)) + (i0.u0.P_client_request_12==0))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG((i1.u1.P_client_request_14==0))))] = FALSE * [((FwdU(Init,TRUE) * !((i0.u0.P_client_request_12=...208
Reverse transition relation is NOT exact ! Due to transitions t3, t705, t1045, t1046, t1047, t1048, t1049, t1050, t1051, t1052, t1053, t1054, t1055, t1056,...573
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,1.9548,88624,1,0,175000,670,7793,144594,300,1990,803754
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

[2025-06-06 10:11:08] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:11:08] [INFO ] Flatten gal took : 38 ms
[2025-06-06 10:11:08] [INFO ] Applying decomposition
[2025-06-06 10:11:08] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6158433017954340995.txt' '-o' '/tmp/graph6158433017954340995.bin' '-w' '/tmp/graph6158433017954340995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6158433017954340995.bin' '-l' '-1' '-v' '-w' '/tmp/graph6158433017954340995.weights' '-q' '0' '-e' '0.001'
[2025-06-06 10:11:08] [INFO ] Decomposing Gal with order
[2025-06-06 10:11:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 10:11:08] [INFO ] Removed a total of 3919 redundant transitions.
[2025-06-06 10:11:09] [INFO ] Flatten gal took : 90 ms
[2025-06-06 10:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 10 ms.
[2025-06-06 10:11:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9561294595858492699.gal : 3 ms
[2025-06-06 10:11:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality8009569346213129473.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9561294595858492699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8009569346213129473.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37407e+12,1.68416,59116,2516,99,108237,413,1359,93185,108,2381,0


Converting to forward existential form...Done !
original formula: AF(EX(((EG((i12.u4.P_client_idle_8==1)) * (i0.u1.P_client_idle_5==1)) * !(E((((u38.P_lb_load_2_3==0)||(i13.u12.P_client_ack_9==1))||(i6.u...248
=> equivalent forward existential formula: [FwdG(Init,!(EX(((EG((i12.u4.P_client_idle_8==1)) * (i0.u1.P_client_idle_5==1)) * !(E((((u38.P_lb_load_2_3==0)||...293
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,113.34,2225156,1,0,4.46436e+06,2325,3129,5.26114e+06,237,7551,8924602
FORMULA SimpleLoadBal-PT-15-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 846781 ms.

BK_STOP 1749204782782

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-15, 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 r212-tall-174901994500521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-15.tgz
mv SimpleLoadBal-PT-15 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.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 ;