MCC'2025- Execution of r058-smll-174854063600122

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m05

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600122.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 DBSingleClientW-PT-d2m05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 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 DBSingleClientW-PT-d2m05-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748606062922

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 11:54:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:54:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:54:25] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2025-05-30 11:54:25] [INFO ] Transformed 4763 places.
[2025-05-30 11:54:25] [INFO ] Transformed 2478 transitions.
[2025-05-30 11:54:25] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 588 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 3580 places in 22 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 112 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 335 places :
Symmetric choice reduction at 1 with 335 rule applications. Total rules 580 place count 802 transition count 1754
Iterating global reduction 1 with 335 rules applied. Total rules applied 915 place count 802 transition count 1754
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 1041 place count 802 transition count 1628
Discarding 260 places :
Symmetric choice reduction at 2 with 260 rule applications. Total rules 1301 place count 542 transition count 1368
Iterating global reduction 2 with 260 rules applied. Total rules applied 1561 place count 542 transition count 1368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1566 place count 542 transition count 1363
Discarding 172 places :
Symmetric choice reduction at 3 with 172 rule applications. Total rules 1738 place count 370 transition count 1148
Iterating global reduction 3 with 172 rules applied. Total rules applied 1910 place count 370 transition count 1148
Ensure Unique test removed 226 transitions
Reduce isomorphic transitions removed 226 transitions.
Iterating post reduction 3 with 226 rules applied. Total rules applied 2136 place count 370 transition count 922
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2140 place count 366 transition count 915
Iterating global reduction 4 with 4 rules applied. Total rules applied 2144 place count 366 transition count 915
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2162 place count 366 transition count 897
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2163 place count 365 transition count 896
Iterating global reduction 5 with 1 rules applied. Total rules applied 2164 place count 365 transition count 896
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2165 place count 364 transition count 895
Iterating global reduction 5 with 1 rules applied. Total rules applied 2166 place count 364 transition count 895
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2170 place count 364 transition count 891
Applied a total of 2170 rules in 301 ms. Remains 364 /1183 variables (removed 819) and now considering 891/2478 (removed 1587) transitions.
// Phase 1: matrix 891 rows 364 cols
[2025-05-30 11:54:26] [INFO ] Computed 2 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:26] [INFO ] Implicit Places using invariants in 880 ms returned []
[2025-05-30 11:54:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:27] [INFO ] State equation strengthened by 531 read => feed constraints.
[2025-05-30 11:54:31] [INFO ] Implicit Places using invariants and state equation in 4577 ms returned []
Implicit Place search using SMT with State Equation took 5512 ms to find 0 implicit places.
Running 890 sub problems to find dead transitions.
[2025-05-30 11:54:31] [INFO ] Invariant cache hit.
[2025-05-30 11:54:31] [INFO ] State equation strengthened by 531 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SMT process timed out in 33128ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 33162ms
Starting structural reductions in LTL mode, iteration 1 : 364/1183 places, 891/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39019 ms. Remains : 364/1183 places, 891/2478 transitions.
Support contains 112 out of 364 places after structural reductions.
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 203 ms
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 131 ms
[2025-05-30 11:55:05] [INFO ] Input system was already deterministic with 891 transitions.
Support contains 110 out of 364 places (down from 112) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (9154 resets) in 3739 ms. (10 steps per ms) remains 72/78 properties
BEST_FIRST walk for 4004 steps (195 resets) in 104 ms. (38 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (147 resets) in 77 ms. (51 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (388 resets) in 121 ms. (32 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (171 resets) in 83 ms. (47 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (204 resets) in 87 ms. (45 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (176 resets) in 48 ms. (81 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (192 resets) in 85 ms. (46 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (187 resets) in 64 ms. (61 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (161 resets) in 73 ms. (54 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (162 resets) in 48 ms. (81 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (380 resets) in 64 ms. (61 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (173 resets) in 39 ms. (100 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (195 resets) in 36 ms. (108 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (195 resets) in 153 ms. (25 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (161 resets) in 29 ms. (133 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (190 resets) in 35 ms. (111 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (181 resets) in 35 ms. (111 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (189 resets) in 34 ms. (114 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (188 resets) in 35 ms. (111 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (196 resets) in 32 ms. (121 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (184 resets) in 41 ms. (95 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (175 resets) in 43 ms. (90 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (373 resets) in 76 ms. (51 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (174 resets) in 59 ms. (66 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (182 resets) in 57 ms. (68 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (393 resets) in 81 ms. (48 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (189 resets) in 56 ms. (70 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (173 resets) in 50 ms. (78 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (366 resets) in 62 ms. (63 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (401 resets) in 77 ms. (51 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (176 resets) in 55 ms. (71 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (162 resets) in 37 ms. (105 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (374 resets) in 70 ms. (56 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (168 resets) in 56 ms. (70 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (404 resets) in 91 ms. (43 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (180 resets) in 60 ms. (65 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (382 resets) in 81 ms. (48 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (174 resets) in 56 ms. (70 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (179 resets) in 41 ms. (95 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (181 resets) in 57 ms. (69 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (178 resets) in 54 ms. (72 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (201 resets) in 45 ms. (86 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (164 resets) in 41 ms. (95 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (186 resets) in 57 ms. (69 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (408 resets) in 75 ms. (52 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (177 resets) in 52 ms. (75 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (175 resets) in 55 ms. (71 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (201 resets) in 57 ms. (69 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (176 resets) in 54 ms. (72 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (175 resets) in 57 ms. (69 steps per ms) remains 72/72 properties
Interrupted probabilistic random walk after 441447 steps, run timeout after 6001 ms. (steps per millisecond=73 ) properties seen :61 out of 72
Probabilistic random walk after 441447 steps, saw 164882 distinct states, run finished after 6007 ms. (steps per millisecond=73 ) properties seen :61
[2025-05-30 11:55:14] [INFO ] Invariant cache hit.
[2025-05-30 11:55:14] [INFO ] State equation strengthened by 531 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 125/156 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 84/240 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 550/790 variables, 240/242 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 190/432 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 0/432 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 8 (OVERLAPS) 459/1249 variables, 121/553 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1249 variables, 338/891 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1249 variables, 0/891 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/1255 variables, 3/894 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1255 variables, 3/897 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1255 variables, 0/897 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1255 variables, 0/897 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1255/1255 variables, and 897 constraints, problems are : Problem set: 7 solved, 4 unsolved in 3246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 364/364 constraints, ReadFeed: 531/531 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 130/145 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 89/234 variables, 1/2 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 506/740 variables, 234/236 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 146/382 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/382 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 507/1247 variables, 126/508 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1247 variables, 381/889 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1247 variables, 3/892 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1247 variables, 0/892 constraints. Problems are: Problem set: 7 solved, 4 unsolved
SMT process timed out in 8401ms, After SMT, problems are : Problem set: 7 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 295 transition count 581
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 295 transition count 581
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 152 place count 295 transition count 567
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 208 place count 239 transition count 485
Iterating global reduction 1 with 56 rules applied. Total rules applied 264 place count 239 transition count 485
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 282 place count 239 transition count 467
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 322 place count 199 transition count 405
Iterating global reduction 2 with 40 rules applied. Total rules applied 362 place count 199 transition count 405
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 398 place count 199 transition count 369
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 412 place count 185 transition count 346
Iterating global reduction 3 with 14 rules applied. Total rules applied 426 place count 185 transition count 346
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 431 place count 185 transition count 341
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 441 place count 175 transition count 331
Iterating global reduction 4 with 10 rules applied. Total rules applied 451 place count 175 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 454 place count 175 transition count 328
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 461 place count 168 transition count 313
Iterating global reduction 5 with 7 rules applied. Total rules applied 468 place count 168 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 474 place count 168 transition count 307
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 476 place count 166 transition count 294
Iterating global reduction 6 with 2 rules applied. Total rules applied 478 place count 166 transition count 294
Applied a total of 478 rules in 145 ms. Remains 166 /364 variables (removed 198) and now considering 294/891 (removed 597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 166/364 places, 294/891 transitions.
RANDOM walk for 40000 steps (9176 resets) in 585 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1800 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1760 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 883379 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :3 out of 4
Probabilistic random walk after 883379 steps, saw 334143 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :3
// Phase 1: matrix 294 rows 166 cols
[2025-05-30 11:55:25] [INFO ] Computed 2 invariants in 10 ms
[2025-05-30 11:55:25] [INFO ] State equation strengthened by 137 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 181/288 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 156/444 variables, 51/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 105/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/460 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/460 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 181/288 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 156/444 variables, 51/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 105/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/460 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 8/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/460 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1854ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 294/294 transitions.
Graph (complete) has 591 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 165 transition count 288
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 18 place count 154 transition count 237
Iterating global reduction 1 with 11 rules applied. Total rules applied 29 place count 154 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 154 transition count 234
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 39 place count 147 transition count 223
Iterating global reduction 2 with 7 rules applied. Total rules applied 46 place count 147 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 147 transition count 222
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 54 place count 140 transition count 213
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 140 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 140 transition count 210
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 137 transition count 203
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 137 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 137 transition count 202
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 73 place count 135 transition count 200
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 135 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 76 place count 135 transition count 199
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 77 place count 134 transition count 198
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 134 transition count 198
Applied a total of 78 rules in 68 ms. Remains 134 /166 variables (removed 32) and now considering 198/294 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 134/166 places, 198/294 transitions.
RANDOM walk for 40000 steps (9179 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1767 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Probably explored full state space saw : 289447 states, properties seen :0
Probabilistic random walk after 751351 steps, saw 289447 distinct states, run finished after 1281 ms. (steps per millisecond=586 ) properties seen :0
Explored full state space saw : 290876 states, properties seen :0
Exhaustive walk after 753993 steps, saw 290876 distinct states, run finished after 1081 ms. (steps per millisecond=697 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:55:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 11:55:30] [INFO ] Flatten gal took : 58 ms
[2025-05-30 11:55:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:55:30] [INFO ] Flatten gal took : 61 ms
[2025-05-30 11:55:30] [INFO ] Input system was already deterministic with 891 transitions.
Support contains 70 out of 364 places (down from 79) after GAL structural reductions.
Computed a total of 5 stabilizing places and 47 stable transitions
Graph (complete) has 1612 edges and 364 vertex of which 363 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 286 transition count 530
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 286 transition count 530
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 175 place count 286 transition count 511
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 235 place count 226 transition count 426
Iterating global reduction 1 with 60 rules applied. Total rules applied 295 place count 226 transition count 426
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 313 place count 226 transition count 408
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 359 place count 180 transition count 339
Iterating global reduction 2 with 46 rules applied. Total rules applied 405 place count 180 transition count 339
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 436 place count 180 transition count 308
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 454 place count 162 transition count 275
Iterating global reduction 3 with 18 rules applied. Total rules applied 472 place count 162 transition count 275
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 481 place count 162 transition count 266
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 493 place count 150 transition count 254
Iterating global reduction 4 with 12 rules applied. Total rules applied 505 place count 150 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 509 place count 150 transition count 250
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 516 place count 143 transition count 241
Iterating global reduction 5 with 7 rules applied. Total rules applied 523 place count 143 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 527 place count 143 transition count 237
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 529 place count 141 transition count 225
Iterating global reduction 6 with 2 rules applied. Total rules applied 531 place count 141 transition count 225
Applied a total of 531 rules in 60 ms. Remains 141 /364 variables (removed 223) and now considering 225/891 (removed 666) transitions.
// Phase 1: matrix 225 rows 141 cols
[2025-05-30 11:55:30] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:30] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 11:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:30] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-05-30 11:55:31] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:55:31] [INFO ] Redundant transitions in 11 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-30 11:55:31] [INFO ] Invariant cache hit.
[2025-05-30 11:55:31] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/366 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 92/235 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:44] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:44] [INFO ] Deduced a trap composed of 55 places in 254 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:45] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:45] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:45] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:45] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:45] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 7/242 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:55] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:55] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 244 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/366 variables, 141/152 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 92/244 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 224/468 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 468 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in SI_CTL mode, iteration 1 : 141/364 places, 225/891 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61032 ms. Remains : 141/364 places, 225/891 transitions.
[2025-05-30 11:56:31] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:56:31] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:56:31] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-30 11:56:31] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:56:31] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:56:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16867569265880506697.gal : 9 ms
[2025-05-30 11:56:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7863320667245554259.ctl : 8 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/CTLFireability16867569265880506697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7863320667245554259.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.
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,285768,7.89909,164656,2,16715,5,399214,6,0,789,501774,0

Converting to forward existential form...Done !
original formula: AG((EG((EG(((s1<1)||(l2250<1))) * !(A(((s1>=1)&&(l2897>=1)) U ((p152>=1)&&(l0>=1)))))) * ((s1<1)||(l4116<1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((EG(((s1<1)||(l2250<1))) * !(!((E(!(((p152>=1)&&(l0>=1))) U (!(((s1>=1)&&(l2897>=1))) ...284
(forward)formula 0,0,7.91098,164656,1,0,8,399214,9,2,798,501774,1
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 296 transition count 592
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 296 transition count 592
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 149 place count 296 transition count 579
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 205 place count 240 transition count 497
Iterating global reduction 1 with 56 rules applied. Total rules applied 261 place count 240 transition count 497
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 277 place count 240 transition count 481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 319 place count 198 transition count 418
Iterating global reduction 2 with 42 rules applied. Total rules applied 361 place count 198 transition count 418
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 397 place count 198 transition count 382
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 413 place count 182 transition count 356
Iterating global reduction 3 with 16 rules applied. Total rules applied 429 place count 182 transition count 356
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 442 place count 182 transition count 343
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 452 place count 172 transition count 333
Iterating global reduction 4 with 10 rules applied. Total rules applied 462 place count 172 transition count 333
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 467 place count 172 transition count 328
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 472 place count 167 transition count 321
Iterating global reduction 5 with 5 rules applied. Total rules applied 477 place count 167 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 480 place count 167 transition count 318
Applied a total of 480 rules in 25 ms. Remains 167 /364 variables (removed 197) and now considering 318/891 (removed 573) transitions.
// Phase 1: matrix 318 rows 167 cols
[2025-05-30 11:56:39] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-30 11:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:40] [INFO ] State equation strengthened by 159 read => feed constraints.
[2025-05-30 11:56:40] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2025-05-30 11:56:40] [INFO ] Invariant cache hit.
[2025-05-30 11:56:40] [INFO ] State equation strengthened by 159 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/485 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 159/328 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/485 variables, and 328 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/485 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 159/328 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 317/645 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 645 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 167/364 places, 318/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61437 ms. Remains : 167/364 places, 318/891 transitions.
[2025-05-30 11:57:41] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:57:41] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:57:41] [INFO ] Input system was already deterministic with 318 transitions.
[2025-05-30 11:57:41] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:57:41] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:57:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2483832700545459205.gal : 10 ms
[2025-05-30 11:57:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5577100462828325033.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/CTLFireability2483832700545459205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5577100462828325033.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.
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,650634,16.1005,356420,2,35120,5,807655,6,0,986,932630,0

Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 11:58:11] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:58:11] [INFO ] Applying decomposition
[2025-05-30 11:58:11] [INFO ] Flatten gal took : 12 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/graph16258521388995472986.txt' '-o' '/tmp/graph16258521388995472986.bin' '-w' '/tmp/graph16258521388995472986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16258521388995472986.bin' '-l' '-1' '-v' '-w' '/tmp/graph16258521388995472986.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:58:11] [INFO ] Decomposing Gal with order
[2025-05-30 11:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:58:11] [INFO ] Removed a total of 365 redundant transitions.
[2025-05-30 11:58:11] [INFO ] Flatten gal took : 110 ms
[2025-05-30 11:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 311 labels/synchronizations in 28 ms.
[2025-05-30 11:58:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7255616202349402278.gal : 11 ms
[2025-05-30 11:58:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3949647202748693606.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/CTLFireability7255616202349402278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3949647202748693606.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,650634,6.63832,177944,3210,1569,222442,47573,712,962412,289,246340,0

Converting to forward existential form...Done !
original formula: AX((EG(((EX(((i0.u1.s1>=1)&&(i5.u21.l4105>=1))) + AX(((i0.u1.s1>=1)&&(i6.u22.l3843>=1)))) * ((AF(((i0.u1.s1>=1)&&(i0.u1.l2895>=1))) + (((...591
=> equivalent forward existential formula: ([(EY((EY(Init) * !(EG(((EX(((i0.u1.s1>=1)&&(i5.u21.l4105>=1))) + !(EX(!(((i0.u1.s1>=1)&&(i6.u22.l3843>=1)))))) ...978
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t24, t26, t91, t92, t94, t107, t108, t110, t116, t127, t156, t164, t166, t170, t171,...837
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,15.6455,353872,1,0,326899,75391,3223,2.75987e+06,1490,407093,949357
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 283 transition count 518
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 283 transition count 518
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 178 place count 283 transition count 502
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 242 place count 219 transition count 412
Iterating global reduction 1 with 64 rules applied. Total rules applied 306 place count 219 transition count 412
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 325 place count 219 transition count 393
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 374 place count 170 transition count 319
Iterating global reduction 2 with 49 rules applied. Total rules applied 423 place count 170 transition count 319
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 458 place count 170 transition count 284
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 476 place count 152 transition count 251
Iterating global reduction 3 with 18 rules applied. Total rules applied 494 place count 152 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 499 place count 152 transition count 246
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 512 place count 139 transition count 233
Iterating global reduction 4 with 13 rules applied. Total rules applied 525 place count 139 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 529 place count 139 transition count 229
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 539 place count 129 transition count 206
Iterating global reduction 5 with 10 rules applied. Total rules applied 549 place count 129 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 555 place count 129 transition count 200
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 558 place count 126 transition count 180
Iterating global reduction 6 with 3 rules applied. Total rules applied 561 place count 126 transition count 180
Applied a total of 561 rules in 24 ms. Remains 126 /364 variables (removed 238) and now considering 180/891 (removed 711) transitions.
// Phase 1: matrix 180 rows 126 cols
[2025-05-30 11:58:27] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:27] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-30 11:58:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:27] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 11:58:28] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-30 11:58:28] [INFO ] Invariant cache hit.
[2025-05-30 11:58:28] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:39] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 189 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/306 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 179/368 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 368 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 126/364 places, 180/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 126/364 places, 180/891 transitions.
[2025-05-30 11:59:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:28] [INFO ] Input system was already deterministic with 180 transitions.
[2025-05-30 11:59:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1503608431515181162.gal : 2 ms
[2025-05-30 11:59:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14836694764509074490.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/CTLFireability1503608431515181162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14836694764509074490.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.
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,191026,3.42324,87996,2,11033,5,236471,6,0,684,272158,0

Converting to forward existential form...Done !
original formula: EF(EX(AG(AF(((s1>=1)&&(l1623>=1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(!(EG(!(((s1>=1)&&(l1623>=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t75, t76, t77, t85, t86, t90, t91, t92, t94, t95, t96, t98, t...577
(forward)formula 0,0,12.5731,298956,1,0,387,1.44079e+06,388,160,4962,729833,484
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 284 transition count 541
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 284 transition count 541
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 179 place count 284 transition count 522
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 242 place count 221 transition count 433
Iterating global reduction 1 with 63 rules applied. Total rules applied 305 place count 221 transition count 433
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 325 place count 221 transition count 413
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 373 place count 173 transition count 341
Iterating global reduction 2 with 48 rules applied. Total rules applied 421 place count 173 transition count 341
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 460 place count 173 transition count 302
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 477 place count 156 transition count 270
Iterating global reduction 3 with 17 rules applied. Total rules applied 494 place count 156 transition count 270
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 503 place count 156 transition count 261
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 515 place count 144 transition count 249
Iterating global reduction 4 with 12 rules applied. Total rules applied 527 place count 144 transition count 249
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 530 place count 144 transition count 246
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 541 place count 133 transition count 216
Iterating global reduction 5 with 11 rules applied. Total rules applied 552 place count 133 transition count 216
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 559 place count 133 transition count 209
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 561 place count 131 transition count 196
Iterating global reduction 6 with 2 rules applied. Total rules applied 563 place count 131 transition count 196
Applied a total of 563 rules in 23 ms. Remains 131 /364 variables (removed 233) and now considering 196/891 (removed 695) transitions.
// Phase 1: matrix 196 rows 131 cols
[2025-05-30 11:59:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:41] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-30 11:59:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-30 11:59:42] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-05-30 11:59:42] [INFO ] Invariant cache hit.
[2025-05-30 11:59:42] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/327 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 72/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/327 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 72/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47273ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 47276ms
Starting structural reductions in LTL mode, iteration 1 : 131/364 places, 196/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48687 ms. Remains : 131/364 places, 196/891 transitions.
[2025-05-30 12:00:29] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:00:29] [INFO ] Flatten gal took : 15 ms
[2025-05-30 12:00:29] [INFO ] Input system was already deterministic with 196 transitions.
[2025-05-30 12:00:29] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:00:29] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:00:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14044356907464513415.gal : 2 ms
[2025-05-30 12:00:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6842087739573845147.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/CTLFireability14044356907464513415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6842087739573845147.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.
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,236974,4.21476,100012,2,12836,5,259119,6,0,720,334321,0

Converting to forward existential form...Done !
original formula: AG((!(E(((s1>=1)&&(l3079>=1)) U ((s1>=1)&&(l4111>=1)))) + AX(((s1<1)||(l3080<1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E(((s1>=1)&&(l3079>=1)) U ((s1>=1)&&(l4111>=1))))))) * !(((s1<1)||(l3080<1))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t84, t88, t89, t90, t91, t92, t93, t94, t...652
(forward)formula 0,1,8.61033,161720,1,0,336,540338,414,134,5143,334321,405
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 294 transition count 578
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 294 transition count 578
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 159 place count 294 transition count 559
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 213 place count 240 transition count 485
Iterating global reduction 1 with 54 rules applied. Total rules applied 267 place count 240 transition count 485
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 283 place count 240 transition count 469
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 324 place count 199 transition count 406
Iterating global reduction 2 with 41 rules applied. Total rules applied 365 place count 199 transition count 406
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 401 place count 199 transition count 370
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 415 place count 185 transition count 347
Iterating global reduction 3 with 14 rules applied. Total rules applied 429 place count 185 transition count 347
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 439 place count 185 transition count 337
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 449 place count 175 transition count 327
Iterating global reduction 4 with 10 rules applied. Total rules applied 459 place count 175 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 463 place count 175 transition count 323
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 470 place count 168 transition count 310
Iterating global reduction 5 with 7 rules applied. Total rules applied 477 place count 168 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 479 place count 168 transition count 308
Applied a total of 479 rules in 20 ms. Remains 168 /364 variables (removed 196) and now considering 308/891 (removed 583) transitions.
// Phase 1: matrix 308 rows 168 cols
[2025-05-30 12:00:38] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:38] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 12:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-05-30 12:00:40] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-05-30 12:00:40] [INFO ] Invariant cache hit.
[2025-05-30 12:00:40] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/476 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 147/317 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:05] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:06] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:06] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 321 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/476 variables, 168/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 147/321 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 307/628 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 628 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 168/364 places, 308/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62173 ms. Remains : 168/364 places, 308/891 transitions.
[2025-05-30 12:01:40] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:01:40] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:01:40] [INFO ] Input system was already deterministic with 308 transitions.
[2025-05-30 12:01:40] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:01:40] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:01:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11114143983256230503.gal : 5 ms
[2025-05-30 12:01:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15926139299001939438.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/CTLFireability11114143983256230503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15926139299001939438.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.
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,592002,18.0291,392184,2,37512,5,953518,6,0,980,992855,0

Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:02:11] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:02:11] [INFO ] Applying decomposition
[2025-05-30 12:02:11] [INFO ] Flatten gal took : 12 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/graph3668249909929748071.txt' '-o' '/tmp/graph3668249909929748071.bin' '-w' '/tmp/graph3668249909929748071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3668249909929748071.bin' '-l' '-1' '-v' '-w' '/tmp/graph3668249909929748071.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:02:11] [INFO ] Decomposing Gal with order
[2025-05-30 12:02:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:02:11] [INFO ] Removed a total of 250 redundant transitions.
[2025-05-30 12:02:11] [INFO ] Flatten gal took : 39 ms
[2025-05-30 12:02:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 13 ms.
[2025-05-30 12:02:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17411298029553616219.gal : 3 ms
[2025-05-30 12:02:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4800958242624992131.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/CTLFireability17411298029553616219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4800958242624992131.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,592002,5.62795,155760,1696,4216,62293,54134,574,1.18057e+06,480,782070,0

Converting to forward existential form...Done !
original formula: A(AX(((!(EG(((i0.u0.s1>=1)&&(i6.u19.l3825>=1)))) + A(AX(((i3.u5.p206>=1)&&(i3.u1.l0>=1))) U ((i0.u0.s1>=1)&&(i7.u18.l4106>=1)))) + A(((((...506
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U (((!((i0.u0.p60>=1)&&(i3.u1.l0>=1)))||((i0.u0.s1>=1)&&(i6.u19.l4263>=1)))||((i7.u13...1498
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t80, t133, t161, t166, t198, t199, t202, t203, t204, t206, t208, t219, t225, t232, t2...1436
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,12.6708,254636,1,0,95582,174515,2950,1.73344e+06,2782,1.35028e+06,355089
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-06 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 : 364/364 places, 891/891 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 285 transition count 544
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 285 transition count 544
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 178 place count 285 transition count 524
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 241 place count 222 transition count 435
Iterating global reduction 1 with 63 rules applied. Total rules applied 304 place count 222 transition count 435
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 325 place count 222 transition count 414
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 373 place count 174 transition count 342
Iterating global reduction 2 with 48 rules applied. Total rules applied 421 place count 174 transition count 342
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 458 place count 174 transition count 305
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 476 place count 156 transition count 272
Iterating global reduction 3 with 18 rules applied. Total rules applied 494 place count 156 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 503 place count 156 transition count 263
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 515 place count 144 transition count 251
Iterating global reduction 4 with 12 rules applied. Total rules applied 527 place count 144 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 531 place count 144 transition count 247
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 540 place count 135 transition count 226
Iterating global reduction 5 with 9 rules applied. Total rules applied 549 place count 135 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 554 place count 135 transition count 221
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 556 place count 133 transition count 208
Iterating global reduction 6 with 2 rules applied. Total rules applied 558 place count 133 transition count 208
Applied a total of 558 rules in 31 ms. Remains 133 /364 variables (removed 231) and now considering 208/891 (removed 683) transitions.
// Phase 1: matrix 208 rows 133 cols
[2025-05-30 12:02:24] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:24] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 12:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:24] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-30 12:02:25] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-05-30 12:02:25] [INFO ] Invariant cache hit.
[2025-05-30 12:02:25] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/341 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 82/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 217 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17822 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/341 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 82/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 207/424 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 424 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48032ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 48034ms
Starting structural reductions in LTL mode, iteration 1 : 133/364 places, 208/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49255 ms. Remains : 133/364 places, 208/891 transitions.
[2025-05-30 12:03:13] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:03:13] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:03:13] [INFO ] Input system was already deterministic with 208 transitions.
[2025-05-30 12:03:13] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:03:13] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:03:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15649758600996525687.gal : 2 ms
[2025-05-30 12:03:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12914010340872834299.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/CTLFireability15649758600996525687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12914010340872834299.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.
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,244226,4.73579,119308,2,14076,5,312402,6,0,740,385616,0

Converting to forward existential form...Done !
original formula: AF(((EF(((s1>=1)&&(l4106>=1))) * ((s1<1)||(l3077<1))) * (EX(((s1>=1)&&(l1666>=1))) + AG(((s1>=1)&&(l3079>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((s1>=1)&&(l4106>=1))) * ((s1<1)||(l3077<1))) * (EX(((s1>=1)&&(l1666>=1))) + !(E(TRUE U ...194
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t70, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t...749
(forward)formula 0,0,21.8233,479496,1,0,562,1.79915e+06,447,294,5394,1.49638e+06,637
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 283 transition count 527
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 283 transition count 527
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 181 place count 283 transition count 508
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 244 place count 220 transition count 419
Iterating global reduction 1 with 63 rules applied. Total rules applied 307 place count 220 transition count 419
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 326 place count 220 transition count 400
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 374 place count 172 transition count 328
Iterating global reduction 2 with 48 rules applied. Total rules applied 422 place count 172 transition count 328
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 457 place count 172 transition count 293
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 475 place count 154 transition count 260
Iterating global reduction 3 with 18 rules applied. Total rules applied 493 place count 154 transition count 260
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 502 place count 154 transition count 251
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 514 place count 142 transition count 239
Iterating global reduction 4 with 12 rules applied. Total rules applied 526 place count 142 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 530 place count 142 transition count 235
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 540 place count 132 transition count 206
Iterating global reduction 5 with 10 rules applied. Total rules applied 550 place count 132 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 555 place count 132 transition count 201
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 558 place count 129 transition count 181
Iterating global reduction 6 with 3 rules applied. Total rules applied 561 place count 129 transition count 181
Applied a total of 561 rules in 49 ms. Remains 129 /364 variables (removed 235) and now considering 181/891 (removed 710) transitions.
// Phase 1: matrix 181 rows 129 cols
[2025-05-30 12:03:35] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:35] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-30 12:03:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 12:03:36] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:03:36] [INFO ] Redundant transitions in 13 ms returned []
Running 180 sub problems to find dead transitions.
[2025-05-30 12:03:36] [INFO ] Invariant cache hit.
[2025-05-30 12:03:36] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/310 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:46] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:46] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/310 variables, and 190 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/310 variables, 129/133 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 57/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 180/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 370 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 129/364 places, 181/891 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61079 ms. Remains : 129/364 places, 181/891 transitions.
[2025-05-30 12:04:36] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:04:36] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:04:36] [INFO ] Input system was already deterministic with 181 transitions.
[2025-05-30 12:04:36] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:04:36] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:04:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality294046101225083301.gal : 3 ms
[2025-05-30 12:04:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15731911163529648009.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality294046101225083301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15731911163529648009.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (9155 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (1818 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15731911163529648009.prop.
Finished probabilistic random walk after 21055 steps, run visited all 1 properties in 69 ms. (steps per millisecond=305 )
Probabilistic random walk after 21055 steps, saw 10353 distinct states, run finished after 78 ms. (steps per millisecond=269 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 286 transition count 550
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 286 transition count 550
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 178 place count 286 transition count 528
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 239 place count 225 transition count 444
Iterating global reduction 1 with 61 rules applied. Total rules applied 300 place count 225 transition count 444
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 321 place count 225 transition count 423
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 367 place count 179 transition count 353
Iterating global reduction 2 with 46 rules applied. Total rules applied 413 place count 179 transition count 353
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 450 place count 179 transition count 316
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 465 place count 164 transition count 290
Iterating global reduction 3 with 15 rules applied. Total rules applied 480 place count 164 transition count 290
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 489 place count 164 transition count 281
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 499 place count 154 transition count 271
Iterating global reduction 4 with 10 rules applied. Total rules applied 509 place count 154 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 512 place count 154 transition count 268
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 521 place count 145 transition count 241
Iterating global reduction 5 with 9 rules applied. Total rules applied 530 place count 145 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 536 place count 145 transition count 235
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 539 place count 142 transition count 215
Iterating global reduction 6 with 3 rules applied. Total rules applied 542 place count 142 transition count 215
Applied a total of 542 rules in 37 ms. Remains 142 /364 variables (removed 222) and now considering 215/891 (removed 676) transitions.
// Phase 1: matrix 215 rows 142 cols
[2025-05-30 12:04:36] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:36] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 12:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-05-30 12:04:38] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-05-30 12:04:38] [INFO ] Invariant cache hit.
[2025-05-30 12:04:38] [INFO ] State equation strengthened by 77 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/357 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 77/221 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/357 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 221 constraints, problems are : Problem set: 0 solved, 214 unsolved in 22957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/357 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 77/221 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 214/435 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 435 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53154ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 53155ms
Starting structural reductions in LTL mode, iteration 1 : 142/364 places, 215/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54909 ms. Remains : 142/364 places, 215/891 transitions.
[2025-05-30 12:05:31] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:05:31] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:05:31] [INFO ] Input system was already deterministic with 215 transitions.
[2025-05-30 12:05:31] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:05:31] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:05:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12607161551062899065.gal : 2 ms
[2025-05-30 12:05:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5648505501566416054.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/CTLFireability12607161551062899065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5648505501566416054.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.
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,346264,8.3728,181256,2,23542,5,449893,6,0,783,596501,0

Converting to forward existential form...Done !
original formula: AG((EG(EX(((EG(((s1>=1)&&(l3077>=1))) + (s1<1)) + (l4135<1)))) + EG(AX(!(A(((p275>=1)&&(l3102>=1)) U ((s1>=1)&&(l4114>=1))))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX(!(!(!((E(!(((s1>=1)&&(l4114>=1))) U (!(((p275>=1)&&(l3102>=1))) * !(((s1>=1)&&(l4...280
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t40, t42, t43, t74, t75, t79, t80, t81, t82, t83, t84, t85, t86, t87, t...820
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-30 12:06:01] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:06:01] [INFO ] Applying decomposition
[2025-05-30 12:06:01] [INFO ] Flatten gal took : 7 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/graph6329068688594722624.txt' '-o' '/tmp/graph6329068688594722624.bin' '-w' '/tmp/graph6329068688594722624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6329068688594722624.bin' '-l' '-1' '-v' '-w' '/tmp/graph6329068688594722624.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:06:01] [INFO ] Decomposing Gal with order
[2025-05-30 12:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:06:01] [INFO ] Removed a total of 224 redundant transitions.
[2025-05-30 12:06:01] [INFO ] Flatten gal took : 31 ms
[2025-05-30 12:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 11 ms.
[2025-05-30 12:06:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4875235302616920970.gal : 5 ms
[2025-05-30 12:06:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3524967295670344342.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/CTLFireability4875235302616920970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3524967295670344342.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,346264,0.940353,29000,1496,1000,27831,12334,583,92070,224,119290,0

Converting to forward existential form...Done !
original formula: AG((EG(EX(((EG(((i4.u2.s1>=1)&&(i5.u14.l3077>=1))) + (i4.u2.s1<1)) + (i1.u21.l4135<1)))) + EG(AX(!(A(((i3.u6.p275>=1)&&(i3.u6.l3102>=1)) ...197
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX(!(!(!((E(!(((i4.u2.s1>=1)&&(i8.u20.l4114>=1))) U (!(((i3.u6.p275>=1)&&(i3.u6.l310...357
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t40, t52, t73, t75, t78, t81, t99, t111, t113, t115, t131, t135, t137, t138, t13...711
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,3.56669,107464,1,0,112776,33463,2529,522293,1217,382855,323620
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 290 transition count 578
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 290 transition count 578
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 173 place count 290 transition count 553
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 232 place count 231 transition count 472
Iterating global reduction 1 with 59 rules applied. Total rules applied 291 place count 231 transition count 472
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 312 place count 231 transition count 451
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 357 place count 186 transition count 383
Iterating global reduction 2 with 45 rules applied. Total rules applied 402 place count 186 transition count 383
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 443 place count 186 transition count 342
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 457 place count 172 transition count 314
Iterating global reduction 3 with 14 rules applied. Total rules applied 471 place count 172 transition count 314
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 481 place count 172 transition count 304
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 490 place count 163 transition count 295
Iterating global reduction 4 with 9 rules applied. Total rules applied 499 place count 163 transition count 295
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 506 place count 156 transition count 286
Iterating global reduction 4 with 7 rules applied. Total rules applied 513 place count 156 transition count 286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 518 place count 156 transition count 281
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 520 place count 154 transition count 268
Iterating global reduction 5 with 2 rules applied. Total rules applied 522 place count 154 transition count 268
Applied a total of 522 rules in 23 ms. Remains 154 /364 variables (removed 210) and now considering 268/891 (removed 623) transitions.
// Phase 1: matrix 268 rows 154 cols
[2025-05-30 12:06:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:05] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-30 12:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:05] [INFO ] State equation strengthened by 124 read => feed constraints.
[2025-05-30 12:06:06] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-05-30 12:06:06] [INFO ] Invariant cache hit.
[2025-05-30 12:06:06] [INFO ] State equation strengthened by 124 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/422 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 124/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 280 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/422 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 124/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 267/547 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 547 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in LTL mode, iteration 1 : 154/364 places, 268/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61454 ms. Remains : 154/364 places, 268/891 transitions.
[2025-05-30 12:07:06] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:07:06] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:07:06] [INFO ] Input system was already deterministic with 268 transitions.
[2025-05-30 12:07:06] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:07:06] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:07:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13358366509785571972.gal : 3 ms
[2025-05-30 12:07:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14816278634901163815.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/CTLFireability13358366509785571972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14816278634901163815.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.
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,407802,9.70882,218576,2,25899,5,537801,6,0,884,571720,0

Converting to forward existential form...Done !
original formula: E(((EX(E((((s1>=1)&&(l3076>=1))||((s1>=1)&&(l3079>=1))) U !(((s1>=1)&&(l3>=1))))) + AG(((((p314>=1)&&(l3101>=1)) + AG(((p356>=1)&&(l2273>...397
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((EX(E((((s1>=1)&&(l3076>=1))||((s1>=1)&&(l3079>=1))) U !(((s1>=1)&&(l3>=1))))) + !(E(TRUE U !(...557
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t54, t55, t56, t75, t76, t80, t81, t82, t83, t84, t85, t86, t87, t88, t...1005
(forward)formula 0,0,23.8845,472572,1,0,505,1.51686e+06,569,195,6472,737935,631
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 291 transition count 564
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 291 transition count 564
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 167 place count 291 transition count 543
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 224 place count 234 transition count 464
Iterating global reduction 1 with 57 rules applied. Total rules applied 281 place count 234 transition count 464
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 301 place count 234 transition count 444
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 344 place count 191 transition count 378
Iterating global reduction 2 with 43 rules applied. Total rules applied 387 place count 191 transition count 378
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 420 place count 191 transition count 345
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 436 place count 175 transition count 314
Iterating global reduction 3 with 16 rules applied. Total rules applied 452 place count 175 transition count 314
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 464 place count 175 transition count 302
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 475 place count 164 transition count 291
Iterating global reduction 4 with 11 rules applied. Total rules applied 486 place count 164 transition count 291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 490 place count 164 transition count 287
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 498 place count 156 transition count 273
Iterating global reduction 5 with 8 rules applied. Total rules applied 506 place count 156 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 511 place count 156 transition count 268
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 512 place count 155 transition count 263
Iterating global reduction 6 with 1 rules applied. Total rules applied 513 place count 155 transition count 263
Applied a total of 513 rules in 28 ms. Remains 155 /364 variables (removed 209) and now considering 263/891 (removed 628) transitions.
// Phase 1: matrix 263 rows 155 cols
[2025-05-30 12:07:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:31] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-30 12:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:31] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-30 12:07:32] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-05-30 12:07:32] [INFO ] Invariant cache hit.
[2025-05-30 12:07:32] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/418 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 110/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 267 constraints, problems are : Problem set: 0 solved, 262 unsolved in 29964 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/418 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 110/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 262/529 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 529 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 155/364 places, 263/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61558 ms. Remains : 155/364 places, 263/891 transitions.
[2025-05-30 12:08:32] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:08:32] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:08:32] [INFO ] Input system was already deterministic with 263 transitions.
[2025-05-30 12:08:32] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:08:32] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:08:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4692085751707688765.gal : 2 ms
[2025-05-30 12:08:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11408713812079499558.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/CTLFireability4692085751707688765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11408713812079499558.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.
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,462249,22.6997,438084,2,29733,5,1.07814e+06,6,0,883,1.28195e+06,0

Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:09:02] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:09:02] [INFO ] Applying decomposition
[2025-05-30 12:09:02] [INFO ] Flatten gal took : 7 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/graph8234534355622666721.txt' '-o' '/tmp/graph8234534355622666721.bin' '-w' '/tmp/graph8234534355622666721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8234534355622666721.bin' '-l' '-1' '-v' '-w' '/tmp/graph8234534355622666721.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:09:02] [INFO ] Decomposing Gal with order
[2025-05-30 12:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:09:02] [INFO ] Removed a total of 278 redundant transitions.
[2025-05-30 12:09:02] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:09:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 10 ms.
[2025-05-30 12:09:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15795874716812626463.gal : 2 ms
[2025-05-30 12:09:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6141292260917517700.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/CTLFireability15795874716812626463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6141292260917517700.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,462249,6.13346,153820,2651,3717,83439,104209,543,872643,263,978488,0

Converting to forward existential form...Done !
original formula: AG((!(E((((i6.u1.s1>=1)&&(i6.u1.l4313>=1))||((i6.u1.s1>=1)&&(i6.u12.l2673>=1))) U ((AX(((i6.u1.s1>=1)&&(i0.u19.l4109>=1))) + (((i6.u1.s1>...537
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(Init,TRUE) * !(!(E((((i6.u1.s1>=1)&&(i6.u1.l4313>=1))||((i6.u1.s1>=1)&&(i6.u12.l2673>=1))) U ((...1092
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t19, t21, t75, t95, t116, t117, t129, t132, t133, t134, t135, t142, t150, t163, t183...817
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,20.4923,517576,1,0,164447,175367,2633,4.29234e+06,1480,2.73328e+06,575508
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 286 transition count 546
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 286 transition count 546
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 172 place count 286 transition count 530
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 234 place count 224 transition count 442
Iterating global reduction 1 with 62 rules applied. Total rules applied 296 place count 224 transition count 442
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 316 place count 224 transition count 422
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 363 place count 177 transition count 350
Iterating global reduction 2 with 47 rules applied. Total rules applied 410 place count 177 transition count 350
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 449 place count 177 transition count 311
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 465 place count 161 transition count 285
Iterating global reduction 3 with 16 rules applied. Total rules applied 481 place count 161 transition count 285
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 486 place count 161 transition count 280
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 497 place count 150 transition count 269
Iterating global reduction 4 with 11 rules applied. Total rules applied 508 place count 150 transition count 269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 512 place count 150 transition count 265
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 521 place count 141 transition count 237
Iterating global reduction 5 with 9 rules applied. Total rules applied 530 place count 141 transition count 237
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 535 place count 141 transition count 232
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 537 place count 139 transition count 219
Iterating global reduction 6 with 2 rules applied. Total rules applied 539 place count 139 transition count 219
Applied a total of 539 rules in 23 ms. Remains 139 /364 variables (removed 225) and now considering 219/891 (removed 672) transitions.
// Phase 1: matrix 219 rows 139 cols
[2025-05-30 12:09:23] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-30 12:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:23] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 12:09:24] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 12:09:24] [INFO ] Invariant cache hit.
[2025-05-30 12:09:24] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/358 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 86/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 227 constraints, problems are : Problem set: 0 solved, 218 unsolved in 23624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/358 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 86/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 218/445 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 445 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53757ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 53758ms
Starting structural reductions in LTL mode, iteration 1 : 139/364 places, 219/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54831 ms. Remains : 139/364 places, 219/891 transitions.
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:10:18] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:10:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9466021207939694760.gal : 2 ms
[2025-05-30 12:10:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10328839300881198898.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/CTLFireability9466021207939694760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10328839300881198898.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.
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,411806,9.53275,197012,2,20564,5,487934,6,0,775,686342,0

Converting to forward existential form...Done !
original formula: EX(A(!(((s1>=1)&&(l4281>=1))) U !((AF(((s1>=1)&&(l1678>=1))) + ((E(((s1>=1)&&(l1>=1)) U ((s1>=1)&&(l4129>=1))) * (s1>=1)) * (l3080>=1))))...157
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((!(EG(!(((s1>=1)&&(l1678>=1))))) + ((E(((s1>=1)&&(l1>=1)) U ((s1>=1)&&(l4129>=1))) * (s1>...462
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t69, t70, t74, t75, t76, t84, t85, t87, t88, t89, t90, t91, t92, t...818
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-30 12:10:48] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:10:48] [INFO ] Applying decomposition
[2025-05-30 12:10:48] [INFO ] Flatten gal took : 6 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/graph16306357893503038601.txt' '-o' '/tmp/graph16306357893503038601.bin' '-w' '/tmp/graph16306357893503038601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16306357893503038601.bin' '-l' '-1' '-v' '-w' '/tmp/graph16306357893503038601.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:10:48] [INFO ] Decomposing Gal with order
[2025-05-30 12:10:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:10:48] [INFO ] Removed a total of 224 redundant transitions.
[2025-05-30 12:10:48] [INFO ] Flatten gal took : 25 ms
[2025-05-30 12:10:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 13 ms.
[2025-05-30 12:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14874911033396726817.gal : 3 ms
[2025-05-30 12:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3700015960953240693.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/CTLFireability14874911033396726817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3700015960953240693.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,411806,1.4645,38700,1379,1560,33839,17442,499,158145,288,116606,0

Converting to forward existential form...Done !
original formula: EX(A(!(((i0.u1.s1>=1)&&(i7.u19.l4281>=1))) U !((AF(((i0.u1.s1>=1)&&(u9.l1678>=1))) + ((E(((i0.u1.s1>=1)&&(i1.u2.l1>=1)) U ((i0.u1.s1>=1)&...213
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((!(EG(!(((i0.u1.s1>=1)&&(u9.l1678>=1))))) + ((E(((i0.u1.s1>=1)&&(i1.u2.l1>=1)) U ((i0.u1....604
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t18, t68, t80, t115, t117, t133, t135, t136, t139, t140, t141, t145, t147, t149,...658
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,6.92573,166060,1,0,160868,72788,2323,942691,1569,479815,407700
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 891/891 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 283 transition count 527
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 283 transition count 527
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 181 place count 283 transition count 508
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 243 place count 221 transition count 420
Iterating global reduction 1 with 62 rules applied. Total rules applied 305 place count 221 transition count 420
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 324 place count 221 transition count 401
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 370 place count 175 transition count 333
Iterating global reduction 2 with 46 rules applied. Total rules applied 416 place count 175 transition count 333
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 449 place count 175 transition count 300
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 466 place count 158 transition count 268
Iterating global reduction 3 with 17 rules applied. Total rules applied 483 place count 158 transition count 268
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 492 place count 158 transition count 259
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 502 place count 148 transition count 249
Iterating global reduction 4 with 10 rules applied. Total rules applied 512 place count 148 transition count 249
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 515 place count 148 transition count 246
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 524 place count 139 transition count 218
Iterating global reduction 5 with 9 rules applied. Total rules applied 533 place count 139 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 536 place count 139 transition count 215
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 539 place count 136 transition count 195
Iterating global reduction 6 with 3 rules applied. Total rules applied 542 place count 136 transition count 195
Applied a total of 542 rules in 17 ms. Remains 136 /364 variables (removed 228) and now considering 195/891 (removed 696) transitions.
// Phase 1: matrix 195 rows 136 cols
[2025-05-30 12:10:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:55] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-30 12:10:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 12:10:56] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-05-30 12:10:56] [INFO ] Invariant cache hit.
[2025-05-30 12:10:56] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/331 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 61/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:09] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 331/331 variables, and 200 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/331 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 61/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 194/394 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 394 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 136/364 places, 195/891 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61493 ms. Remains : 136/364 places, 195/891 transitions.
[2025-05-30 12:11:56] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:11:56] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:11:56] [INFO ] Input system was already deterministic with 195 transitions.
[2025-05-30 12:11:56] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:11:56] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:11:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16608454349245791116.gal : 1 ms
[2025-05-30 12:11:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5086951688123995651.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/CTLFireability16608454349245791116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5086951688123995651.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.
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,332510,6.55683,155392,2,16085,5,382627,6,0,739,581879,0

Converting to forward existential form...Done !
original formula: EF((EX(EG((((s1<1)||(l4112<1))&&((s1<1)||(l3675<1))))) * EF(EX(((p342>=1)&&(l2273>=1))))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU(Init,TRUE) * EX(EG((((s1<1)||(l4112<1))&&((s1<1)||(l3675<1)))))),TRUE)) * ((p342>=1)&&(l2273>=1)...167
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t95, t96, t98, t...650
(forward)formula 0,1,22.4791,453736,1,0,452,2.04092e+06,414,182,5449,1.18022e+06,526
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 12:12:19] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:12:19] [INFO ] Flatten gal took : 22 ms
Total runtime 1074692 ms.

BK_STOP 1748607139666

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="DBSingleClientW-PT-d2m05"
export BK_EXAMINATION="CTLFireability"
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 DBSingleClientW-PT-d2m05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063600122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;