About the Execution of ITS-Tools for DBSingleClientW-PT-d0m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ????TF???????FT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063400050.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-d0m10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063400050
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 119K 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-d0m10-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748562026197
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-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 23:40:28] [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-29 23:40:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:40:29] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2025-05-29 23:40:29] [INFO ] Transformed 553 places.
[2025-05-29 23:40:29] [INFO ] Transformed 150 transitions.
[2025-05-29 23:40:29] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Deduced a syphon composed of 444 places in 5 ms
Reduce places removed 444 places and 0 transitions.
Support contains 66 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 97 transition count 134
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 97 transition count 134
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 95 transition count 132
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 95 transition count 132
Applied a total of 32 rules in 44 ms. Remains 95 /109 variables (removed 14) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 95 cols
[2025-05-29 23:40:29] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:30] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-05-29 23:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-29 23:40:30] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-05-29 23:40:30] [INFO ] Invariant cache hit.
[2025-05-29 23:40:30] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/227 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 59/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 156 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/227 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 59/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 131/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 287 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39731ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 39754ms
Starting structural reductions in LTL mode, iteration 1 : 95/109 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40555 ms. Remains : 95/109 places, 132/150 transitions.
Support contains 66 out of 95 places after structural reductions.
[2025-05-29 23:41:10] [INFO ] Flatten gal took : 109 ms
[2025-05-29 23:41:10] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:41:10] [INFO ] Input system was already deterministic with 132 transitions.
Reduction of identical properties reduced properties to check from 75 to 68
RANDOM walk for 40000 steps (9080 resets) in 3258 ms. (12 steps per ms) remains 36/68 properties
BEST_FIRST walk for 4002 steps (192 resets) in 93 ms. (42 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (197 resets) in 110 ms. (36 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (193 resets) in 69 ms. (57 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (196 resets) in 99 ms. (40 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (197 resets) in 55 ms. (71 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (214 resets) in 25 ms. (153 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4003 steps (398 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (194 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (198 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (191 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (194 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (203 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (421 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (186 resets) in 77 ms. (51 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4000 steps (800 resets) in 70 ms. (56 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (213 resets) in 48 ms. (81 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (419 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (193 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (178 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (418 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (188 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (411 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (500 resets) in 28 ms. (137 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (408 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (401 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (617 resets) in 78 ms. (50 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (200 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (198 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (177 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (206 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (193 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (140 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
[2025-05-29 23:41:12] [INFO ] Invariant cache hit.
[2025-05-29 23:41:12] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/65 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 17/82 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 128/210 variables, 82/84 constraints. Problems are: Problem set: 5 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 55/139 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/139 constraints. Problems are: Problem set: 5 solved, 27 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/227 variables, 13/152 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 4/156 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/156 constraints. Problems are: Problem set: 6 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:14] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:14] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/227 variables, 2/158 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/158 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/158 constraints. Problems are: Problem set: 6 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 158 constraints, problems are : Problem set: 6 solved, 26 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 28/60 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 21/81 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 128/209 variables, 81/83 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 55/138 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 6/144 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 18/227 variables, 14/158 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 4/162 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 20/182 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 2/184 constraints. Problems are: Problem set: 6 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/184 constraints. Problems are: Problem set: 6 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 184 constraints, problems are : Problem set: 6 solved, 26 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 26/32 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8030ms problems are : Problem set: 6 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 89 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 89 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 88 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 88 transition count 125
Applied a total of 14 rules in 25 ms. Remains 88 /95 variables (removed 7) and now considering 125/132 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 88/95 places, 125/132 transitions.
RANDOM walk for 40000 steps (9243 resets) in 471 ms. (84 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (206 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (198 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (187 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (166 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (207 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (188 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (434 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (190 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (193 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (206 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (180 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (396 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (206 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (800 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (377 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (189 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (194 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (422 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (192 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (418 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (386 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (429 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (184 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (177 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (208 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (193 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 22288 steps, run visited all 26 properties in 228 ms. (steps per millisecond=97 )
Probabilistic random walk after 22288 steps, saw 10080 distinct states, run finished after 239 ms. (steps per millisecond=93 ) properties seen :26
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2025-05-29 23:41:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-29 23:41:21] [INFO ] Flatten gal took : 15 ms
FORMULA DBSingleClientW-PT-d0m10-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 23:41:21] [INFO ] Flatten gal took : 13 ms
[2025-05-29 23:41:21] [INFO ] Input system was already deterministic with 132 transitions.
Support contains 58 out of 95 places (down from 59) after GAL structural reductions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 321 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 80 transition count 101
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 80 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 80 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 73 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 73 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 73 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 72 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 72 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 71 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 70 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 70 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 84
Applied a total of 55 rules in 19 ms. Remains 70 /95 variables (removed 25) and now considering 84/132 (removed 48) transitions.
// Phase 1: matrix 84 rows 70 cols
[2025-05-29 23:41:21] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:41:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-29 23:41:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:41:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-29 23:41:21] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-05-29 23:41:21] [INFO ] Invariant cache hit.
[2025-05-29 23:41:21] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/154 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:23] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:24] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:26] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:26] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/154 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/154 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 104 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6505 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/154 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 83/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 187 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16951ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 16952ms
Starting structural reductions in LTL mode, iteration 1 : 70/95 places, 84/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17229 ms. Remains : 70/95 places, 84/132 transitions.
[2025-05-29 23:41:38] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:41:38] [INFO ] Flatten gal took : 9 ms
[2025-05-29 23:41:38] [INFO ] Input system was already deterministic with 84 transitions.
[2025-05-29 23:41:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:41:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:41:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17663859595874114117.gal : 4 ms
[2025-05-29 23:41:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14369399801526537986.ctl : 4 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/CTLFireability17663859595874114117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14369399801526537986.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,2.61024e+08,11.1333,215000,2,21676,5,863741,6,0,364,864470,0
Converting to forward existential form...Done !
original formula: EX(((EG(((((EG(((s1<1)||(l485<1))) * (s1>=1)) * (l504>=1)) + (p28<1)) + (l0<1))) * EF((((s1>=1)&&(l505>=1))||((s1>=1)&&(l345>=1))))) * ((...173
=> equivalent forward existential formula: [(FwdU(((EY(Init) * ((s1<1)||(l485<1))) * EG(((((EG(((s1<1)||(l485<1))) * (s1>=1)) * (l504>=1)) + (p28<1)) + (l0...225
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t50, t53, t54, t55, t60, t61, t62, t63, t64, t65, t66, t67, t68, t6...326
Detected timeout of ITS tools.
[2025-05-29 23:42:09] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:42:09] [INFO ] Applying decomposition
[2025-05-29 23:42:09] [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/graph1575383835339350807.txt' '-o' '/tmp/graph1575383835339350807.bin' '-w' '/tmp/graph1575383835339350807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1575383835339350807.bin' '-l' '-1' '-v' '-w' '/tmp/graph1575383835339350807.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:42:09] [INFO ] Decomposing Gal with order
[2025-05-29 23:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:42:09] [INFO ] Removed a total of 83 redundant transitions.
[2025-05-29 23:42:09] [INFO ] Flatten gal took : 93 ms
[2025-05-29 23:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 18 ms.
[2025-05-29 23:42:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15429323957112425722.gal : 8 ms
[2025-05-29 23:42:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5295858141742134578.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/CTLFireability15429323957112425722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5295858141742134578.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 77 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 68 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 64 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 64 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 63 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 63 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 63 transition count 76
Applied a total of 68 rules in 16 ms. Remains 63 /95 variables (removed 32) and now considering 76/132 (removed 56) transitions.
// Phase 1: matrix 76 rows 63 cols
[2025-05-29 23:42:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-29 23:42:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 23:42:39] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2025-05-29 23:42:39] [INFO ] Invariant cache hit.
[2025-05-29 23:42:39] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/139 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:41] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:42] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:42] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 92 constraints, problems are : Problem set: 0 solved, 75 unsolved in 3642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/139 variables, 63/68 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 75/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 167 constraints, problems are : Problem set: 0 solved, 75 unsolved in 13441 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17163ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 17164ms
Starting structural reductions in LTL mode, iteration 1 : 63/95 places, 76/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17586 ms. Remains : 63/95 places, 76/132 transitions.
[2025-05-29 23:42:57] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:42:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:42:57] [INFO ] Input system was already deterministic with 76 transitions.
[2025-05-29 23:42:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:42:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:42:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12033387691253978793.gal : 2 ms
[2025-05-29 23:42:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9798438596199295233.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/CTLFireability12033387691253978793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9798438596199295233.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,8.4626e+07,12.221,237300,2,20121,5,1.1249e+06,6,0,328,893237,0
Converting to forward existential form...Done !
original formula: EX(EG((AF(((s1>=1)&&(l354>=1))) * EG(((s1<1)||(l335<1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(EG(!(((s1>=1)&&(l354>=1))))) * EG(((s1<1)||(l335<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t42, t43, t44, t50, t55, t56, t57, t58, t59, t60, t61, t62, t63, t6...311
Detected timeout of ITS tools.
[2025-05-29 23:43:27] [INFO ] Flatten gal took : 10 ms
[2025-05-29 23:43:27] [INFO ] Applying decomposition
[2025-05-29 23:43:27] [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/graph8644505858590834136.txt' '-o' '/tmp/graph8644505858590834136.bin' '-w' '/tmp/graph8644505858590834136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8644505858590834136.bin' '-l' '-1' '-v' '-w' '/tmp/graph8644505858590834136.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:43:27] [INFO ] Decomposing Gal with order
[2025-05-29 23:43:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:43:27] [INFO ] Removed a total of 76 redundant transitions.
[2025-05-29 23:43:27] [INFO ] Flatten gal took : 14 ms
[2025-05-29 23:43:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2025-05-29 23:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2901127045031805804.gal : 4 ms
[2025-05-29 23:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5855908974840721128.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/CTLFireability2901127045031805804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5855908974840721128.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,8.4626e+07,17.5369,223512,2725,832,307934,35121,245,386419,68,185183,0
Converting to forward existential form...Done !
original formula: EX(EG((AF(((i4.u2.s1>=1)&&(i0.u1.l354>=1))) * EG(((i4.u2.s1<1)||(i6.u9.l335<1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(EG(!(((i4.u2.s1>=1)&&(i0.u1.l354>=1))))) * EG(((i4.u2.s1<1)||(i6.u9.l335<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t28, t42, t43, t44, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, ...303
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 81 transition count 110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 81 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 75 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 75 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 74 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 74 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 74 transition count 101
Applied a total of 43 rules in 20 ms. Remains 74 /95 variables (removed 21) and now considering 101/132 (removed 31) transitions.
// Phase 1: matrix 101 rows 74 cols
[2025-05-29 23:43:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:43:57] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-29 23:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:43:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 23:43:57] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-05-29 23:43:57] [INFO ] Invariant cache hit.
[2025-05-29 23:43:57] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/175 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 118 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/175 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 100/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 218 constraints, problems are : Problem set: 0 solved, 100 unsolved in 19136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23890ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 23890ms
Starting structural reductions in LTL mode, iteration 1 : 74/95 places, 101/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24278 ms. Remains : 74/95 places, 101/132 transitions.
[2025-05-29 23:44:21] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:44:21] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:44:21] [INFO ] Input system was already deterministic with 101 transitions.
[2025-05-29 23:44:21] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:44:21] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14879903133521906901.gal : 2 ms
[2025-05-29 23:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4767027222114516834.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/CTLFireability14879903133521906901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4767027222114516834.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:44:51] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:44:51] [INFO ] Applying decomposition
[2025-05-29 23:44:51] [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/graph5134225585002639809.txt' '-o' '/tmp/graph5134225585002639809.bin' '-w' '/tmp/graph5134225585002639809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5134225585002639809.bin' '-l' '-1' '-v' '-w' '/tmp/graph5134225585002639809.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:44:51] [INFO ] Decomposing Gal with order
[2025-05-29 23:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:44:51] [INFO ] Removed a total of 92 redundant transitions.
[2025-05-29 23:44:51] [INFO ] Flatten gal took : 16 ms
[2025-05-29 23:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 5 ms.
[2025-05-29 23:44:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9868337044443874666.gal : 3 ms
[2025-05-29 23:44:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16962674855102999601.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/CTLFireability9868337044443874666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16962674855102999601.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 78 transition count 100
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 78 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 71 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 69 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 69 transition count 87
Applied a total of 55 rules in 32 ms. Remains 69 /95 variables (removed 26) and now considering 87/132 (removed 45) transitions.
// Phase 1: matrix 87 rows 69 cols
[2025-05-29 23:45:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:45:21] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-29 23:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:45:22] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-29 23:45:22] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:45:22] [INFO ] Redundant transitions in 3 ms returned []
Running 86 sub problems to find dead transitions.
[2025-05-29 23:45:22] [INFO ] Invariant cache hit.
[2025-05-29 23:45:22] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/156 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:24] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 101 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/156 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 86/187 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 187 constraints, problems are : Problem set: 0 solved, 86 unsolved in 11321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14557ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 14560ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/95 places, 87/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14928 ms. Remains : 69/95 places, 87/132 transitions.
[2025-05-29 23:45:36] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:45:36] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:45:36] [INFO ] Input system was already deterministic with 87 transitions.
[2025-05-29 23:45:36] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:45:36] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:45:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4733335570129826723.gal : 2 ms
[2025-05-29 23:45:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7641375550385176647.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/CTLFireability4733335570129826723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7641375550385176647.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,2.05007e+08,27.4701,473988,2,32623,5,1.81809e+06,6,0,363,2.0568e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:46:06] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:46:06] [INFO ] Applying decomposition
[2025-05-29 23:46:06] [INFO ] Flatten gal took : 5 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/graph431140232240611822.txt' '-o' '/tmp/graph431140232240611822.bin' '-w' '/tmp/graph431140232240611822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph431140232240611822.bin' '-l' '-1' '-v' '-w' '/tmp/graph431140232240611822.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:46:06] [INFO ] Decomposing Gal with order
[2025-05-29 23:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:46:06] [INFO ] Removed a total of 73 redundant transitions.
[2025-05-29 23:46:06] [INFO ] Flatten gal took : 14 ms
[2025-05-29 23:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2025-05-29 23:46:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3653789006511754502.gal : 3 ms
[2025-05-29 23:46:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1513367256608845503.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/CTLFireability3653789006511754502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1513367256608845503.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,2.05007e+08,18.4026,282924,1608,1276,357344,36958,246,909137,105,425715,0
Converting to forward existential form...Done !
original formula: A(((!(EG((E(((i0.u0.s1>=1)&&(u6.l149>=1)) U ((i0.u4.s8>=1)&&(u9.l151>=1))) * EG(((i0.u0.s1>=1)&&(u10.l345>=1)))))) * (i4.u12.p21>=1)) * (...376
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(E((!(!((E(!(((i0.u0.s1>=1)&&(u3.l492>=1))) U (!(((i0.u0.s1>=1)&&(i4.u8.l336>=1))) * !(((...1389
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t32, t55, t63, t64, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t...307
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 77 transition count 99
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 77 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 67 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 59 transition count 69
Applied a total of 80 rules in 12 ms. Remains 59 /95 variables (removed 36) and now considering 69/132 (removed 63) transitions.
// Phase 1: matrix 69 rows 59 cols
[2025-05-29 23:46:37] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:37] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-29 23:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 23:46:37] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2025-05-29 23:46:37] [INFO ] Invariant cache hit.
[2025-05-29 23:46:37] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 8866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11362ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 11362ms
Starting structural reductions in LTL mode, iteration 1 : 59/95 places, 69/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11658 ms. Remains : 59/95 places, 69/132 transitions.
[2025-05-29 23:46:48] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:46:48] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:46:48] [INFO ] Input system was already deterministic with 69 transitions.
[2025-05-29 23:46:48] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:46:48] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:46:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6727535972956713250.gal : 1 ms
[2025-05-29 23:46:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5709596351617863970.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/CTLFireability6727535972956713250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5709596351617863970.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,2.54079e+07,3.72112,82512,2,18047,5,299451,6,0,305,342203,0
Converting to forward existential form...Done !
original formula: EX(EF(AG(((s1<1)||(l150<1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((s1<1)||(l150<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t45, t50, t51, t52, t5...331
Detected timeout of ITS tools.
[2025-05-29 23:47:18] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:47:18] [INFO ] Applying decomposition
[2025-05-29 23:47:18] [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/graph3876834678955215620.txt' '-o' '/tmp/graph3876834678955215620.bin' '-w' '/tmp/graph3876834678955215620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3876834678955215620.bin' '-l' '-1' '-v' '-w' '/tmp/graph3876834678955215620.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:47:18] [INFO ] Decomposing Gal with order
[2025-05-29 23:47:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:47:18] [INFO ] Removed a total of 53 redundant transitions.
[2025-05-29 23:47:18] [INFO ] Flatten gal took : 11 ms
[2025-05-29 23:47:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 4 ms.
[2025-05-29 23:47:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2756174159370260903.gal : 2 ms
[2025-05-29 23:47:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2874656765240697028.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/CTLFireability2756174159370260903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2874656765240697028.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,2.54079e+07,5.04272,82068,2566,1068,96992,27860,237,342748,101,115685,0
Converting to forward existential form...Done !
original formula: EX(EF(AG(((i1.u0.s1<1)||(i2.u5.l150<1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((i1.u0.s1<1)||(i2.u5.l150<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t29, t45, t50, t51, t52, t53, t54, t55, t56, t57, t59, t61, t62, t63, t64, t65, t66, ...289
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 79 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 79 transition count 104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 71 transition count 96
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 71 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 71 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 68 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 68 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 67 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 66 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 66 transition count 83
Applied a total of 64 rules in 36 ms. Remains 66 /95 variables (removed 29) and now considering 83/132 (removed 49) transitions.
// Phase 1: matrix 83 rows 66 cols
[2025-05-29 23:47:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:47:49] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-29 23:47:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:47:49] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-29 23:47:49] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:47:49] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2025-05-29 23:47:49] [INFO ] Invariant cache hit.
[2025-05-29 23:47:49] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 34/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:51] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:53] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:53] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:53] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 10 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/149 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:54] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:54] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:55] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:55] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:55] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:47:56] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/149 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 113 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7931 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/149 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 34/113 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 82/195 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 195 constraints, problems are : Problem set: 0 solved, 82 unsolved in 10508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18475ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 18476ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/95 places, 83/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18846 ms. Remains : 66/95 places, 83/132 transitions.
[2025-05-29 23:48:07] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:48:07] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:48:07] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 23:48:07] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:48:07] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:48:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8334203495798194831.gal : 1 ms
[2025-05-29 23:48:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17005936062162867676.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/CTLFireability8334203495798194831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17005936062162867676.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,2.20651e+08,18.0025,320748,2,28172,5,1.56808e+06,6,0,347,1.0871e+06,0
Converting to forward existential form...Done !
original formula: (EF(((s1>=1)&&(l91>=1))) * AF(AG((((((s1<1)||(l149<1))||((s1<1)||(l335<1)))&&(((s1<1)||(l150<1))||((s1<1)||(l491<1)))) + !(A(((s0>=1)&&(l...190
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((s1>=1)&&(l91>=1)))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !((((((s1<1)||(l149<1))||((s1<1)|...344
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53, t55, t5...366
Detected timeout of ITS tools.
[2025-05-29 23:48:37] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:48:37] [INFO ] Applying decomposition
[2025-05-29 23:48:37] [INFO ] Flatten gal took : 4 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/graph9590094039920457346.txt' '-o' '/tmp/graph9590094039920457346.bin' '-w' '/tmp/graph9590094039920457346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9590094039920457346.bin' '-l' '-1' '-v' '-w' '/tmp/graph9590094039920457346.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:48:37] [INFO ] Decomposing Gal with order
[2025-05-29 23:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:48:37] [INFO ] Removed a total of 84 redundant transitions.
[2025-05-29 23:48:37] [INFO ] Flatten gal took : 9 ms
[2025-05-29 23:48:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2025-05-29 23:48:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1591127989700233793.gal : 1 ms
[2025-05-29 23:48:37] [INFO ] Time to serialize properties into /tmp/CTLFireability13334907718428377410.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/CTLFireability1591127989700233793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13334907718428377410.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 78 transition count 99
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 78 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 78 transition count 97
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 70 transition count 89
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 69 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 67 transition count 80
Applied a total of 62 rules in 8 ms. Remains 67 /95 variables (removed 28) and now considering 80/132 (removed 52) transitions.
// Phase 1: matrix 80 rows 67 cols
[2025-05-29 23:49:07] [INFO ] Computed 2 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:49:08] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-29 23:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:49:08] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 23:49:08] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-05-29 23:49:08] [INFO ] Invariant cache hit.
[2025-05-29 23:49:08] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/147 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:49:10] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:49:10] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 98 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/147 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 10038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14036ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 14037ms
Starting structural reductions in LTL mode, iteration 1 : 67/95 places, 80/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14381 ms. Remains : 67/95 places, 80/132 transitions.
[2025-05-29 23:49:22] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:49:22] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:49:22] [INFO ] Input system was already deterministic with 80 transitions.
[2025-05-29 23:49:22] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:49:22] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6384277208774657076.gal : 2 ms
[2025-05-29 23:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17971185713013070611.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/CTLFireability6384277208774657076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17971185713013070611.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,1.79243e+08,11.8854,217756,2,21958,5,788280,6,0,348,961583,0
Converting to forward existential form...Done !
original formula: EF((((!(E(EG(((s8>=1)&&(l151>=1))) U (((s1>=1)&&(l486>=1))||((s1>=1)&&(l32>=1))))) * EX(EF(((s1<1)||(l504<1))))) * ((s1>=1)&&(l125>=1))) ...240
=> equivalent forward existential formula: [(FwdU(EY((((FwdU(Init,TRUE) * ((((s1<1)||(l110<1))&&((s1<1)||(l90<1)))&&(((s1<1)||(l338<1))&&((s1<1)||(l3<1))))...299
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t52, t53, t54, t58, t59, t60, t61, t62, t63, t64, t65, t66, t6...316
Detected timeout of ITS tools.
[2025-05-29 23:49:52] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:49:52] [INFO ] Applying decomposition
[2025-05-29 23:49:52] [INFO ] Flatten gal took : 3 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/graph7404621267236813604.txt' '-o' '/tmp/graph7404621267236813604.bin' '-w' '/tmp/graph7404621267236813604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7404621267236813604.bin' '-l' '-1' '-v' '-w' '/tmp/graph7404621267236813604.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:49:52] [INFO ] Decomposing Gal with order
[2025-05-29 23:49:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:49:52] [INFO ] Removed a total of 77 redundant transitions.
[2025-05-29 23:49:52] [INFO ] Flatten gal took : 13 ms
[2025-05-29 23:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 21 ms.
[2025-05-29 23:49:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13435360278172729692.gal : 2 ms
[2025-05-29 23:49:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2930519639033151060.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/CTLFireability13435360278172729692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2930519639033151060.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.79243e+08,9.40791,168692,2967,680,267106,6462,267,557556,75,53366,0
Converting to forward existential form...Done !
original formula: EF((((!(E(EG(((i1.u2.s8>=1)&&(i0.u10.l151>=1))) U (((i1.u2.s1>=1)&&(i3.u13.l486>=1))||((i1.u2.s1>=1)&&(i2.u4.l32>=1))))) * EX(EF(((i1.u2....345
=> equivalent forward existential formula: [(FwdU(EY((((FwdU(Init,TRUE) * ((((i1.u2.s1<1)||(i1.u2.l110<1))&&((i1.u2.s1<1)||(u7.l90<1)))&&(((i1.u2.s1<1)||(i...404
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t26, t49, t52, t53, t54, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, ...313
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 80 transition count 102
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 80 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 74 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 74 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 72 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 72 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 72 transition count 90
Applied a total of 49 rules in 8 ms. Remains 72 /95 variables (removed 23) and now considering 90/132 (removed 42) transitions.
// Phase 1: matrix 90 rows 72 cols
[2025-05-29 23:50:22] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:50:22] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-29 23:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:50:22] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-29 23:50:23] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-05-29 23:50:23] [INFO ] Invariant cache hit.
[2025-05-29 23:50:23] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/162 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 32/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:50:25] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:50:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:50:25] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 109 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/162 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 32/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 89/198 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 198 constraints, problems are : Problem set: 0 solved, 89 unsolved in 14172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19381ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 19382ms
Starting structural reductions in LTL mode, iteration 1 : 72/95 places, 90/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19854 ms. Remains : 72/95 places, 90/132 transitions.
[2025-05-29 23:50:42] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:50:42] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:50:42] [INFO ] Input system was already deterministic with 90 transitions.
[2025-05-29 23:50:42] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:50:42] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:50:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3512351066130342365.gal : 1 ms
[2025-05-29 23:50:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4652596822260189599.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/CTLFireability3512351066130342365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4652596822260189599.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,3.6782e+08,20.1591,372388,2,29064,5,1.69428e+06,6,0,378,1.16886e+06,0
Converting to forward existential form...Done !
original formula: A(((s1>=1)&&(l492>=1)) U (AX((AX(((p17>=1)&&(l126>=1))) * ((((s1>=1)&&(l484>=1))&&((s1>=1)&&(l33>=1)))||(!((s1>=1)&&(l490>=1)))))) + E(AX...207
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!(EX(!(((p17>=1)&&(l126>=1))))) * ((((s1>=1)&&(l484>=1))&&((s1>=1)&&(l33>=1)))||(!((s1...682
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t45, t46, t47, t54, t55, t56, t65, t66, t67, t68, t69, t70,...349
Detected timeout of ITS tools.
[2025-05-29 23:51:12] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:51:12] [INFO ] Applying decomposition
[2025-05-29 23:51:12] [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/graph4099596154660025040.txt' '-o' '/tmp/graph4099596154660025040.bin' '-w' '/tmp/graph4099596154660025040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4099596154660025040.bin' '-l' '-1' '-v' '-w' '/tmp/graph4099596154660025040.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:51:12] [INFO ] Decomposing Gal with order
[2025-05-29 23:51:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:51:12] [INFO ] Removed a total of 83 redundant transitions.
[2025-05-29 23:51:12] [INFO ] Flatten gal took : 29 ms
[2025-05-29 23:51:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 3 ms.
[2025-05-29 23:51:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18119231839566234518.gal : 2 ms
[2025-05-29 23:51:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11142747063994930498.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/CTLFireability18119231839566234518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11142747063994930498.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.6782e+08,19.2971,243620,2440,1584,237050,32290,264,818303,100,705852,0
Converting to forward existential form...Done !
original formula: A(((i2.u1.s1>=1)&&(u12.l492>=1)) U (AX((AX(((i8.u14.p17>=1)&&(i8.u13.l126>=1))) * ((((i2.u1.s1>=1)&&(i8.u14.l484>=1))&&((i2.u1.s1>=1)&&(u...288
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!(EX(!(((i8.u14.p17>=1)&&(i8.u13.l126>=1))))) * ((((i2.u1.s1>=1)&&(i8.u14.l484>=1))&&(...905
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t8, t9, t28, t45, t46, t47, t56, t66, t67, t69, t70, t71, t72, t73, t74, t75, t76...330
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 78 transition count 100
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 78 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 71 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 71 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 69 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 69 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 68 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 68 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 67 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 66 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 66 transition count 80
Applied a total of 64 rules in 10 ms. Remains 66 /95 variables (removed 29) and now considering 80/132 (removed 52) transitions.
// Phase 1: matrix 80 rows 66 cols
[2025-05-29 23:51:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:51:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-29 23:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:51:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-29 23:51:42] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-05-29 23:51:42] [INFO ] Invariant cache hit.
[2025-05-29 23:51:42] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 97 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 79/176 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 176 constraints, problems are : Problem set: 0 solved, 79 unsolved in 8088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10772ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 10772ms
Starting structural reductions in LTL mode, iteration 1 : 66/95 places, 80/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11116 ms. Remains : 66/95 places, 80/132 transitions.
[2025-05-29 23:51:53] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:51:53] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:51:53] [INFO ] Input system was already deterministic with 80 transitions.
[2025-05-29 23:51:53] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:51:53] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:51:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11798729406227123018.gal : 1 ms
[2025-05-29 23:51:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14825390486953137617.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/CTLFireability11798729406227123018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14825390486953137617.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,2.17267e+08,17.9954,334232,2,32247,5,1.4182e+06,6,0,344,1.24255e+06,0
Converting to forward existential form...Done !
original formula: EF(((AX(((!(E(((s0>=1)&&(l0>=1)) U ((p38>=1)&&(l136>=1)))) + EX(((s1<1)||(l339<1)))) + !(A(((s1>=1)&&(l355>=1)) U !(((s1<1)||(l491<1)))))...182
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (l488>=1)) * (s1>=1)) * !(EX(!(((!(E(((s0>=1)&&(l0>=1)) U ((p38>=1)&&(l136>=1)))) + EX(((s...311
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t44, t45, t46, t48, t49, t50, t52, t59, t60, t61, t62, t63, t64, t6...326
Detected timeout of ITS tools.
[2025-05-29 23:52:23] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:52:23] [INFO ] Applying decomposition
[2025-05-29 23:52:23] [INFO ] Flatten gal took : 3 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/graph14724491205529358803.txt' '-o' '/tmp/graph14724491205529358803.bin' '-w' '/tmp/graph14724491205529358803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14724491205529358803.bin' '-l' '-1' '-v' '-w' '/tmp/graph14724491205529358803.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:52:23] [INFO ] Decomposing Gal with order
[2025-05-29 23:52:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:52:23] [INFO ] Removed a total of 75 redundant transitions.
[2025-05-29 23:52:23] [INFO ] Flatten gal took : 19 ms
[2025-05-29 23:52:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 2 ms.
[2025-05-29 23:52:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5415747615138655549.gal : 1 ms
[2025-05-29 23:52:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17789579340017258610.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/CTLFireability5415747615138655549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17789579340017258610.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 76 transition count 94
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 67 transition count 82
Applied a total of 59 rules in 11 ms. Remains 67 /95 variables (removed 28) and now considering 82/132 (removed 50) transitions.
// Phase 1: matrix 82 rows 67 cols
[2025-05-29 23:52:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:52:54] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-29 23:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:52:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 23:52:54] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2025-05-29 23:52:54] [INFO ] Invariant cache hit.
[2025-05-29 23:52:54] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 92 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 81/173 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 173 constraints, problems are : Problem set: 0 solved, 81 unsolved in 9181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11620ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 11621ms
Starting structural reductions in LTL mode, iteration 1 : 67/95 places, 82/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12207 ms. Remains : 67/95 places, 82/132 transitions.
[2025-05-29 23:53:06] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:53:06] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:53:06] [INFO ] Input system was already deterministic with 82 transitions.
[2025-05-29 23:53:06] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:53:06] [INFO ] Flatten gal took : 9 ms
[2025-05-29 23:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability373325065696869356.gal : 2 ms
[2025-05-29 23:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18098400781650033908.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/CTLFireability373325065696869356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18098400781650033908.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,1.78687e+08,12.9406,242176,2,20273,5,1.04446e+06,6,0,350,983182,0
Converting to forward existential form...Done !
original formula: (EG(EX(((s1<1)||(l335<1)))) + AG((EF(!(E(((p35>=1)&&(l136>=1)) U ((p19>=1)&&(l126>=1))))) + AG(((s1<1)||(l110<1))))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(EG(EX(((s1<1)||(l335<1)))))),TRUE) * !(E(TRUE U !(E(((p35>=1)&&(l136>=1)) U ((p19>=1)&&(l...208
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t51, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t7...306
(forward)formula 0,1,19.6989,243828,1,0,156,1.16767e+06,191,64,2515,983182,186
FORMULA DBSingleClientW-PT-d0m10-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 79 transition count 97
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 79 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 70 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 70 transition count 85
Applied a total of 53 rules in 4 ms. Remains 70 /95 variables (removed 25) and now considering 85/132 (removed 47) transitions.
// Phase 1: matrix 85 rows 70 cols
[2025-05-29 23:53:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:53:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 23:53:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:53:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 23:53:26] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-05-29 23:53:26] [INFO ] Invariant cache hit.
[2025-05-29 23:53:26] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/155 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 24/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:28] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:28] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:28] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:28] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:28] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:28] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:29] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:29] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:29] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:30] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:30] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:30] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:30] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:30] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:31] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/155 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:31] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:31] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:53:31] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 114 constraints, problems are : Problem set: 0 solved, 84 unsolved in 7509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/155 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 24/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 84/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 198 constraints, problems are : Problem set: 0 solved, 84 unsolved in 16894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24430ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 24431ms
Starting structural reductions in LTL mode, iteration 1 : 70/95 places, 85/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24688 ms. Remains : 70/95 places, 85/132 transitions.
[2025-05-29 23:53:50] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:53:50] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:53:50] [INFO ] Input system was already deterministic with 85 transitions.
[2025-05-29 23:53:50] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:53:50] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:53:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3929514808157837737.gal : 2 ms
[2025-05-29 23:53:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4735683698492007547.ctl : 3 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/CTLFireability3929514808157837737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4735683698492007547.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,2.4341e+08,16.1773,293536,2,22823,5,1.15484e+06,6,0,365,1.33438e+06,0
Converting to forward existential form...Done !
original formula: (AF(((p22>=1)&&(l0>=1))) + (EG((((s1<1)||(l505<1)) * ((AG(((s1<1)||(l338<1))) + (p24<1)) + ((l0<1)||((p28>=1)&&(l0>=1)))))) * (AX(((EF(((...252
=> equivalent forward existential formula: ([((Init * !(!(EG(!(((p22>=1)&&(l0>=1))))))) * !(EG((((s1<1)||(l505<1)) * ((!(E(TRUE U !(((s1<1)||(l338<1))))) +...398
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t51, t53, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t7...321
Detected timeout of ITS tools.
[2025-05-29 23:54:20] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:54:20] [INFO ] Applying decomposition
[2025-05-29 23:54:20] [INFO ] Flatten gal took : 3 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/graph3557024248669148752.txt' '-o' '/tmp/graph3557024248669148752.bin' '-w' '/tmp/graph3557024248669148752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3557024248669148752.bin' '-l' '-1' '-v' '-w' '/tmp/graph3557024248669148752.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:54:20] [INFO ] Decomposing Gal with order
[2025-05-29 23:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:54:20] [INFO ] Removed a total of 78 redundant transitions.
[2025-05-29 23:54:20] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 2 ms.
[2025-05-29 23:54:20] [INFO ] Time to serialize gal into /tmp/CTLFireability980441995485679127.gal : 2 ms
[2025-05-29 23:54:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9022511010499128852.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/CTLFireability980441995485679127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9022511010499128852.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 78 transition count 96
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 78 transition count 95
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 71 transition count 88
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 70 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 70 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 70 transition count 83
Applied a total of 54 rules in 7 ms. Remains 70 /95 variables (removed 25) and now considering 83/132 (removed 49) transitions.
// Phase 1: matrix 83 rows 70 cols
[2025-05-29 23:54:50] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:54:51] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-29 23:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:54:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 23:54:51] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-05-29 23:54:51] [INFO ] Invariant cache hit.
[2025-05-29 23:54:51] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/153 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 24/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 96 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/153 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 24/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 178 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12158ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 12159ms
Starting structural reductions in LTL mode, iteration 1 : 70/95 places, 83/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12555 ms. Remains : 70/95 places, 83/132 transitions.
[2025-05-29 23:55:03] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:55:03] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:55:03] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 23:55:03] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:55:03] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:55:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5784590563526810158.gal : 1 ms
[2025-05-29 23:55:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9644931702158783355.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/CTLFireability5784590563526810158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9644931702158783355.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,2.57159e+08,21.9828,372104,2,30417,5,1.1941e+06,6,0,363,2.04297e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:55:33] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:55:33] [INFO ] Applying decomposition
[2025-05-29 23:55:33] [INFO ] Flatten gal took : 3 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/graph13617063127103567079.txt' '-o' '/tmp/graph13617063127103567079.bin' '-w' '/tmp/graph13617063127103567079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13617063127103567079.bin' '-l' '-1' '-v' '-w' '/tmp/graph13617063127103567079.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:55:33] [INFO ] Decomposing Gal with order
[2025-05-29 23:55:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:55:33] [INFO ] Removed a total of 77 redundant transitions.
[2025-05-29 23:55:33] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:55:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 2 ms.
[2025-05-29 23:55:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2645299593292411045.gal : 2 ms
[2025-05-29 23:55:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9208341614516762115.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/CTLFireability2645299593292411045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9208341614516762115.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 79 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 79 transition count 104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 71 transition count 96
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 70 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 70 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 69 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 69 transition count 93
Applied a total of 53 rules in 5 ms. Remains 69 /95 variables (removed 26) and now considering 93/132 (removed 39) transitions.
// Phase 1: matrix 93 rows 69 cols
[2025-05-29 23:56:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:56:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-29 23:56:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:56:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-29 23:56:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-05-29 23:56:04] [INFO ] Invariant cache hit.
[2025-05-29 23:56:04] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/162 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 35/106 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 106 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/162 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 35/106 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 92/198 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 198 constraints, problems are : Problem set: 0 solved, 92 unsolved in 13832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18035ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 18036ms
Starting structural reductions in LTL mode, iteration 1 : 69/95 places, 93/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18456 ms. Remains : 69/95 places, 93/132 transitions.
[2025-05-29 23:56:22] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:56:22] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:56:22] [INFO ] Input system was already deterministic with 93 transitions.
[2025-05-29 23:56:22] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:56:22] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:56:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7306737762651541029.gal : 1 ms
[2025-05-29 23:56:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9194201191618452378.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/CTLFireability7306737762651541029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9194201191618452378.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,3.25302e+08,28.4105,401180,2,23721,5,1.53628e+06,6,0,369,1.58763e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:56:52] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:56:52] [INFO ] Applying decomposition
[2025-05-29 23:56:52] [INFO ] Flatten gal took : 3 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/graph15732333237880553656.txt' '-o' '/tmp/graph15732333237880553656.bin' '-w' '/tmp/graph15732333237880553656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15732333237880553656.bin' '-l' '-1' '-v' '-w' '/tmp/graph15732333237880553656.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:56:52] [INFO ] Decomposing Gal with order
[2025-05-29 23:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:56:52] [INFO ] Removed a total of 83 redundant transitions.
[2025-05-29 23:56:52] [INFO ] Flatten gal took : 9 ms
[2025-05-29 23:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2025-05-29 23:56:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15227016431293849843.gal : 2 ms
[2025-05-29 23:56:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15407096243672074939.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/CTLFireability15227016431293849843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15407096243672074939.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 80 transition count 106
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 80 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 80 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 73 transition count 96
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 73 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 72 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 72 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 71 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 87
Applied a total of 57 rules in 4 ms. Remains 70 /95 variables (removed 25) and now considering 87/132 (removed 45) transitions.
// Phase 1: matrix 87 rows 70 cols
[2025-05-29 23:57:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:57:22] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-29 23:57:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:57:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-29 23:57:22] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-05-29 23:57:22] [INFO ] Invariant cache hit.
[2025-05-29 23:57:22] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/157 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 33/105 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 105 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/157 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 33/105 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 86/191 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 191 constraints, problems are : Problem set: 0 solved, 86 unsolved in 13877 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18089ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 18090ms
Starting structural reductions in LTL mode, iteration 1 : 70/95 places, 87/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18356 ms. Remains : 70/95 places, 87/132 transitions.
[2025-05-29 23:57:40] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:57:40] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:57:40] [INFO ] Input system was already deterministic with 87 transitions.
[2025-05-29 23:57:40] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:57:40] [INFO ] Flatten gal took : 5 ms
[2025-05-29 23:57:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1949505503765656297.gal : 2 ms
[2025-05-29 23:57:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1779379605402637674.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/CTLFireability1949505503765656297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1779379605402637674.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,2.08911e+08,11.9152,218740,2,22259,5,767710,6,0,367,982351,0
Converting to forward existential form...Done !
original formula: AF(((AG(!(A(((s1>=1)&&(l91>=1)) U ((s1>=1)&&(l32>=1))))) * ((s1<1)||(l339<1))) + ((EX(AF(((s1<1)||(l150<1)))) * AF(((s1>=1)&&(l484>=1))))...210
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(!(!((E(!(((s1>=1)&&(l32>=1))) U (!(((s1>=1)&&(l91>=1))) * !(((s1>=1)&&(l32>=1))))) +...346
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t55, t58, t59, t60, t6...366
Detected timeout of ITS tools.
[2025-05-29 23:58:10] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:58:10] [INFO ] Applying decomposition
[2025-05-29 23:58:10] [INFO ] Flatten gal took : 3 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/graph18267716563040769915.txt' '-o' '/tmp/graph18267716563040769915.bin' '-w' '/tmp/graph18267716563040769915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18267716563040769915.bin' '-l' '-1' '-v' '-w' '/tmp/graph18267716563040769915.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:58:10] [INFO ] Decomposing Gal with order
[2025-05-29 23:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:58:10] [INFO ] Removed a total of 84 redundant transitions.
[2025-05-29 23:58:10] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 2 ms.
[2025-05-29 23:58:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15653770531045721450.gal : 2 ms
[2025-05-29 23:58:10] [INFO ] Time to serialize properties into /tmp/CTLFireability428541194642865842.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/CTLFireability15653770531045721450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability428541194642865842.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 132/132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 79 transition count 102
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 79 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 70 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 70 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 68 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 68 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 68 transition count 87
Applied a total of 57 rules in 3 ms. Remains 68 /95 variables (removed 27) and now considering 87/132 (removed 45) transitions.
// Phase 1: matrix 87 rows 68 cols
[2025-05-29 23:58:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:58:40] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-29 23:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:58:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-29 23:58:41] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-05-29 23:58:41] [INFO ] Invariant cache hit.
[2025-05-29 23:58:41] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/155 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 31/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:58:43] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 102 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4534 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/155 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 31/102 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 86/188 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 188 constraints, problems are : Problem set: 0 solved, 86 unsolved in 8488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13047ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13048ms
Starting structural reductions in LTL mode, iteration 1 : 68/95 places, 87/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13273 ms. Remains : 68/95 places, 87/132 transitions.
[2025-05-29 23:58:54] [INFO ] Flatten gal took : 2 ms
[2025-05-29 23:58:54] [INFO ] Flatten gal took : 4 ms
[2025-05-29 23:58:54] [INFO ] Input system was already deterministic with 87 transitions.
[2025-05-29 23:58:54] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:58:54] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4591355086164592362.gal : 1 ms
[2025-05-29 23:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8454472683199280044.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/CTLFireability4591355086164592362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8454472683199280044.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,1.49533e+08,20.6488,380956,2,32819,5,1.5705e+06,6,0,359,1.64585e+06,0
Converting to forward existential form...Done !
original formula: A(A((AF(E(!(((s1<1)||(l339<1))) U !(((s1<1)||(l335<1))))) + AF(!((((s1>=1)&&(l149>=1))||((s1>=1)&&(l110>=1)))))) U ((!(E(AF(!(((s1<1)||(l...385
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (EG((!(((s1>=1)&&(l91>=1))) * EX(((s1>=1)&&(l510>=1))))) + ((!((E(!((((s1>=1)&&(l509>=...1420
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t55, t64, t6...361
Detected timeout of ITS tools.
[2025-05-29 23:59:24] [INFO ] Flatten gal took : 3 ms
[2025-05-29 23:59:24] [INFO ] Applying decomposition
[2025-05-29 23:59:24] [INFO ] Flatten gal took : 2 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/graph2907746098801643754.txt' '-o' '/tmp/graph2907746098801643754.bin' '-w' '/tmp/graph2907746098801643754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2907746098801643754.bin' '-l' '-1' '-v' '-w' '/tmp/graph2907746098801643754.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:59:24] [INFO ] Decomposing Gal with order
[2025-05-29 23:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:59:24] [INFO ] Removed a total of 78 redundant transitions.
[2025-05-29 23:59:24] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2025-05-29 23:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14452859357267442793.gal : 2 ms
[2025-05-29 23:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11223265589374772659.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/CTLFireability14452859357267442793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11223265589374772659.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49533e+08,27.1264,344420,2890,2449,211616,111400,270,2.39237e+06,102,1.2043e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:59:54] [INFO ] Flatten gal took : 8 ms
[2025-05-29 23:59:54] [INFO ] Flatten gal took : 7 ms
[2025-05-29 23:59:54] [INFO ] Applying decomposition
[2025-05-29 23:59:54] [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/graph17783189698160496395.txt' '-o' '/tmp/graph17783189698160496395.bin' '-w' '/tmp/graph17783189698160496395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17783189698160496395.bin' '-l' '-1' '-v' '-w' '/tmp/graph17783189698160496395.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:59:54] [INFO ] Decomposing Gal with order
[2025-05-29 23:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:59:54] [INFO ] Removed a total of 147 redundant transitions.
[2025-05-29 23:59:54] [INFO ] Flatten gal took : 31 ms
[2025-05-29 23:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 5 ms.
[2025-05-29 23:59:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1960777422035318335.gal : 3 ms
[2025-05-29 23:59:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15920686892186426068.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/CTLFireability1960777422035318335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15920686892186426068.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 14 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,4.0135e+09,390.43,2261772,10253,1758,1.8653e+06,56965,346,1.41967e+07,102,664749,0
Converting to forward existential form...Done !
original formula: EX(((EG(((((EG(((i0.u0.s1<1)||(i7.u17.l485<1))) * (i0.u0.s1>=1)) * (i4.u19.l504>=1)) + (i6.u1.p28<1)) + (i0.u0.l0<1))) * EF((((i0.u0.s1>=...250
=> equivalent forward existential formula: [(FwdU(((EY(Init) * ((i0.u0.s1<1)||(i7.u17.l485<1))) * EG(((((EG(((i0.u0.s1<1)||(i7.u17.l485<1))) * (i0.u0.s1>=1...302
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t9, t11, t30, t49, t54, t55, t56, t71, t72, t73, t75, t76, t77, t86, t87, t88, t9...438
ITS-tools command line returned an error code 139
[2025-05-30 00:08:53] [INFO ] Flatten gal took : 5 ms
[2025-05-30 00:08:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6528738804086067834.gal : 1 ms
[2025-05-30 00:08:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10663670504190322533.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/CTLFireability6528738804086067834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10663670504190322533.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 14 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,4.0135e+09,191.12,3060156,2,96287,5,1.24845e+07,6,0,512,8.49107e+06,0
Converting to forward existential form...Done !
original formula: EX(((EG(((((EG(((s1<1)||(l485<1))) * (s1>=1)) * (l504>=1)) + (p28<1)) + (l0<1))) * EF((((s1>=1)&&(l505>=1))||((s1>=1)&&(l345>=1))))) * ((...173
=> equivalent forward existential formula: [(FwdU(((EY(Init) * ((s1<1)||(l485<1))) * EG(((((EG(((s1<1)||(l485<1))) * (s1>=1)) * (l504>=1)) + (p28<1)) + (l0...225
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...552
Using saturation style SCC detection
(forward)formula 0,1,863.135,7173816,1,0,373,3.89481e+07,13,131,1704,2.5761e+07,2
FORMULA DBSingleClientW-PT-d0m10-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EX(EG((AF(((s1>=1)&&(l354>=1))) * EG(((s1<1)||(l335<1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(EG(!(((s1>=1)&&(l354>=1))))) * EG(((s1<1)||(l335<1)))))] != FALSE
(forward)formula 1,0,1291.23,7990700,1,0,373,5.17094e+07,16,131,1796,3.38647e+07,150
FORMULA DBSingleClientW-PT-d0m10-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG((((!(A(((s1>=1)&&(l504>=1)) U ((s1>=1)&&(l501>=1)))) * AF(EX(((s1<1)||(l339<1))))) * (!(E(((s3>=1)&&(l0>=1)) U ((s1>=1)&&(l509>=1)))) ...301
=> equivalent forward existential formula: [FwdG(Init,(((!(!((E(!(((s1>=1)&&(l501>=1))) U (!(((s1>=1)&&(l504>=1))) * !(((s1>=1)&&(l501>=1))))) + EG(!(((s1>...425
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-30 00:35:22] [INFO ] Flatten gal took : 6 ms
[2025-05-30 00:35:22] [INFO ] Input system was already deterministic with 132 transitions.
[2025-05-30 00:35:22] [INFO ] Transformed 95 places.
[2025-05-30 00:35:22] [INFO ] Transformed 132 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 00:35:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13277059618331283617.gal : 1 ms
[2025-05-30 00:35:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13852971640401193896.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/CTLFireability13277059618331283617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13852971640401193896.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
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-d0m10"
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-d0m10, 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-174854063400050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m10.tgz
mv DBSingleClientW-PT-d0m10 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 '
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 ;