Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994500516.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994500516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 535K 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-10-LTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749203713063

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 09:55:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 09:55:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:55:14] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-06-06 09:55:14] [INFO ] Transformed 104 places.
[2025-06-06 09:55:14] [INFO ] Transformed 605 transitions.
[2025-06-06 09:55:14] [INFO ] Found NUPN structural information;
[2025-06-06 09:55:14] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2025-06-06 09:55:14] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 605/605 transitions.
Applied a total of 0 rules in 16 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2025-06-06 09:55:14] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2025-06-06 09:55:14] [INFO ] Computed 29 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:55:15] [INFO ] Implicit Places using invariants in 338 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 42, 43]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 382 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/104 places, 605/605 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 92/104 places, 605/605 transitions.
Support contains 50 out of 92 places after structural reductions.
[2025-06-06 09:55:15] [INFO ] Flatten gal took : 87 ms
[2025-06-06 09:55:15] [INFO ] Flatten gal took : 51 ms
[2025-06-06 09:55:15] [INFO ] Input system was already deterministic with 605 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (8 resets) in 2041 ms. (19 steps per ms) remains 13/38 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
[2025-06-06 09:55:16] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 92 cols
[2025-06-06 09:55:16] [INFO ] Computed 17 invariants in 10 ms
[2025-06-06 09:55:16] [INFO ] State equation strengthened by 210 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 2 (OVERLAPS) 42/69 variables, 10/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 42/79 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:17] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 6 ms to minimize.
Problem AtomicPropp12 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/80 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 10/79 variables, 2/82 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 10/92 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/92 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 9/88 variables, 3/95 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 9/104 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/104 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 92/567 variables, and 106 constraints, problems are : Problem set: 12 solved, 0 unsolved in 665 ms.
Refiners :[Domain max(s): 88/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/92 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 12/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SimpleLoadBal-PT-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SimpleLoadBal-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 605/605 transitions.
Applied a total of 0 rules in 25 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2025-06-06 09:55:17] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:55:18] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-06 09:55:18] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:55:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:55:18] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-06 09:55:19] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Running 595 sub problems to find dead transitions.
[2025-06-06 09:55:19] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:55:19] [INFO ] Invariant cache hit.
[2025-06-06 09:55:19] [INFO ] State equation strengthened by 210 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:21] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 5 (OVERLAPS) 9/91 variables, 9/98 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 9/107 constraints. Problems are: Problem set: 1 solved, 594 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 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 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 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 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 TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 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 TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 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 TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/108 constraints. Problems are: Problem set: 178 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:30] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:30] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:30] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:30] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:30] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:31] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:31] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:31] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:31] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:31] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 6 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 10/118 constraints. Problems are: Problem set: 184 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:33] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/119 constraints. Problems are: Problem set: 184 solved, 411 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/119 constraints. Problems are: Problem set: 184 solved, 411 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/92 variables, 1/120 constraints. Problems are: Problem set: 200 solved, 395 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 1/121 constraints. Problems are: Problem set: 200 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:40] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:55:41] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 6 ms to minimize.
Problem TDEAD392 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 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
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 2/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 0/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 15 (OVERLAPS) 475/567 variables, 92/215 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 210/425 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 425 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30041 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 595/565 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 221 solved, 374 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 12/100 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 9/91 variables, 9/109 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 9/118 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/119 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/119 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/120 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/121 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 2/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 13 (OVERLAPS) 475/567 variables, 92/215 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 210/425 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/567 variables, 352/777 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:13] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 1/778 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 778 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30021 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 374/565 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61119ms problems are : Problem set: 221 solved, 374 unsolved
Search for dead transitions found 221 dead transitions in 61124ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in LTL mode, iteration 1 : 92/92 places, 384/605 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 88 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 86 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8 place count 84 transition count 376
Applied a total of 8 rules in 9 ms. Remains 84 /92 variables (removed 8) and now considering 376/384 (removed 8) transitions.
[2025-06-06 09:56:20] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
// Phase 1: matrix 299 rows 84 cols
[2025-06-06 09:56:20] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:56:20] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-06 09:56:20] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2025-06-06 09:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:56:20] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-06 09:56:20] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/92 places, 376/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62924 ms. Remains : 84/92 places, 376/605 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1832 steps with 0 reset in 49 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-06 finished in 63496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(!p0))))))'
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 605/605 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2025-06-06 09:56:21] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 92 cols
[2025-06-06 09:56:21] [INFO ] Computed 17 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:56:21] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-06 09:56:21] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:56:21] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-06 09:56:22] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 595 sub problems to find dead transitions.
[2025-06-06 09:56:22] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:56:22] [INFO ] Invariant cache hit.
[2025-06-06 09:56:22] [INFO ] State equation strengthened by 210 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 5 (OVERLAPS) 9/91 variables, 9/98 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 9/107 constraints. Problems are: Problem set: 1 solved, 594 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 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 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 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 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 TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 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 TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 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 TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/108 constraints. Problems are: Problem set: 178 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:33] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:34] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:34] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 6 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 10/118 constraints. Problems are: Problem set: 184 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:35] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/119 constraints. Problems are: Problem set: 184 solved, 411 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/119 constraints. Problems are: Problem set: 184 solved, 411 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/92 variables, 1/120 constraints. Problems are: Problem set: 200 solved, 395 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 1/121 constraints. Problems are: Problem set: 200 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:42] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:56:43] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 5 ms to minimize.
Problem TDEAD392 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 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
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 2/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 0/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 15 (OVERLAPS) 475/567 variables, 92/215 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 210/425 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 425 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30023 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 595/565 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 221 solved, 374 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 12/100 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 9/91 variables, 9/109 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 9/118 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/119 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/119 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/120 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/121 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 2/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/123 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 13 (OVERLAPS) 475/567 variables, 92/215 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 210/425 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/567 variables, 352/777 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:16] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 1/778 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 778 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30032 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 374/565 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60851ms problems are : Problem set: 221 solved, 374 unsolved
Search for dead transitions found 221 dead transitions in 60854ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in LTL mode, iteration 1 : 92/92 places, 384/605 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 88 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 86 transition count 378
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 85 transition count 376
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 7 rules in 5 ms. Remains 85 /92 variables (removed 7) and now considering 376/384 (removed 8) transitions.
[2025-06-06 09:57:23] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
// Phase 1: matrix 299 rows 85 cols
[2025-06-06 09:57:23] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:57:23] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-06 09:57:23] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2025-06-06 09:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:57:23] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-06 09:57:23] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 85/92 places, 376/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62589 ms. Remains : 85/92 places, 376/605 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 20000 reset in 207 ms.
Product exploration explored 100000 steps with 20000 reset in 195 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 163441 steps, run visited all 1 properties in 349 ms. (steps per millisecond=468 )
Probabilistic random walk after 163441 steps, saw 117523 distinct states, run finished after 352 ms. (steps per millisecond=464 ) properties seen :1
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, p0, p0]
Support contains 6 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-06 09:57:25] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
// Phase 1: matrix 299 rows 84 cols
[2025-06-06 09:57:25] [INFO ] Computed 17 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:57:26] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-06-06 09:57:26] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2025-06-06 09:57:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:57:26] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-06 09:57:26] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-06 09:57:26] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2025-06-06 09:57:26] [INFO ] Invariant cache hit.
[2025-06-06 09:57:26] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:27] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:28] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 10/84 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:32] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:32] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:32] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:32] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:32] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:33] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:34] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:34] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:36] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:57:38] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 13 (OVERLAPS) 299/383 variables, 84/199 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 122/321 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 16 (OVERLAPS) 0/383 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 321 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30023 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 10/84 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 10 (OVERLAPS) 299/383 variables, 84/199 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 122/321 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 366/687 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:58:11] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 688 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Finished structural reductions in LTL mode , in 1 iterations and 61121 ms. Remains : 84/84 places, 376/376 transitions.
Treatment of property SimpleLoadBal-PT-10-LTLFireability-08 finished in 125703 ms.
Application raised an uncaught exception Index 84 out of bounds for length 84
java.lang.ArrayIndexOutOfBoundsException: Index 84 out of bounds for length 84
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:179)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:154)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:166)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyConstants(SparsePetriNet.java:166)
at fr.lip6.move.gal.structural.SparsePetriNet.readFrom(SparsePetriNet.java:434)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.reduceForProperty(LTLPropertySolver.java:496)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:258)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Total runtime 192724 ms.

BK_STOP 1749203907003

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-10"
export BK_EXAMINATION="LTLFireability"
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-10, examination is LTLFireability"
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-174901994500516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;