About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m010
| 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?F????????TTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264100418.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 RingSingleMessageInMbox-PT-d1m010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264100418
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-15
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749072550144
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 21:29:11] [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-06-04 21:29:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:29:12] [INFO ] Load time of PNML (sax parser for PT used): 662 ms
[2025-06-04 21:29:12] [INFO ] Transformed 6690 places.
[2025-06-04 21:29:12] [INFO ] Transformed 11934 transitions.
[2025-06-04 21:29:12] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 859 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 4305 places in 28 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 65 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1067 places :
Symmetric choice reduction at 1 with 1067 rule applications. Total rules 1186 place count 1301 transition count 10630
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2253 place count 1301 transition count 10630
Ensure Unique test removed 438 transitions
Reduce isomorphic transitions removed 438 transitions.
Iterating post reduction 1 with 438 rules applied. Total rules applied 2691 place count 1301 transition count 10192
Discarding 793 places :
Symmetric choice reduction at 2 with 793 rule applications. Total rules 3484 place count 508 transition count 9399
Iterating global reduction 2 with 793 rules applied. Total rules applied 4277 place count 508 transition count 9399
Ensure Unique test removed 6656 transitions
Reduce isomorphic transitions removed 6656 transitions.
Iterating post reduction 2 with 6656 rules applied. Total rules applied 10933 place count 508 transition count 2743
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 10943 place count 498 transition count 2733
Iterating global reduction 3 with 10 rules applied. Total rules applied 10953 place count 498 transition count 2733
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10955 place count 498 transition count 2731
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 10963 place count 490 transition count 2723
Iterating global reduction 4 with 8 rules applied. Total rules applied 10971 place count 490 transition count 2723
Applied a total of 10971 rules in 624 ms. Remains 490 /2385 variables (removed 1895) and now considering 2723/11934 (removed 9211) transitions.
// Phase 1: matrix 2723 rows 490 cols
[2025-06-04 21:29:13] [INFO ] Computed 3 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:13] [INFO ] Implicit Places using invariants in 705 ms returned []
[2025-06-04 21:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:14] [INFO ] State equation strengthened by 2278 read => feed constraints.
[2025-06-04 21:29:21] [INFO ] Implicit Places using invariants and state equation in 7865 ms returned []
Implicit Place search using SMT with State Equation took 8608 ms to find 0 implicit places.
Running 2722 sub problems to find dead transitions.
[2025-06-04 21:29:21] [INFO ] Invariant cache hit.
[2025-06-04 21:29:21] [INFO ] State equation strengthened by 2278 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/3213 variables, and 1 constraints, problems are : Problem set: 0 solved, 2722 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/490 constraints, ReadFeed: 0/2278 constraints, PredecessorRefiner: 2722/2722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2722 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/3213 variables, and 1 constraints, problems are : Problem set: 0 solved, 2722 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/490 constraints, ReadFeed: 0/2278 constraints, PredecessorRefiner: 0/2722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67824ms problems are : Problem set: 0 solved, 2722 unsolved
Search for dead transitions found 0 dead transitions in 67852ms
Starting structural reductions in LTL mode, iteration 1 : 490/2385 places, 2723/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77117 ms. Remains : 490/2385 places, 2723/11934 transitions.
Support contains 65 out of 490 places after structural reductions.
[2025-06-04 21:30:29] [INFO ] Flatten gal took : 201 ms
[2025-06-04 21:30:30] [INFO ] Flatten gal took : 115 ms
[2025-06-04 21:30:30] [INFO ] Input system was already deterministic with 2723 transitions.
Reduction of identical properties reduced properties to check from 73 to 69
RANDOM walk for 40000 steps (6803 resets) in 2806 ms. (14 steps per ms) remains 8/69 properties
BEST_FIRST walk for 40004 steps (604 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (279 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (537 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (542 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (558 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (293 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (582 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (608 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
[2025-06-04 21:30:31] [INFO ] Invariant cache hit.
[2025-06-04 21:30:31] [INFO ] State equation strengthened by 2278 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp61 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 108/125 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/132 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 48/180 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1154/1334 variables, 180/183 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 709/892 constraints. Problems are: Problem set: 3 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1334 variables, 0/892 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp63 is UNSAT
After SMT solving in domain Real declared 3213/3213 variables, and 1202 constraints, problems are : Problem set: 8 solved, 0 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 490/490 constraints, ReadFeed: 709/2278 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1365ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2025-06-04 21:30:32] [INFO ] Flatten gal took : 78 ms
[2025-06-04 21:30:33] [INFO ] Flatten gal took : 77 ms
[2025-06-04 21:30:33] [INFO ] Input system was already deterministic with 2723 transitions.
Support contains 52 out of 490 places (down from 53) after GAL structural reductions.
Computed a total of 171 stabilizing places and 1357 stable transitions
Graph (complete) has 3708 edges and 490 vertex of which 489 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 439 transition count 1134
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 439 transition count 1134
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 135 place count 439 transition count 1101
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 261 place count 313 transition count 975
Iterating global reduction 1 with 126 rules applied. Total rules applied 387 place count 313 transition count 975
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 639 place count 313 transition count 723
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 735 place count 217 transition count 627
Iterating global reduction 2 with 96 rules applied. Total rules applied 831 place count 217 transition count 627
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 1011 place count 217 transition count 447
Applied a total of 1011 rules in 27 ms. Remains 217 /490 variables (removed 273) and now considering 447/2723 (removed 2276) transitions.
// Phase 1: matrix 447 rows 217 cols
[2025-06-04 21:30:33] [INFO ] Computed 3 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-04 21:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:33] [INFO ] State equation strengthened by 247 read => feed constraints.
[2025-06-04 21:30:36] [INFO ] Implicit Places using invariants and state equation in 3017 ms returned []
Implicit Place search using SMT with State Equation took 3159 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2025-06-04 21:30:36] [INFO ] Invariant cache hit.
[2025-06-04 21:30:36] [INFO ] State equation strengthened by 247 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 4 (OVERLAPS) 447/664 variables, 217/220 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 247/467 constraints. Problems are: Problem set: 24 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 467 constraints, problems are : Problem set: 24 solved, 422 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 247/247 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 17/209 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 8/217 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 447/664 variables, 217/220 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 247/467 constraints. Problems are: Problem set: 24 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 422/889 constraints. Problems are: Problem set: 24 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 889 constraints, problems are : Problem set: 24 solved, 422 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 247/247 constraints, PredecessorRefiner: 422/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 24 solved, 422 unsolved
Search for dead transitions found 24 dead transitions in 60417ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/490 places, 423/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 411
Applied a total of 36 rules in 3 ms. Remains 193 /217 variables (removed 24) and now considering 411/423 (removed 12) transitions.
// Phase 1: matrix 411 rows 193 cols
[2025-06-04 21:31:36] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:31:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-04 21:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:31:37] [INFO ] State equation strengthened by 243 read => feed constraints.
[2025-06-04 21:31:39] [INFO ] Implicit Places using invariants and state equation in 2810 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 193/490 places, 411/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66545 ms. Remains : 193/490 places, 411/2723 transitions.
[2025-06-04 21:31:39] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:31:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:31:39] [INFO ] Input system was already deterministic with 411 transitions.
[2025-06-04 21:31:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:31:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:31:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17302939461929241338.gal : 7 ms
[2025-06-04 21:31:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16929344589719493468.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/CTLFireability17302939461929241338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16929344589719493468.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,1.97904e+08,18.425,542336,2,16677,5,1.15382e+06,6,0,1183,671999,0
Converting to forward existential form...Done !
original formula: EG((EF((((s1>=1)&&(l3932>=1)) + (!(E(((s1>=1)&&(l3935>=1)) U ((s1>=1)&&(l3931>=1)))) * EX(((s1<1)||(l3931<1)))))) + (E(EX(((s1>=1)&&(l283...250
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((s1>=1)&&(l3932>=1)) + (!(E(((s1>=1)&&(l3935>=1)) U ((s1>=1)&&(l3931>=1)))) * EX(((s1<1)|...323
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t38,...1511
Detected timeout of ITS tools.
[2025-06-04 21:32:09] [INFO ] Flatten gal took : 12 ms
[2025-06-04 21:32:09] [INFO ] Applying decomposition
[2025-06-04 21:32:09] [INFO ] Flatten gal took : 10 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/graph3125079938582172965.txt' '-o' '/tmp/graph3125079938582172965.bin' '-w' '/tmp/graph3125079938582172965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3125079938582172965.bin' '-l' '-1' '-v' '-w' '/tmp/graph3125079938582172965.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:32:10] [INFO ] Decomposing Gal with order
[2025-06-04 21:32:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:32:10] [INFO ] Removed a total of 440 redundant transitions.
[2025-06-04 21:32:10] [INFO ] Flatten gal took : 80 ms
[2025-06-04 21:32:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 263 labels/synchronizations in 18 ms.
[2025-06-04 21:32:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1980669491612807.gal : 7 ms
[2025-06-04 21:32:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11384110973723726081.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/CTLFireability1980669491612807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11384110973723726081.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 440 transition count 1136
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 440 transition count 1136
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 134 place count 440 transition count 1102
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 228 place count 346 transition count 1008
Iterating global reduction 1 with 94 rules applied. Total rules applied 322 place count 346 transition count 1008
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Iterating post reduction 1 with 172 rules applied. Total rules applied 494 place count 346 transition count 836
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 614 place count 226 transition count 716
Iterating global reduction 2 with 120 rules applied. Total rules applied 734 place count 226 transition count 716
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Iterating post reduction 2 with 225 rules applied. Total rules applied 959 place count 226 transition count 491
Applied a total of 959 rules in 28 ms. Remains 226 /490 variables (removed 264) and now considering 491/2723 (removed 2232) transitions.
// Phase 1: matrix 491 rows 226 cols
[2025-06-04 21:32:40] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:40] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-04 21:32:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-06-04 21:32:43] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 2768 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2025-06-04 21:32:43] [INFO ] Invariant cache hit.
[2025-06-04 21:32:43] [INFO ] State equation strengthened by 283 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
At refinement iteration 4 (OVERLAPS) 491/717 variables, 226/229 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 283/512 constraints. Problems are: Problem set: 24 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 717/717 variables, and 512 constraints, problems are : Problem set: 24 solved, 466 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 226/226 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 17/218 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 3 (OVERLAPS) 8/226 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 5 (OVERLAPS) 491/717 variables, 226/229 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 283/512 constraints. Problems are: Problem set: 24 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 466/978 constraints. Problems are: Problem set: 24 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/717 variables, and 978 constraints, problems are : Problem set: 24 solved, 466 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 226/226 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 466/490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 24 solved, 466 unsolved
Search for dead transitions found 24 dead transitions in 60438ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 226/490 places, 467/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 202 transition count 455
Applied a total of 36 rules in 4 ms. Remains 202 /226 variables (removed 24) and now considering 455/467 (removed 12) transitions.
// Phase 1: matrix 455 rows 202 cols
[2025-06-04 21:33:43] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:43] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-04 21:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:43] [INFO ] State equation strengthened by 279 read => feed constraints.
[2025-06-04 21:33:44] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 202/490 places, 455/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64527 ms. Remains : 202/490 places, 455/2723 transitions.
[2025-06-04 21:33:44] [INFO ] Flatten gal took : 46 ms
[2025-06-04 21:33:44] [INFO ] Flatten gal took : 12 ms
[2025-06-04 21:33:44] [INFO ] Input system was already deterministic with 455 transitions.
[2025-06-04 21:33:44] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:33:45] [INFO ] Flatten gal took : 12 ms
[2025-06-04 21:33:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3864937603253893147.gal : 2 ms
[2025-06-04 21:33:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13251828920378082826.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/CTLFireability3864937603253893147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13251828920378082826.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,3.22288e+08,9.94796,282440,2,16306,5,544113,6,0,1263,372760,0
Converting to forward existential form...Done !
original formula: (AF(((s1>=1)&&(l3912>=1))) * (EX(EF(((s1<1)||(l3928<1)))) + (!(A(E(A(((s1>=1)&&(l195>=1)) U ((s1>=1)&&(l3248>=1))) U !(((s1>=1)&&(l3933>=...281
=> equivalent forward existential formula: ([FwdG(Init,!(((s1>=1)&&(l3912>=1))))] = FALSE * ([(((Init * !(EX(E(TRUE U ((s1<1)||(l3928<1)))))) * !(EG(!(!(E(...604
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t29, t30, t31, t32, t33, t34, t35, t36, ...1689
Detected timeout of ITS tools.
[2025-06-04 21:34:15] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:34:15] [INFO ] Applying decomposition
[2025-06-04 21:34:15] [INFO ] Flatten gal took : 10 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/graph7580912253969549516.txt' '-o' '/tmp/graph7580912253969549516.bin' '-w' '/tmp/graph7580912253969549516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7580912253969549516.bin' '-l' '-1' '-v' '-w' '/tmp/graph7580912253969549516.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:34:15] [INFO ] Decomposing Gal with order
[2025-06-04 21:34:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:34:15] [INFO ] Removed a total of 365 redundant transitions.
[2025-06-04 21:34:15] [INFO ] Flatten gal took : 37 ms
[2025-06-04 21:34:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 12 ms.
[2025-06-04 21:34:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17081787667956764596.gal : 3 ms
[2025-06-04 21:34:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5346587370159221274.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/CTLFireability17081787667956764596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5346587370159221274.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22288e+08,9.58526,257132,3503,4695,218789,84053,648,1.50318e+06,517,1.03814e+06,0
Converting to forward existential form...Done !
original formula: (AF(((u0.s1>=1)&&(u0.l3912>=1))) * (EX(EF(((u0.s1<1)||(u0.l3928<1)))) + (!(A(E(A(((u0.s1>=1)&&(u7.l195>=1)) U ((u0.s1>=1)&&(u0.l3248>=1))...335
=> equivalent forward existential formula: ([FwdG(Init,!(((u0.s1>=1)&&(u0.l3912>=1))))] = FALSE * ([(((Init * !(EX(E(TRUE U ((u0.s1<1)||(u0.l3928<1)))))) *...688
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t29, t30, t31, t32, t33, t42, t49, t50, t51, t52, t53, t67, t99, t102, t105, t108, t...2067
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 437 transition count 1004
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 437 transition count 1004
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 137 place count 437 transition count 973
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 264 place count 310 transition count 846
Iterating global reduction 1 with 127 rules applied. Total rules applied 391 place count 310 transition count 846
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 592 place count 310 transition count 645
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 696 place count 206 transition count 541
Iterating global reduction 2 with 104 rules applied. Total rules applied 800 place count 206 transition count 541
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 960 place count 206 transition count 381
Applied a total of 960 rules in 122 ms. Remains 206 /490 variables (removed 284) and now considering 381/2723 (removed 2342) transitions.
// Phase 1: matrix 381 rows 206 cols
[2025-06-04 21:34:45] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:46] [INFO ] Implicit Places using invariants in 662 ms returned []
[2025-06-04 21:34:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:46] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-06-04 21:34:47] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:34:47] [INFO ] Redundant transitions in 22 ms returned []
Running 380 sub problems to find dead transitions.
[2025-06-04 21:34:47] [INFO ] Invariant cache hit.
[2025-06-04 21:34:47] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (OVERLAPS) 381/587 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 190/399 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/399 constraints. Problems are: Problem set: 24 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/587 variables, and 399 constraints, problems are : Problem set: 24 solved, 356 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 356 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 17/198 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 8/206 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 381/587 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 190/399 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 356/755 constraints. Problems are: Problem set: 24 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 755 constraints, problems are : Problem set: 24 solved, 356 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 356/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60310ms problems are : Problem set: 24 solved, 356 unsolved
Search for dead transitions found 24 dead transitions in 60311ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 206/490 places, 357/2723 transitions.
Graph (complete) has 756 edges and 206 vertex of which 182 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 182 transition count 345
Applied a total of 13 rules in 17 ms. Remains 182 /206 variables (removed 24) and now considering 345/357 (removed 12) transitions.
// Phase 1: matrix 345 rows 182 cols
[2025-06-04 21:35:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:35:48] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-04 21:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:35:48] [INFO ] State equation strengthened by 186 read => feed constraints.
[2025-06-04 21:35:49] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 182/490 places, 345/2723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64314 ms. Remains : 182/490 places, 345/2723 transitions.
[2025-06-04 21:35:49] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:35:49] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:35:49] [INFO ] Input system was already deterministic with 345 transitions.
[2025-06-04 21:35:49] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:35:49] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:35:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16256597671263192500.gal : 2 ms
[2025-06-04 21:35:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13806147561733807519.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/CTLFireability16256597671263192500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13806147561733807519.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,1.78768e+08,5.86672,171324,2,13326,5,417344,6,0,1073,387557,0
Converting to forward existential form...Done !
original formula: AG(!(E(!(E(E(((s1>=1)&&(l192>=1)) U ((s1>=1)&&(l3924>=1))) U (((s1>=1)&&(l3913>=1))||((s1>=1)&&(l3928>=1))))) U ((!(AF(((s1>=1)&&(l3927>=...187
=> equivalent forward existential formula: [FwdG(((FwdU(FwdU(Init,TRUE),!(E(E(((s1>=1)&&(l192>=1)) U ((s1>=1)&&(l3924>=1))) U (((s1>=1)&&(l3913>=1))||((s1>...234
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t31, t32, t33, t34, t35,...1206
Hit Full ! (commute/partial/dont) 9/0/336
Detected timeout of ITS tools.
[2025-06-04 21:36:19] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:36:19] [INFO ] Applying decomposition
[2025-06-04 21:36:19] [INFO ] Flatten gal took : 8 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/graph4424295709024376361.txt' '-o' '/tmp/graph4424295709024376361.bin' '-w' '/tmp/graph4424295709024376361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4424295709024376361.bin' '-l' '-1' '-v' '-w' '/tmp/graph4424295709024376361.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:36:19] [INFO ] Decomposing Gal with order
[2025-06-04 21:36:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:36:19] [INFO ] Removed a total of 318 redundant transitions.
[2025-06-04 21:36:19] [INFO ] Flatten gal took : 32 ms
[2025-06-04 21:36:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 17 ms.
[2025-06-04 21:36:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15788101368914761288.gal : 2 ms
[2025-06-04 21:36:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15078828312279665216.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/CTLFireability15788101368914761288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15078828312279665216.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.78768e+08,6.1783,223940,3566,2207,125975,20620,707,2.25798e+06,354,116622,0
Converting to forward existential form...Done !
original formula: AG(!(E(!(E(E(((i1.u0.s1>=1)&&(i2.u6.l192>=1)) U ((i1.u0.s1>=1)&&(i1.u0.l3924>=1))) U (((i1.u0.s1>=1)&&(i1.u0.l3913>=1))||((i1.u0.s1>=1)&&...259
=> equivalent forward existential formula: [FwdG(((FwdU(FwdU(Init,TRUE),!(E(E(((i1.u0.s1>=1)&&(i2.u6.l192>=1)) U ((i1.u0.s1>=1)&&(i1.u0.l3924>=1))) U (((i1...306
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t22, t23, t24, t25, t26, t73, t76, t79, t82, t232, t234, t236, t238, t275, t276, t27...1800
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 438 transition count 1070
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 438 transition count 1070
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 138 place count 438 transition count 1036
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 264 place count 312 transition count 910
Iterating global reduction 1 with 126 rules applied. Total rules applied 390 place count 312 transition count 910
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Iterating post reduction 1 with 227 rules applied. Total rules applied 617 place count 312 transition count 683
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 717 place count 212 transition count 583
Iterating global reduction 2 with 100 rules applied. Total rules applied 817 place count 212 transition count 583
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 973 place count 212 transition count 427
Applied a total of 973 rules in 27 ms. Remains 212 /490 variables (removed 278) and now considering 427/2723 (removed 2296) transitions.
// Phase 1: matrix 427 rows 212 cols
[2025-06-04 21:36:50] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:50] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-06-04 21:36:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:50] [INFO ] State equation strengthened by 231 read => feed constraints.
[2025-06-04 21:36:53] [INFO ] Implicit Places using invariants and state equation in 2532 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-04 21:36:53] [INFO ] Invariant cache hit.
[2025-06-04 21:36:53] [INFO ] State equation strengthened by 231 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 4 (OVERLAPS) 427/639 variables, 212/215 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 231/446 constraints. Problems are: Problem set: 24 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 446 constraints, problems are : Problem set: 24 solved, 402 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 402 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 17/204 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 3 (OVERLAPS) 8/212 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 5 (OVERLAPS) 427/639 variables, 212/215 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 231/446 constraints. Problems are: Problem set: 24 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 402/848 constraints. Problems are: Problem set: 24 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 848 constraints, problems are : Problem set: 24 solved, 402 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 402/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 24 solved, 402 unsolved
Search for dead transitions found 24 dead transitions in 60349ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 212/490 places, 403/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 391
Applied a total of 36 rules in 8 ms. Remains 188 /212 variables (removed 24) and now considering 391/403 (removed 12) transitions.
// Phase 1: matrix 391 rows 188 cols
[2025-06-04 21:37:53] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:53] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-04 21:37:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:53] [INFO ] State equation strengthened by 227 read => feed constraints.
[2025-06-04 21:37:55] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 188/490 places, 391/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65502 ms. Remains : 188/490 places, 391/2723 transitions.
[2025-06-04 21:37:55] [INFO ] Flatten gal took : 21 ms
[2025-06-04 21:37:55] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:37:55] [INFO ] Input system was already deterministic with 391 transitions.
[2025-06-04 21:37:55] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:37:55] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:37:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10102949688442206236.gal : 2 ms
[2025-06-04 21:37:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4016990761883637273.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/CTLFireability10102949688442206236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4016990761883637273.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.10916e+08,14.5312,414984,2,15208,5,1.04747e+06,6,0,1143,596976,0
Converting to forward existential form...Done !
original formula: (EF((((s1>=1)&&(l3914>=1))&&(((s1<1)||(l3912<1))&&((s1<1)||(l3910<1))))) * EX((((EX(((s1<1)||(l3908<1))) + AF(((s1<1)||(l3940<1)))) + ((s...204
=> equivalent forward existential formula: [(FwdU((EY((Init * E(TRUE U (((s1>=1)&&(l3914>=1))&&(((s1<1)||(l3912<1))&&((s1<1)||(l3910<1))))))) * ((EX(((s1<1...274
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31,...1434
Detected timeout of ITS tools.
[2025-06-04 21:38:25] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:38:25] [INFO ] Applying decomposition
[2025-06-04 21:38:25] [INFO ] Flatten gal took : 8 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/graph7101381666360588648.txt' '-o' '/tmp/graph7101381666360588648.bin' '-w' '/tmp/graph7101381666360588648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7101381666360588648.bin' '-l' '-1' '-v' '-w' '/tmp/graph7101381666360588648.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:38:25] [INFO ] Decomposing Gal with order
[2025-06-04 21:38:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:38:25] [INFO ] Removed a total of 308 redundant transitions.
[2025-06-04 21:38:25] [INFO ] Flatten gal took : 30 ms
[2025-06-04 21:38:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 7 ms.
[2025-06-04 21:38:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4170028478301815767.gal : 2 ms
[2025-06-04 21:38:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2786848352552311743.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/CTLFireability4170028478301815767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2786848352552311743.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.10916e+08,16.5936,403228,2583,4159,248660,82255,663,3.55708e+06,462,706906,0
Converting to forward existential form...Done !
original formula: (EF((((u0.s1>=1)&&(u0.l3914>=1))&&(((u0.s1<1)||(u0.l3912<1))&&((u0.s1<1)||(u0.l3910<1))))) * EX((((EX(((u0.s1<1)||(u0.l3908<1))) + AF(((u...246
=> equivalent forward existential formula: [(FwdU((EY((Init * E(TRUE U (((u0.s1>=1)&&(u0.l3914>=1))&&(((u0.s1<1)||(u0.l3912<1))&&((u0.s1<1)||(u0.l3910<1)))...316
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t22, t23, t24, t25, t26, t73, t76, t79, t82, t277, t279, t281, t283, t320, t321, t32...1776
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 438 transition count 1070
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 438 transition count 1070
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 137 place count 438 transition count 1037
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 264 place count 311 transition count 910
Iterating global reduction 1 with 127 rules applied. Total rules applied 391 place count 311 transition count 910
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 1 with 228 rules applied. Total rules applied 619 place count 311 transition count 682
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 719 place count 211 transition count 582
Iterating global reduction 2 with 100 rules applied. Total rules applied 819 place count 211 transition count 582
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Iterating post reduction 2 with 172 rules applied. Total rules applied 991 place count 211 transition count 410
Applied a total of 991 rules in 32 ms. Remains 211 /490 variables (removed 279) and now considering 410/2723 (removed 2313) transitions.
// Phase 1: matrix 410 rows 211 cols
[2025-06-04 21:38:55] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:38:56] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-04 21:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:38:56] [INFO ] State equation strengthened by 215 read => feed constraints.
[2025-06-04 21:38:58] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2025-06-04 21:38:58] [INFO ] Invariant cache hit.
[2025-06-04 21:38:58] [INFO ] State equation strengthened by 215 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 4 (OVERLAPS) 410/621 variables, 211/214 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 215/429 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/429 constraints. Problems are: Problem set: 24 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/621 variables, and 429 constraints, problems are : Problem set: 24 solved, 385 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 385 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 1 (OVERLAPS) 17/203 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 3 (OVERLAPS) 8/211 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 5 (OVERLAPS) 410/621 variables, 211/214 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 215/429 constraints. Problems are: Problem set: 24 solved, 385 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 385/814 constraints. Problems are: Problem set: 24 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/621 variables, and 814 constraints, problems are : Problem set: 24 solved, 385 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 385/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 24 solved, 385 unsolved
Search for dead transitions found 24 dead transitions in 60326ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 211/490 places, 386/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 374
Applied a total of 36 rules in 4 ms. Remains 187 /211 variables (removed 24) and now considering 374/386 (removed 12) transitions.
// Phase 1: matrix 374 rows 187 cols
[2025-06-04 21:39:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:39:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-04 21:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:39:58] [INFO ] State equation strengthened by 211 read => feed constraints.
[2025-06-04 21:39:59] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/490 places, 374/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64047 ms. Remains : 187/490 places, 374/2723 transitions.
[2025-06-04 21:39:59] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:40:00] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:40:00] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-04 21:40:00] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:40:00] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:40:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3147428283826686001.gal : 2 ms
[2025-06-04 21:40:00] [INFO ] Time to serialize properties into /tmp/CTLFireability18012311005362181750.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/CTLFireability3147428283826686001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18012311005362181750.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.94842e+08,5.8325,174328,2,14564,5,390608,6,0,1122,294542,0
Converting to forward existential form...Done !
original formula: (A((EG(!(((s1<1)||(l3928<1)))) * !(((s1>=1)&&(l2664>=1)))) U EX(((s1>=1)&&(l3935>=1)))) + !(E(!((((EX(((s1>=1)&&(l3935>=1))) + !(A(((s1>=...253
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!(EX(((s1>=1)&&(l3935>=1)))) U (!((EG(!(((s1<1)||(l3928<1)))) * !(((s1>=1)&&(l2664>=1)...446
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t35,...1337
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-04 21:40:30] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:40:30] [INFO ] Applying decomposition
[2025-06-04 21:40:30] [INFO ] Flatten gal took : 8 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/graph6484721921290488142.txt' '-o' '/tmp/graph6484721921290488142.bin' '-w' '/tmp/graph6484721921290488142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6484721921290488142.bin' '-l' '-1' '-v' '-w' '/tmp/graph6484721921290488142.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:40:30] [INFO ] Decomposing Gal with order
[2025-06-04 21:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:40:30] [INFO ] Removed a total of 423 redundant transitions.
[2025-06-04 21:40:30] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 9 ms.
[2025-06-04 21:40:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9468897441344016292.gal : 3 ms
[2025-06-04 21:40:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17504400477329853269.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/CTLFireability9468897441344016292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17504400477329853269.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.94842e+08,9.04987,221228,2003,2184,127353,44238,755,1.94591e+06,292,287244,0
Converting to forward existential form...Done !
original formula: (A((EG(!(((i0.u0.s1<1)||(i0.u0.l3928<1)))) * !(((i0.u0.s1>=1)&&(i0.u7.l2664>=1)))) U EX(((i0.u0.s1>=1)&&(i0.u0.l3935>=1)))) + !(E(!((((EX...343
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!(EX(((i0.u0.s1>=1)&&(i0.u0.l3935>=1)))) U (!((EG(!(((i0.u0.s1<1)||(i0.u0.l3928<1)))) ...584
Reverse transition relation is NOT exact ! Due to transitions t56, t77, t80, t83, t86, t230, t231, t239, t240, t241, t242, t243, t304, t305, t306, t307, t3...1293
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 435 transition count 937
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 435 transition count 937
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 138 place count 435 transition count 909
Discarding 129 places :
Symmetric choice reduction at 1 with 129 rule applications. Total rules 267 place count 306 transition count 780
Iterating global reduction 1 with 129 rules applied. Total rules applied 396 place count 306 transition count 780
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 1 with 176 rules applied. Total rules applied 572 place count 306 transition count 604
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 680 place count 198 transition count 496
Iterating global reduction 2 with 108 rules applied. Total rules applied 788 place count 198 transition count 496
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 932 place count 198 transition count 352
Applied a total of 932 rules in 47 ms. Remains 198 /490 variables (removed 292) and now considering 352/2723 (removed 2371) transitions.
// Phase 1: matrix 352 rows 198 cols
[2025-06-04 21:41:00] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:41:00] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-04 21:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:41:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-04 21:41:02] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:41:02] [INFO ] Redundant transitions in 5 ms returned []
Running 351 sub problems to find dead transitions.
[2025-06-04 21:41:02] [INFO ] Invariant cache hit.
[2025-06-04 21:41:02] [INFO ] State equation strengthened by 168 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 4 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/550 variables, and 369 constraints, problems are : Problem set: 24 solved, 327 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 17/190 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 8/198 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 327/696 constraints. Problems are: Problem set: 24 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 696 constraints, problems are : Problem set: 24 solved, 327 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 327/351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 24 solved, 327 unsolved
Search for dead transitions found 24 dead transitions in 60285ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 198/490 places, 328/2723 transitions.
Graph (complete) has 712 edges and 198 vertex of which 174 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 174 transition count 316
Applied a total of 13 rules in 11 ms. Remains 174 /198 variables (removed 24) and now considering 316/328 (removed 12) transitions.
// Phase 1: matrix 316 rows 174 cols
[2025-06-04 21:42:02] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:42:02] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-04 21:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:42:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-04 21:42:04] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 174/490 places, 316/2723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64303 ms. Remains : 174/490 places, 316/2723 transitions.
[2025-06-04 21:42:04] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:42:04] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:42:04] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-04 21:42:04] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:42:04] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10902112847422359578.gal : 2 ms
[2025-06-04 21:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13268024068467493954.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/CTLFireability10902112847422359578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13268024068467493954.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,1.78768e+08,2.40463,76420,2,13837,5,170072,6,0,1012,157433,0
Converting to forward existential form...Done !
original formula: EG(A(((s1>=1)&&(l3937>=1)) U !(E(((s1>=1)&&(l3920>=1)) U ((s1>=1)&&(l3938>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(E(((s1>=1)&&(l3920>=1)) U ((s1>=1)&&(l3938>=1))))) U (!(((s1>=1)&&(l3937>=1))) * !(!(E(((s1>...274
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t14, t15, t16, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, ...1091
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-04 21:42:34] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:42:34] [INFO ] Applying decomposition
[2025-06-04 21:42:34] [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/graph3890708761105837614.txt' '-o' '/tmp/graph3890708761105837614.bin' '-w' '/tmp/graph3890708761105837614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3890708761105837614.bin' '-l' '-1' '-v' '-w' '/tmp/graph3890708761105837614.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:42:34] [INFO ] Decomposing Gal with order
[2025-06-04 21:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:42:34] [INFO ] Removed a total of 309 redundant transitions.
[2025-06-04 21:42:34] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:42:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 211 labels/synchronizations in 5 ms.
[2025-06-04 21:42:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5035388073409218365.gal : 3 ms
[2025-06-04 21:42:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17165494096426599375.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/CTLFireability5035388073409218365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17165494096426599375.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.78768e+08,2.21453,67056,1495,1375,59095,16186,683,420070,332,190053,0
Converting to forward existential form...Done !
original formula: EG(A(((i0.u0.s1>=1)&&(i0.u0.l3937>=1)) U !(E(((i0.u0.s1>=1)&&(i0.u0.l3920>=1)) U ((i0.u0.s1>=1)&&(i0.u0.l3938>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(E(((i0.u0.s1>=1)&&(i0.u0.l3920>=1)) U ((i0.u0.s1>=1)&&(i0.u0.l3938>=1))))) U (!(((i0.u0.s1>=...358
Reverse transition relation is NOT exact ! Due to transitions t1, t63, t66, t69, t72, t205, t207, t209, t211, t248, t249, t250, t251, t252, t253, t254, t25...1578
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 444 transition count 1330
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 444 transition count 1330
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 135 place count 444 transition count 1287
Discarding 123 places :
Symmetric choice reduction at 1 with 123 rule applications. Total rules 258 place count 321 transition count 1164
Iterating global reduction 1 with 123 rules applied. Total rules applied 381 place count 321 transition count 1164
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 326 transitions.
Iterating post reduction 1 with 326 rules applied. Total rules applied 707 place count 321 transition count 838
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 791 place count 237 transition count 754
Iterating global reduction 2 with 84 rules applied. Total rules applied 875 place count 237 transition count 754
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 2 with 240 rules applied. Total rules applied 1115 place count 237 transition count 514
Applied a total of 1115 rules in 60 ms. Remains 237 /490 variables (removed 253) and now considering 514/2723 (removed 2209) transitions.
// Phase 1: matrix 514 rows 237 cols
[2025-06-04 21:43:04] [INFO ] Computed 3 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-04 21:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:05] [INFO ] State equation strengthened by 297 read => feed constraints.
[2025-06-04 21:43:07] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:43:07] [INFO ] Redundant transitions in 10 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-04 21:43:07] [INFO ] Invariant cache hit.
[2025-06-04 21:43:07] [INFO ] State equation strengthened by 297 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
At refinement iteration 4 (OVERLAPS) 514/751 variables, 237/240 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 297/537 constraints. Problems are: Problem set: 24 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/751 variables, and 537 constraints, problems are : Problem set: 24 solved, 489 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 489 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 17/229 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 3 (OVERLAPS) 8/237 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 5 (OVERLAPS) 514/751 variables, 237/240 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 297/537 constraints. Problems are: Problem set: 24 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 489/1026 constraints. Problems are: Problem set: 24 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 1026 constraints, problems are : Problem set: 24 solved, 489 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 489/513 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60524ms problems are : Problem set: 24 solved, 489 unsolved
Search for dead transitions found 24 dead transitions in 60525ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 237/490 places, 490/2723 transitions.
Graph (complete) has 946 edges and 237 vertex of which 213 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 213 transition count 478
Applied a total of 13 rules in 18 ms. Remains 213 /237 variables (removed 24) and now considering 478/490 (removed 12) transitions.
// Phase 1: matrix 478 rows 213 cols
[2025-06-04 21:44:08] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:44:08] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-04 21:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:44:08] [INFO ] State equation strengthened by 293 read => feed constraints.
[2025-06-04 21:44:10] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 213/490 places, 478/2723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 65332 ms. Remains : 213/490 places, 478/2723 transitions.
[2025-06-04 21:44:10] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:44:10] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:44:10] [INFO ] Input system was already deterministic with 478 transitions.
[2025-06-04 21:44:10] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:44:10] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:44:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18426081336227829043.gal : 2 ms
[2025-06-04 21:44:10] [INFO ] Time to serialize properties into /tmp/CTLFireability257768259064988339.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/CTLFireability18426081336227829043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability257768259064988339.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.7877e+08,24.0663,598836,2,18873,5,1.08433e+06,6,0,1330,690797,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 21:44:40] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:44:40] [INFO ] Applying decomposition
[2025-06-04 21:44:40] [INFO ] Flatten gal took : 10 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/graph1267290104712971784.txt' '-o' '/tmp/graph1267290104712971784.bin' '-w' '/tmp/graph1267290104712971784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1267290104712971784.bin' '-l' '-1' '-v' '-w' '/tmp/graph1267290104712971784.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:44:40] [INFO ] Decomposing Gal with order
[2025-06-04 21:44:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:44:40] [INFO ] Removed a total of 418 redundant transitions.
[2025-06-04 21:44:40] [INFO ] Flatten gal took : 23 ms
[2025-06-04 21:44:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 5 ms.
[2025-06-04 21:44:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4314170027415328039.gal : 3 ms
[2025-06-04 21:44:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6475036984712947513.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/CTLFireability4314170027415328039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6475036984712947513.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 : 490/490 places, 2723/2723 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 448 transition count 1587
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 448 transition count 1587
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 141 place count 448 transition count 1530
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 228 place count 361 transition count 1443
Iterating global reduction 1 with 87 rules applied. Total rules applied 315 place count 361 transition count 1443
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 1 with 286 rules applied. Total rules applied 601 place count 361 transition count 1157
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 686 place count 276 transition count 1072
Iterating global reduction 2 with 85 rules applied. Total rules applied 771 place count 276 transition count 1072
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 2 with 205 rules applied. Total rules applied 976 place count 276 transition count 867
Applied a total of 976 rules in 29 ms. Remains 276 /490 variables (removed 214) and now considering 867/2723 (removed 1856) transitions.
// Phase 1: matrix 867 rows 276 cols
[2025-06-04 21:45:10] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:10] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-04 21:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:10] [INFO ] State equation strengthened by 616 read => feed constraints.
[2025-06-04 21:45:12] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2258 ms to find 0 implicit places.
Running 866 sub problems to find dead transitions.
[2025-06-04 21:45:12] [INFO ] Invariant cache hit.
[2025-06-04 21:45:12] [INFO ] State equation strengthened by 616 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
At refinement iteration 4 (OVERLAPS) 867/1143 variables, 276/279 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1143 variables, 616/895 constraints. Problems are: Problem set: 24 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 895 constraints, problems are : Problem set: 24 solved, 842 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, ReadFeed: 616/616 constraints, PredecessorRefiner: 866/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 842 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 1 (OVERLAPS) 17/268 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 3 (OVERLAPS) 8/276 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 5 (OVERLAPS) 867/1143 variables, 276/279 constraints. Problems are: Problem set: 24 solved, 842 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1143 variables, 616/895 constraints. Problems are: Problem set: 24 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 1737 constraints, problems are : Problem set: 24 solved, 842 unsolved in 30616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, ReadFeed: 616/616 constraints, PredecessorRefiner: 842/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61670ms problems are : Problem set: 24 solved, 842 unsolved
Search for dead transitions found 24 dead transitions in 61674ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 276/490 places, 843/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 252 transition count 831
Applied a total of 36 rules in 3 ms. Remains 252 /276 variables (removed 24) and now considering 831/843 (removed 12) transitions.
// Phase 1: matrix 831 rows 252 cols
[2025-06-04 21:46:14] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-04 21:46:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:14] [INFO ] State equation strengthened by 612 read => feed constraints.
[2025-06-04 21:46:19] [INFO ] Implicit Places using invariants and state equation in 5253 ms returned []
Implicit Place search using SMT with State Equation took 5383 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 252/490 places, 831/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69355 ms. Remains : 252/490 places, 831/2723 transitions.
[2025-06-04 21:46:19] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:46:19] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:46:19] [INFO ] Input system was already deterministic with 831 transitions.
[2025-06-04 21:46:19] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:46:19] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:46:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4477876172416361356.gal : 3 ms
[2025-06-04 21:46:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4055399774405377691.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/CTLFireability4477876172416361356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4055399774405377691.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 21:46:50] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:46:50] [INFO ] Applying decomposition
[2025-06-04 21:46:50] [INFO ] Flatten gal took : 17 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/graph10190250750014974590.txt' '-o' '/tmp/graph10190250750014974590.bin' '-w' '/tmp/graph10190250750014974590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10190250750014974590.bin' '-l' '-1' '-v' '-w' '/tmp/graph10190250750014974590.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:46:50] [INFO ] Decomposing Gal with order
[2025-06-04 21:46:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:46:50] [INFO ] Removed a total of 682 redundant transitions.
[2025-06-04 21:46:50] [INFO ] Flatten gal took : 42 ms
[2025-06-04 21:46:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 6 ms.
[2025-06-04 21:46:50] [INFO ] Time to serialize gal into /tmp/CTLFireability610898581799122033.gal : 4 ms
[2025-06-04 21:46:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15093787919780985316.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/CTLFireability610898581799122033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15093787919780985316.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 : 490/490 places, 2723/2723 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 437 transition count 941
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 437 transition count 941
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 130 place count 437 transition count 917
Discarding 129 places :
Symmetric choice reduction at 1 with 129 rule applications. Total rules 259 place count 308 transition count 788
Iterating global reduction 1 with 129 rules applied. Total rules applied 388 place count 308 transition count 788
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Iterating post reduction 1 with 178 rules applied. Total rules applied 566 place count 308 transition count 610
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 674 place count 200 transition count 502
Iterating global reduction 2 with 108 rules applied. Total rules applied 782 place count 200 transition count 502
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 922 place count 200 transition count 362
Applied a total of 922 rules in 25 ms. Remains 200 /490 variables (removed 290) and now considering 362/2723 (removed 2361) transitions.
// Phase 1: matrix 362 rows 200 cols
[2025-06-04 21:47:20] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:47:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 21:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:47:20] [INFO ] State equation strengthened by 176 read => feed constraints.
[2025-06-04 21:47:21] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2025-06-04 21:47:21] [INFO ] Invariant cache hit.
[2025-06-04 21:47:21] [INFO ] State equation strengthened by 176 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 4 (OVERLAPS) 362/562 variables, 200/203 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 176/379 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/379 constraints. Problems are: Problem set: 24 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 379 constraints, problems are : Problem set: 24 solved, 337 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 17/192 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 3 (OVERLAPS) 8/200 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 362/562 variables, 200/203 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 176/379 constraints. Problems are: Problem set: 24 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 337/716 constraints. Problems are: Problem set: 24 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 716 constraints, problems are : Problem set: 24 solved, 337 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 337/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 24 solved, 337 unsolved
Search for dead transitions found 24 dead transitions in 60309ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 200/490 places, 338/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 176 transition count 326
Applied a total of 36 rules in 3 ms. Remains 176 /200 variables (removed 24) and now considering 326/338 (removed 12) transitions.
// Phase 1: matrix 326 rows 176 cols
[2025-06-04 21:48:22] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:48:22] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-04 21:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:48:22] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-06-04 21:48:25] [INFO ] Implicit Places using invariants and state equation in 2855 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 176/490 places, 326/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64969 ms. Remains : 176/490 places, 326/2723 transitions.
[2025-06-04 21:48:25] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:48:25] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:48:25] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-04 21:48:25] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:48:25] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:48:25] [INFO ] Time to serialize gal into /tmp/CTLFireability14209715366444644625.gal : 1 ms
[2025-06-04 21:48:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8200529831000103423.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/CTLFireability14209715366444644625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8200529831000103423.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.8183e+08,7.07425,184760,2,13360,5,443844,6,0,1030,416419,0
Converting to forward existential form...Done !
original formula: E((E(!(((AX(((s1>=1)&&(l3933>=1))) + ((s1>=1)&&(l2810>=1))) + !(((s1>=1)&&(l3930>=1))))) U EF(((s1>=1)&&(l3439>=1)))) + ((s1>=1)&&(l195>=...184
=> equivalent forward existential formula: [(FwdU(Init,(E(!(((!(EX(!(((s1>=1)&&(l3933>=1))))) + ((s1>=1)&&(l2810>=1))) + !(((s1>=1)&&(l3930>=1))))) U E(TRU...242
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t17, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t31, ...1137
(forward)formula 0,1,16.4318,304040,1,0,648,1.09802e+06,665,300,7454,879423,815
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 435 transition count 872
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 435 transition count 872
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 134 place count 435 transition count 848
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 264 place count 305 transition count 718
Iterating global reduction 1 with 130 rules applied. Total rules applied 394 place count 305 transition count 718
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 544 place count 305 transition count 568
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 656 place count 193 transition count 456
Iterating global reduction 2 with 112 rules applied. Total rules applied 768 place count 193 transition count 456
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 904 place count 193 transition count 320
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 905 place count 192 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 906 place count 192 transition count 307
Applied a total of 906 rules in 24 ms. Remains 192 /490 variables (removed 298) and now considering 307/2723 (removed 2416) transitions.
// Phase 1: matrix 307 rows 192 cols
[2025-06-04 21:48:41] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:48:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-04 21:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:48:42] [INFO ] State equation strengthened by 127 read => feed constraints.
[2025-06-04 21:48:43] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-04 21:48:43] [INFO ] Invariant cache hit.
[2025-06-04 21:48:44] [INFO ] State equation strengthened by 127 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 4 (OVERLAPS) 307/499 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 127/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 322 constraints, problems are : Problem set: 24 solved, 282 unsolved in 25104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 17/184 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 8/192 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 307/499 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 127/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 282/604 constraints. Problems are: Problem set: 24 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 604 constraints, problems are : Problem set: 24 solved, 282 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 282/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55325ms problems are : Problem set: 24 solved, 282 unsolved
Search for dead transitions found 24 dead transitions in 55327ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/490 places, 283/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 168 transition count 271
Applied a total of 36 rules in 3 ms. Remains 168 /192 variables (removed 24) and now considering 271/283 (removed 12) transitions.
// Phase 1: matrix 271 rows 168 cols
[2025-06-04 21:49:39] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-04 21:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:39] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-06-04 21:49:40] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 168/490 places, 271/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58419 ms. Remains : 168/490 places, 271/2723 transitions.
[2025-06-04 21:49:40] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:49:40] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:49:40] [INFO ] Input system was already deterministic with 271 transitions.
[2025-06-04 21:49:40] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:49:40] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5012879774243955470.gal : 1 ms
[2025-06-04 21:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17881778429073142689.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/CTLFireability5012879774243955470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17881778429073142689.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.65756e+08,1.96457,66228,2,13407,5,144457,6,0,943,128846,0
Converting to forward existential form...Done !
original formula: (EG(EX(((EG(((s1<1)||(l2762<1))) + ((s1>=1)&&(l3915>=1))) + ((s1>=1)&&(l3938>=1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EG(EX(((EG(((s1<1)||(l2762<1))) + ((s1>=1)&&(l3915>=1))) + ((s1>=1)&&(l3938>=1)))))))) * !(FALSE)...165
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t18, t19, t20, t21, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38,...823
Using saturation style SCC detection
(forward)formula 0,1,28.1543,686664,1,0,726,3.12281e+06,550,301,6773,2.32329e+06,863
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 436 transition count 1003
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 436 transition count 1003
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 139 place count 436 transition count 972
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 267 place count 308 transition count 844
Iterating global reduction 1 with 128 rules applied. Total rules applied 395 place count 308 transition count 844
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 597 place count 308 transition count 642
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 701 place count 204 transition count 538
Iterating global reduction 2 with 104 rules applied. Total rules applied 805 place count 204 transition count 538
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 965 place count 204 transition count 378
Applied a total of 965 rules in 24 ms. Remains 204 /490 variables (removed 286) and now considering 378/2723 (removed 2345) transitions.
// Phase 1: matrix 378 rows 204 cols
[2025-06-04 21:50:08] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:08] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-04 21:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:09] [INFO ] State equation strengthened by 189 read => feed constraints.
[2025-06-04 21:50:11] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 2634 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-04 21:50:11] [INFO ] Invariant cache hit.
[2025-06-04 21:50:11] [INFO ] State equation strengthened by 189 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/204 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 4 (OVERLAPS) 378/582 variables, 204/207 constraints. Problems are: Problem set: 24 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 189/396 constraints. Problems are: Problem set: 24 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:35] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:35] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 7 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 2/398 constraints. Problems are: Problem set: 34 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 398 constraints, problems are : Problem set: 34 solved, 343 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 204/204 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 343 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 21/192 variables, 2/2 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 12/204 variables, 1/4 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/5 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 7 (OVERLAPS) 378/582 variables, 204/209 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 189/398 constraints. Problems are: Problem set: 34 solved, 343 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 343/741 constraints. Problems are: Problem set: 34 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 741 constraints, problems are : Problem set: 34 solved, 343 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 204/204 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 343/377 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 34 solved, 343 unsolved
Search for dead transitions found 34 dead transitions in 60327ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/490 places, 344/2723 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 172 transition count 330
Applied a total of 46 rules in 2 ms. Remains 172 /204 variables (removed 32) and now considering 330/344 (removed 14) transitions.
// Phase 1: matrix 330 rows 172 cols
[2025-06-04 21:51:11] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:11] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 21:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:11] [INFO ] State equation strengthened by 183 read => feed constraints.
[2025-06-04 21:51:14] [INFO ] Implicit Places using invariants and state equation in 2873 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 172/490 places, 330/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65970 ms. Remains : 172/490 places, 330/2723 transitions.
[2025-06-04 21:51:14] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:51:14] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:51:14] [INFO ] Input system was already deterministic with 330 transitions.
[2025-06-04 21:51:14] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:51:14] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:51:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9496848311725325068.gal : 2 ms
[2025-06-04 21:51:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3438590671041572369.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/CTLFireability9496848311725325068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3438590671041572369.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.76741e+08,6.68896,187172,2,12452,5,439911,6,0,1018,376559,0
Converting to forward existential form...Done !
original formula: AG(!(E(((s1>=1)&&(l3927>=1)) U (((AX(((s1>=1)&&(l3913>=1))) * (s1>=1)) * (l3932>=1)) + ((s1>=1)&&(l3920>=1))))))
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),((s1>=1)&&(l3927>=1))) * (l3932>=1)) * (s1>=1)) * !(EX(!(((s1>=1)&&(l3913>=1))))))] = ...243
Hit Full ! (commute/partial/dont) 9/307/321
(forward)formula 0,0,6.71765,187172,1,0,8,439911,15,1,1937,376559,4
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 437 transition count 1065
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 437 transition count 1065
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 140 place count 437 transition count 1031
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 267 place count 310 transition count 904
Iterating global reduction 1 with 127 rules applied. Total rules applied 394 place count 310 transition count 904
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 618 place count 310 transition count 680
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 718 place count 210 transition count 580
Iterating global reduction 2 with 100 rules applied. Total rules applied 818 place count 210 transition count 580
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 978 place count 210 transition count 420
Applied a total of 978 rules in 23 ms. Remains 210 /490 variables (removed 280) and now considering 420/2723 (removed 2303) transitions.
// Phase 1: matrix 420 rows 210 cols
[2025-06-04 21:51:21] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:21] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-04 21:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:21] [INFO ] State equation strengthened by 226 read => feed constraints.
[2025-06-04 21:51:25] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 3663 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-04 21:51:25] [INFO ] Invariant cache hit.
[2025-06-04 21:51:25] [INFO ] State equation strengthened by 226 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 4 (OVERLAPS) 420/630 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 226/439 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 0/439 constraints. Problems are: Problem set: 24 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/630 variables, and 439 constraints, problems are : Problem set: 24 solved, 395 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 395 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 17/202 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 8/210 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 5 (OVERLAPS) 420/630 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 226/439 constraints. Problems are: Problem set: 24 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 395/834 constraints. Problems are: Problem set: 24 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/630 variables, and 834 constraints, problems are : Problem set: 24 solved, 395 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 395/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 24 solved, 395 unsolved
Search for dead transitions found 24 dead transitions in 60370ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 210/490 places, 396/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 186 transition count 384
Applied a total of 36 rules in 2 ms. Remains 186 /210 variables (removed 24) and now considering 384/396 (removed 12) transitions.
// Phase 1: matrix 384 rows 186 cols
[2025-06-04 21:52:25] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:52:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-04 21:52:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:52:25] [INFO ] State equation strengthened by 222 read => feed constraints.
[2025-06-04 21:52:27] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/490 places, 384/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65463 ms. Remains : 186/490 places, 384/2723 transitions.
[2025-06-04 21:52:27] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:52:27] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:52:27] [INFO ] Input system was already deterministic with 384 transitions.
[2025-06-04 21:52:27] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:52:27] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:52:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12550912849509117394.gal : 1 ms
[2025-06-04 21:52:27] [INFO ] Time to serialize properties into /tmp/CTLFireability847191319673520727.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/CTLFireability12550912849509117394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability847191319673520727.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.94842e+08,12.1494,297828,2,15385,5,643016,6,0,1128,525578,0
Converting to forward existential form...Done !
original formula: EG(A((!(EX(((s1>=1)&&(l3910>=1)))) + ((!((s1>=1)&&(l3940>=1)))&&(((s1>=1)&&(l3913>=1))||((s1>=1)&&(l3924>=1))))) U ((s1>=1)&&(l3931>=1)))...156
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((s1>=1)&&(l3931>=1))) U (!((!(EX(((s1>=1)&&(l3910>=1)))) + ((!((s1>=1)&&(l3940>=1)))&&(((s1>=...270
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34,...1404
Detected timeout of ITS tools.
[2025-06-04 21:52:57] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:52:57] [INFO ] Applying decomposition
[2025-06-04 21:52:57] [INFO ] Flatten gal took : 9 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/graph810121998066041934.txt' '-o' '/tmp/graph810121998066041934.bin' '-w' '/tmp/graph810121998066041934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph810121998066041934.bin' '-l' '-1' '-v' '-w' '/tmp/graph810121998066041934.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:52:57] [INFO ] Decomposing Gal with order
[2025-06-04 21:52:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:52:57] [INFO ] Removed a total of 404 redundant transitions.
[2025-06-04 21:52:57] [INFO ] Flatten gal took : 18 ms
[2025-06-04 21:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 5 ms.
[2025-06-04 21:52:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15276168040223008390.gal : 3 ms
[2025-06-04 21:52:57] [INFO ] Time to serialize properties into /tmp/CTLFireability312994128992939184.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/CTLFireability15276168040223008390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability312994128992939184.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.94842e+08,8.23845,195524,3636,4146,119082,54858,814,1.85906e+06,351,152383,0
Converting to forward existential form...Done !
original formula: EG(A((!(EX(((i0.u0.s1>=1)&&(i0.u8.l3910>=1)))) + ((!((i0.u0.s1>=1)&&(i0.u0.l3940>=1)))&&(((i0.u0.s1>=1)&&(i0.u0.l3913>=1))||((i0.u0.s1>=1...216
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((i0.u0.s1>=1)&&(i0.u0.l3931>=1))) U (!((!(EX(((i0.u0.s1>=1)&&(i0.u8.l3910>=1)))) + ((!((i0.u0...354
Reverse transition relation is NOT exact ! Due to transitions t1, t30, t38, t39, t40, t41, t42, t75, t78, t81, t84, t271, t273, t275, t277, t314, t315, t31...1768
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,25.0195,385820,1,0,387007,315118,3962,2.0419e+06,2141,848985,964397
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 433 transition count 809
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 433 transition count 809
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 136 place count 433 transition count 787
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 267 place count 302 transition count 656
Iterating global reduction 1 with 131 rules applied. Total rules applied 398 place count 302 transition count 656
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 526 place count 302 transition count 528
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 642 place count 186 transition count 412
Iterating global reduction 2 with 116 rules applied. Total rules applied 758 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 874 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 876 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 878 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 879 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 880 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 884 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 888 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 900 place count 179 transition count 253
Applied a total of 900 rules in 37 ms. Remains 179 /490 variables (removed 311) and now considering 253/2723 (removed 2470) transitions.
// Phase 1: matrix 253 rows 179 cols
[2025-06-04 21:53:22] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:53:22] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-04 21:53:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:53:22] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-04 21:53:23] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-04 21:53:23] [INFO ] Invariant cache hit.
[2025-06-04 21:53:23] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 266 constraints, problems are : Problem set: 24 solved, 228 unsolved in 25099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 228/494 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:07] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:07] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:07] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:08] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:09] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 9 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 499 constraints, problems are : Problem set: 36 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55269ms problems are : Problem set: 36 solved, 216 unsolved
Search for dead transitions found 36 dead transitions in 55270ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 179/490 places, 217/2723 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 147 transition count 205
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 143 transition count 201
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 143 transition count 201
Applied a total of 52 rules in 3 ms. Remains 143 /179 variables (removed 36) and now considering 201/217 (removed 16) transitions.
// Phase 1: matrix 201 rows 143 cols
[2025-06-04 21:54:19] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:54:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 21:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:54:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:54:19] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/490 places, 201/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57128 ms. Remains : 143/490 places, 201/2723 transitions.
[2025-06-04 21:54:19] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:54:19] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:54:19] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-04 21:54:19] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:54:19] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:54:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6498565168607625931.gal : 1 ms
[2025-06-04 21:54:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1908802637233311991.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/CTLFireability6498565168607625931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1908802637233311991.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.29329e+08,0.951081,38212,2,11415,5,92368,6,0,773,98775,0
Converting to forward existential form...Done !
original formula: EX(EF(((s1>=1)&&(l3927>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((s1>=1)&&(l3927>=1)))] != FALSE
(forward)formula 0,1,1.6063,39492,1,0,9,92704,9,1,1628,98920,4
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 435 transition count 874
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 435 transition count 874
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 134 place count 435 transition count 850
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 264 place count 305 transition count 720
Iterating global reduction 1 with 130 rules applied. Total rules applied 394 place count 305 transition count 720
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 546 place count 305 transition count 568
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 658 place count 193 transition count 456
Iterating global reduction 2 with 112 rules applied. Total rules applied 770 place count 193 transition count 456
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 902 place count 193 transition count 324
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 903 place count 192 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 904 place count 192 transition count 311
Applied a total of 904 rules in 44 ms. Remains 192 /490 variables (removed 298) and now considering 311/2723 (removed 2412) transitions.
// Phase 1: matrix 311 rows 192 cols
[2025-06-04 21:54:21] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:54:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-04 21:54:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:54:21] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 21:54:22] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:54:22] [INFO ] Redundant transitions in 3 ms returned []
Running 310 sub problems to find dead transitions.
[2025-06-04 21:54:22] [INFO ] Invariant cache hit.
[2025-06-04 21:54:22] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
At refinement iteration 4 (OVERLAPS) 311/503 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 131/326 constraints. Problems are: Problem set: 24 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:38] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:38] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 3 ms to minimize.
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:39] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 3 ms to minimize.
Problem TDEAD252 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:40] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 5 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:40] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 5 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:40] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:40] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:40] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 16 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:40] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:41] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:54:41] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 17 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 18/344 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/344 constraints. Problems are: Problem set: 40 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 344 constraints, problems are : Problem set: 40 solved, 270 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 2/2 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 27/180 variables, 2/4 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 9/13 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 12/192 variables, 1/14 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 7/21 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 311/503 variables, 192/213 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 131/344 constraints. Problems are: Problem set: 40 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 270/614 constraints. Problems are: Problem set: 40 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:55:17] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 9 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 615 constraints, problems are : Problem set: 46 solved, 264 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 270/310 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 46 solved, 264 unsolved
Search for dead transitions found 46 dead transitions in 60232ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 192/490 places, 265/2723 transitions.
Graph (complete) has 608 edges and 192 vertex of which 150 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 150 transition count 247
Applied a total of 19 rules in 10 ms. Remains 150 /192 variables (removed 42) and now considering 247/265 (removed 18) transitions.
// Phase 1: matrix 247 rows 150 cols
[2025-06-04 21:55:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:55:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 21:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:55:22] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-06-04 21:55:23] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 150/490 places, 247/2723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62216 ms. Remains : 150/490 places, 247/2723 transitions.
[2025-06-04 21:55:23] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:55:23] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:55:23] [INFO ] Input system was already deterministic with 247 transitions.
[2025-06-04 21:55:23] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:55:23] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:55:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9979768944461277104.gal : 1 ms
[2025-06-04 21:55:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2762860397471603758.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/CTLFireability9979768944461277104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2762860397471603758.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.60264e+08,1.19142,41680,2,9963,5,113961,6,0,847,85797,0
Converting to forward existential form...Done !
original formula: AF(EG(E(!(AF(((s1>=1)&&(l3921>=1)))) U A(((s1>=1)&&(l3405>=1)) U EG(((s1>=1)&&(l3918>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(!(!(EG(!(((s1>=1)&&(l3921>=1)))))) U !((E(!(EG(((s1>=1)&&(l3918>=1)))) U (!(((s1>=1)&&(l3405>=...242
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t20, t21, t22, t23, t24, t25, t26, t35, t36, t37, t38, t39,...865
(forward)formula 0,0,18.3091,479320,1,0,795,2.06039e+06,540,326,6324,1.58131e+06,945
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 2723/2723 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 440 transition count 1072
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 440 transition count 1072
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 131 place count 440 transition count 1041
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 258 place count 313 transition count 914
Iterating global reduction 1 with 127 rules applied. Total rules applied 385 place count 313 transition count 914
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 1 with 228 rules applied. Total rules applied 613 place count 313 transition count 686
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 713 place count 213 transition count 586
Iterating global reduction 2 with 100 rules applied. Total rules applied 813 place count 213 transition count 586
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 2 with 164 rules applied. Total rules applied 977 place count 213 transition count 422
Applied a total of 977 rules in 27 ms. Remains 213 /490 variables (removed 277) and now considering 422/2723 (removed 2301) transitions.
// Phase 1: matrix 422 rows 213 cols
[2025-06-04 21:55:41] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:55:42] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-04 21:55:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:55:42] [INFO ] State equation strengthened by 226 read => feed constraints.
[2025-06-04 21:55:44] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2025-06-04 21:55:44] [INFO ] Invariant cache hit.
[2025-06-04 21:55:44] [INFO ] State equation strengthened by 226 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 4 (OVERLAPS) 422/635 variables, 213/216 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 226/442 constraints. Problems are: Problem set: 24 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/635 variables, and 442 constraints, problems are : Problem set: 24 solved, 397 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 17/205 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 8/213 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 422/635 variables, 213/216 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 226/442 constraints. Problems are: Problem set: 24 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 397/839 constraints. Problems are: Problem set: 24 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/635 variables, and 839 constraints, problems are : Problem set: 24 solved, 397 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 397/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60361ms problems are : Problem set: 24 solved, 397 unsolved
Search for dead transitions found 24 dead transitions in 60362ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 213/490 places, 398/2723 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 386
Applied a total of 36 rules in 2 ms. Remains 189 /213 variables (removed 24) and now considering 386/398 (removed 12) transitions.
// Phase 1: matrix 386 rows 189 cols
[2025-06-04 21:56:44] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:56:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-04 21:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:56:44] [INFO ] State equation strengthened by 222 read => feed constraints.
[2025-06-04 21:56:46] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/490 places, 386/2723 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64605 ms. Remains : 189/490 places, 386/2723 transitions.
[2025-06-04 21:56:46] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:56:46] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:56:46] [INFO ] Input system was already deterministic with 386 transitions.
[2025-06-04 21:56:46] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:56:46] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16034573219622469202.gal : 1 ms
[2025-06-04 21:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13106932317919744660.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/CTLFireability16034573219622469202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13106932317919744660.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.94964e+08,10.9878,281356,2,14772,5,546884,6,0,1142,373809,0
Converting to forward existential form...Done !
original formula: !(A(A(((EX(((s1>=1)&&(l5550>=1))) + (AX(((s1>=1)&&(l2875>=1))) * !(((s1>=1)&&(l3931>=1))))) + !(((s1>=1)&&(l3911>=1)))) U AG(EX(((s1>=1)&...257
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(((!(!((E(!(((s1>=1)&&(l3060>=1))) U (!(((s1>=1)&&(l3910>=1))) * !(((s1>=1)&&(l3060>=1))))) + ...850
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t32, t33, t34, t35, t36,...1390
Detected timeout of ITS tools.
[2025-06-04 21:57:16] [INFO ] Flatten gal took : 12 ms
[2025-06-04 21:57:16] [INFO ] Applying decomposition
[2025-06-04 21:57:16] [INFO ] Flatten gal took : 9 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/graph7972157605867311086.txt' '-o' '/tmp/graph7972157605867311086.bin' '-w' '/tmp/graph7972157605867311086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7972157605867311086.bin' '-l' '-1' '-v' '-w' '/tmp/graph7972157605867311086.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:57:16] [INFO ] Decomposing Gal with order
[2025-06-04 21:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:57:16] [INFO ] Removed a total of 550 redundant transitions.
[2025-06-04 21:57:16] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 5 ms.
[2025-06-04 21:57:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3683444505454651409.gal : 2 ms
[2025-06-04 21:57:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12153784313619851496.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/CTLFireability3683444505454651409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12153784313619851496.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 : 490/490 places, 2723/2723 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 433 transition count 809
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 433 transition count 809
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 136 place count 433 transition count 787
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 267 place count 302 transition count 656
Iterating global reduction 1 with 131 rules applied. Total rules applied 398 place count 302 transition count 656
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 526 place count 302 transition count 528
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 642 place count 186 transition count 412
Iterating global reduction 2 with 116 rules applied. Total rules applied 758 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 874 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 876 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 878 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 879 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 880 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 881 place count 183 transition count 268
Applied a total of 881 rules in 44 ms. Remains 183 /490 variables (removed 307) and now considering 268/2723 (removed 2455) transitions.
// Phase 1: matrix 268 rows 183 cols
[2025-06-04 21:57:46] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:57:46] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 21:57:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:57:47] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-04 21:57:48] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:57:48] [INFO ] Redundant transitions in 2 ms returned []
Running 267 sub problems to find dead transitions.
[2025-06-04 21:57:48] [INFO ] Invariant cache hit.
[2025-06-04 21:57:48] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:57:58] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:57:59] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:57:59] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 3/284 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/284 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/284 constraints. Problems are: Problem set: 24 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 284 constraints, problems are : Problem set: 24 solved, 243 unsolved in 24189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 17/175 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/4 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/4 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 8/183 variables, 1/5 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/6 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 268/451 variables, 183/189 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 95/284 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 243/527 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:58:30] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:58:30] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 10 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:58:41] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 6 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:58:42] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 5 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 531 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 243/267 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54378ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 54378ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 183/490 places, 222/2723 transitions.
Graph (complete) has 549 edges and 183 vertex of which 141 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 141 transition count 204
Applied a total of 19 rules in 7 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2025-06-04 21:58:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:58:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-04 21:58:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:58:43] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 21:58:43] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 141/490 places, 204/2723 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 56930 ms. Remains : 141/490 places, 204/2723 transitions.
[2025-06-04 21:58:43] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:58:43] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:58:43] [INFO ] Input system was already deterministic with 204 transitions.
RANDOM walk for 4000 steps (815 resets) in 20 ms. (190 steps per ms) remains 0/1 properties
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 21:58:43] [INFO ] Flatten gal took : 21 ms
[2025-06-04 21:58:43] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:58:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5590815320246812232.gal : 1 ms
[2025-06-04 21:58:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7662571593419765609.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5590815320246812232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7662571593419765609.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 21:58:43] [INFO ] Flatten gal took : 77 ms
[2025-06-04 21:58:43] [INFO ] Flatten gal took : 64 ms
[2025-06-04 21:58:44] [INFO ] Applying decomposition
[2025-06-04 21:58:44] [INFO ] Flatten gal took : 66 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/graph6471130819662025706.txt' '-o' '/tmp/graph6471130819662025706.bin' '-w' '/tmp/graph6471130819662025706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6471130819662025706.bin' '-l' '-1' '-v' '-w' '/tmp/graph6471130819662025706.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:58:44] [INFO ] Decomposing Gal with order
[2025-06-04 21:58:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:58:44] [INFO ] Removed a total of 1989 redundant transitions.
[2025-06-04 21:58:44] [INFO ] Flatten gal took : 602 ms
[2025-06-04 21:58:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2004 labels/synchronizations in 48 ms.
[2025-06-04 21:58:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13062429827176896497.gal : 13 ms
[2025-06-04 21:58:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7867740116129706082.ctl : 2 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/CTLFireability13062429827176896497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7867740116129706082.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 9 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.63072e+09,339.476,7335928,10497,5599,3.91266e+06,271430,1069,8.01536e+07,2843,2.89061e+06,0
Converting to forward existential form...Done !
original formula: EG((EF((((u0.s1>=1)&&(u6.l3932>=1)) + (!(E(((u0.s1>=1)&&(u0.l3935>=1)) U ((u0.s1>=1)&&(u6.l3931>=1)))) * EX(((u0.s1<1)||(u6.l3931<1))))))...298
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((u0.s1>=1)&&(u6.l3932>=1)) + (!(E(((u0.s1>=1)&&(u0.l3935>=1)) U ((u0.s1>=1)&&(u6.l3931>=1...371
Reverse transition relation is NOT exact ! Due to transitions t142, t143, t144, t145, t146, t399, t401, t402, t405, t408, t1958, t2407, t2408, t2409, t2410...11003
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 137
[2025-06-04 22:11:42] [INFO ] Flatten gal took : 496 ms
[2025-06-04 22:11:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13096263246580712456.gal : 52 ms
[2025-06-04 22:11:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7769643113907647015.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13096263246580712456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7769643113907647015.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2025-06-04 22:22:43] [INFO ] Flatten gal took : 309 ms
[2025-06-04 22:22:44] [INFO ] Input system was already deterministic with 2723 transitions.
[2025-06-04 22:22:44] [INFO ] Transformed 490 places.
[2025-06-04 22:22:44] [INFO ] Transformed 2723 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-06-04 22:22:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1557252494664611313.gal : 19 ms
[2025-06-04 22:22:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4649244107245462704.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/CTLFireability1557252494664611313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4649244107245462704.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 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="RingSingleMessageInMbox-PT-d1m010"
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 RingSingleMessageInMbox-PT-d1m010, 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 r184-tall-174889264100418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m010.tgz
mv RingSingleMessageInMbox-PT-d1m010 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 ;