About the Execution of ITS-Tools for Champagne-PT-H09T0R
| 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 | FTT?F??FT?T?T?FT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300122.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 Champagne-PT-H09T0R, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 266K Jun 5 20:08 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 Champagne-PT-H09T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H09T0R-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749328602126
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 20:36:43] [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-07 20:36:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 20:36:43] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2025-06-07 20:36:43] [INFO ] Transformed 979 places.
[2025-06-07 20:36:43] [INFO ] Transformed 1572 transitions.
[2025-06-07 20:36:43] [INFO ] Found NUPN structural information;
[2025-06-07 20:36:43] [INFO ] Parsed PT model containing 979 places and 1572 transitions and 4420 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 175 out of 979 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 979/979 places, 1572/1572 transitions.
Discarding 222 places :
Symmetric choice reduction at 0 with 222 rule applications. Total rules 222 place count 757 transition count 1350
Iterating global reduction 0 with 222 rules applied. Total rules applied 444 place count 757 transition count 1350
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 569 place count 632 transition count 1225
Iterating global reduction 0 with 125 rules applied. Total rules applied 694 place count 632 transition count 1225
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 756 place count 570 transition count 1122
Iterating global reduction 0 with 62 rules applied. Total rules applied 818 place count 570 transition count 1122
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 836 place count 570 transition count 1104
Applied a total of 836 rules in 158 ms. Remains 570 /979 variables (removed 409) and now considering 1104/1572 (removed 468) transitions.
// Phase 1: matrix 1104 rows 570 cols
[2025-06-07 20:36:43] [INFO ] Computed 49 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:36:44] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-06-07 20:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:36:44] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 1103 sub problems to find dead transitions.
[2025-06-07 20:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (OVERLAPS) 1/570 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:12] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:13] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:13] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:13] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:13] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:14] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:14] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:14] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:14] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:14] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 3 ms to minimize.
SMT process timed out in 30438ms, After SMT, problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 30454ms
Starting structural reductions in LTL mode, iteration 1 : 570/979 places, 1104/1572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31357 ms. Remains : 570/979 places, 1104/1572 transitions.
Support contains 175 out of 570 places after structural reductions.
[2025-06-07 20:37:15] [INFO ] Flatten gal took : 89 ms
[2025-06-07 20:37:15] [INFO ] Flatten gal took : 52 ms
[2025-06-07 20:37:15] [INFO ] Input system was already deterministic with 1104 transitions.
RANDOM walk for 40000 steps (59 resets) in 2436 ms. (16 steps per ms) remains 12/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
[2025-06-07 20:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 487/570 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1104/1674 variables, 570/619 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1674 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/1674 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1674/1674 variables, and 619 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 487/570 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:18] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:19] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1104/1674 variables, 570/635 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1674 variables, 11/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:20] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:20] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/1674 variables, 3/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1674 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:22] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 9 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1674 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:37:22] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/1674 variables, and 651 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6246ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Graph (trivial) has 434 edges and 570 vertex of which 49 / 570 are part of one of the 10 SCC in 4 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 531 transition count 961
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 173 rules applied. Total rules applied 265 place count 440 transition count 879
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 307 place count 401 transition count 876
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 312 place count 398 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 397 transition count 874
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 313 place count 397 transition count 852
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 357 place count 375 transition count 852
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 385 place count 347 transition count 740
Iterating global reduction 5 with 28 rules applied. Total rules applied 413 place count 347 transition count 740
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 424 place count 347 transition count 729
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 424 place count 347 transition count 723
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 436 place count 341 transition count 723
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 439 place count 338 transition count 699
Iterating global reduction 6 with 3 rules applied. Total rules applied 442 place count 338 transition count 699
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 445 place count 338 transition count 696
Performed 156 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 7 with 312 rules applied. Total rules applied 757 place count 182 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 758 place count 182 transition count 538
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 762 place count 178 transition count 511
Iterating global reduction 8 with 4 rules applied. Total rules applied 766 place count 178 transition count 511
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 770 place count 178 transition count 507
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 773 place count 178 transition count 504
Free-agglomeration rule applied 31 times.
Iterating global reduction 9 with 31 rules applied. Total rules applied 804 place count 178 transition count 473
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 9 with 174 rules applied. Total rules applied 978 place count 147 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 10 with 30 rules applied. Total rules applied 1008 place count 147 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1009 place count 146 transition count 299
Applied a total of 1009 rules in 157 ms. Remains 146 /570 variables (removed 424) and now considering 299/1104 (removed 805) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 146/570 places, 299/1104 transitions.
RANDOM walk for 30962 steps (265 resets) in 666 ms. (46 steps per ms) remains 0/11 properties
[2025-06-07 20:37:23] [INFO ] Flatten gal took : 39 ms
[2025-06-07 20:37:23] [INFO ] Flatten gal took : 41 ms
[2025-06-07 20:37:23] [INFO ] Input system was already deterministic with 1104 transitions.
Computed a total of 72 stabilizing places and 72 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 512 transition count 909
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 512 transition count 909
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 135 place count 512 transition count 890
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 154 place count 493 transition count 853
Iterating global reduction 1 with 19 rules applied. Total rules applied 173 place count 493 transition count 853
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 177 place count 493 transition count 849
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 186 place count 484 transition count 819
Iterating global reduction 2 with 9 rules applied. Total rules applied 195 place count 484 transition count 819
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 200 place count 484 transition count 814
Applied a total of 200 rules in 67 ms. Remains 484 /570 variables (removed 86) and now considering 814/1104 (removed 290) transitions.
// Phase 1: matrix 814 rows 484 cols
[2025-06-07 20:37:23] [INFO ] Computed 49 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:37:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-07 20:37:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:37:23] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 813 sub problems to find dead transitions.
[2025-06-07 20:37:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (OVERLAPS) 814/1298 variables, 484/533 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1298/1298 variables, and 533 constraints, problems are : Problem set: 0 solved, 813 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 813 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (OVERLAPS) 814/1298 variables, 484/533 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1298 variables, 813/1346 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1298/1298 variables, and 1346 constraints, problems are : Problem set: 0 solved, 813 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 813 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 484/570 places, 814/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60801 ms. Remains : 484/570 places, 814/1104 transitions.
[2025-06-07 20:38:24] [INFO ] Flatten gal took : 22 ms
[2025-06-07 20:38:24] [INFO ] Flatten gal took : 21 ms
[2025-06-07 20:38:24] [INFO ] Input system was already deterministic with 814 transitions.
[2025-06-07 20:38:24] [INFO ] Flatten gal took : 19 ms
[2025-06-07 20:38:24] [INFO ] Flatten gal took : 19 ms
[2025-06-07 20:38:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11236556253097087504.gal : 39 ms
[2025-06-07 20:38:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1817283159555858730.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/CTLFireability11236556253097087504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1817283159555858730.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:38:54] [INFO ] Flatten gal took : 30 ms
[2025-06-07 20:38:54] [INFO ] Applying decomposition
[2025-06-07 20:38:54] [INFO ] Flatten gal took : 19 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/graph17898736942679829940.txt' '-o' '/tmp/graph17898736942679829940.bin' '-w' '/tmp/graph17898736942679829940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17898736942679829940.bin' '-l' '-1' '-v' '-w' '/tmp/graph17898736942679829940.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:38:54] [INFO ] Decomposing Gal with order
[2025-06-07 20:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:38:54] [INFO ] Removed a total of 707 redundant transitions.
[2025-06-07 20:38:54] [INFO ] Flatten gal took : 82 ms
[2025-06-07 20:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 21 ms.
[2025-06-07 20:38:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8943175361121444811.gal : 10 ms
[2025-06-07 20:38:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15308376607226561433.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/CTLFireability8943175361121444811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15308376607226561433.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.11814e+46,0.581469,24320,2082,25,38054,654,1107,86842,73,1236,0
Converting to forward existential form...Done !
original formula: AG(((AG((i25.u92.p541==1)) + A(A(((i15.u57.p323==1)&&(i21.u84.p493==1)) U (i37.i1.i1.u155.p918==1)) U AF((i5.u25.p142==1)))) + (EX((((i24...232
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((EX((((i24.u88.p519==1)&&(i12.u47.p266==1))&&(i22.u79.p455==1))) + (i15.u54.p310==0...463
Reverse transition relation is NOT exact ! Due to transitions t46, t75, t114, t153, t202, t275, i0.t491, i1.t482, i2.t472, i3.t452, i4.t442, i5.t432, i6.t4...1224
Using saturation style SCC detection
Using saturation style SCC detection
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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 513 transition count 912
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 513 transition count 912
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 133 place count 513 transition count 893
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 154 place count 492 transition count 854
Iterating global reduction 1 with 21 rules applied. Total rules applied 175 place count 492 transition count 854
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 179 place count 492 transition count 850
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 484 transition count 836
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 484 transition count 836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 198 place count 484 transition count 833
Applied a total of 198 rules in 54 ms. Remains 484 /570 variables (removed 86) and now considering 833/1104 (removed 271) transitions.
// Phase 1: matrix 833 rows 484 cols
[2025-06-07 20:39:24] [INFO ] Computed 49 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:39:25] [INFO ] Implicit Places using invariants in 308 ms returned []
[2025-06-07 20:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:39:25] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 832 sub problems to find dead transitions.
[2025-06-07 20:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 832 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:43] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:44] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:44] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:44] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:44] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:45] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:45] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:39:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 832 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1317 variables, and 58 constraints, problems are : Problem set: 0 solved, 832 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 832/832 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 832 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 4 (OVERLAPS) 833/1317 variables, 484/542 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1317 variables, 832/1374 constraints. Problems are: Problem set: 0 solved, 832 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:40:15] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:40:15] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:40:15] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:40:16] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:40:16] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/1317 variables, and 1379 constraints, problems are : Problem set: 0 solved, 832 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 832/832 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 832 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 484/570 places, 833/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60906 ms. Remains : 484/570 places, 833/1104 transitions.
[2025-06-07 20:40:25] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:40:25] [INFO ] Flatten gal took : 19 ms
[2025-06-07 20:40:25] [INFO ] Input system was already deterministic with 833 transitions.
[2025-06-07 20:40:25] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:40:25] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:40:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13529844399253178993.gal : 3 ms
[2025-06-07 20:40:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5457460977488740102.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/CTLFireability13529844399253178993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5457460977488740102.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:40:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:40:56] [INFO ] Applying decomposition
[2025-06-07 20:40:56] [INFO ] Flatten gal took : 16 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/graph2311993331750829582.txt' '-o' '/tmp/graph2311993331750829582.bin' '-w' '/tmp/graph2311993331750829582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2311993331750829582.bin' '-l' '-1' '-v' '-w' '/tmp/graph2311993331750829582.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:40:56] [INFO ] Decomposing Gal with order
[2025-06-07 20:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:40:56] [INFO ] Removed a total of 750 redundant transitions.
[2025-06-07 20:40:56] [INFO ] Flatten gal took : 36 ms
[2025-06-07 20:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 17 ms.
[2025-06-07 20:40:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6608128260687419694.gal : 8 ms
[2025-06-07 20:40:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14158249066486384884.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/CTLFireability6608128260687419694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14158249066486384884.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.24818e+46,0.392133,19788,1706,37,33417,1199,1018,41565,76,2623,0
Converting to forward existential form...Done !
original formula: AF((!(E(AX(A(((i16.u60.p342==1)&&(i22.u87.p512==1)) U (i27.i3.u125.p723==1))) U (AX(((i22.u87.p520==1)&&(i28.i1.u112.p666==1))) * EF((i1....383
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(EX(!(!((E(!((i27.i3.u125.p723==1)) U (!(((i16.u60.p342==1)&&(i22.u87.p512==1))) * !((i27.i3....529
Reverse transition relation is NOT exact ! Due to transitions t46, t56, t75, t95, t114, t135, t154, t185, t204, t255, t275, t357, t477, i0.i1.t391, i1.i1.t...1386
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 511 transition count 912
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 511 transition count 912
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 137 place count 511 transition count 893
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 158 place count 490 transition count 854
Iterating global reduction 1 with 21 rules applied. Total rules applied 179 place count 490 transition count 854
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 183 place count 490 transition count 850
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 194 place count 479 transition count 807
Iterating global reduction 2 with 11 rules applied. Total rules applied 205 place count 479 transition count 807
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 211 place count 479 transition count 801
Applied a total of 211 rules in 39 ms. Remains 479 /570 variables (removed 91) and now considering 801/1104 (removed 303) transitions.
// Phase 1: matrix 801 rows 479 cols
[2025-06-07 20:41:26] [INFO ] Computed 49 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:41:26] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-07 20:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:41:26] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 800 sub problems to find dead transitions.
[2025-06-07 20:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 801/1280 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 528 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 801/1280 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 800/1328 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1328 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 479/570 places, 801/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 479/570 places, 801/1104 transitions.
[2025-06-07 20:42:27] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:42:27] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:42:27] [INFO ] Input system was already deterministic with 801 transitions.
[2025-06-07 20:42:27] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:42:27] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:42:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15759449838044501907.gal : 4 ms
[2025-06-07 20:42:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1719892736178130952.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/CTLFireability15759449838044501907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1719892736178130952.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:42:57] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:42:57] [INFO ] Applying decomposition
[2025-06-07 20:42:57] [INFO ] Flatten gal took : 18 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/graph14888020177613830139.txt' '-o' '/tmp/graph14888020177613830139.bin' '-w' '/tmp/graph14888020177613830139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14888020177613830139.bin' '-l' '-1' '-v' '-w' '/tmp/graph14888020177613830139.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:42:57] [INFO ] Decomposing Gal with order
[2025-06-07 20:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:42:57] [INFO ] Removed a total of 735 redundant transitions.
[2025-06-07 20:42:57] [INFO ] Flatten gal took : 59 ms
[2025-06-07 20:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 24 ms.
[2025-06-07 20:42:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7989160942169239147.gal : 6 ms
[2025-06-07 20:42:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5589662547473762903.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/CTLFireability7989160942169239147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5589662547473762903.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.91638e+46,0.422384,19088,1840,37,31426,1164,1005,40275,73,2531,0
Converting to forward existential form...Done !
original formula: EG(AX(!(E(EX(((i19.i0.u31.p180==1)&&(i19.i1.u60.p350==1))) U (((i32.i0.u124.p761==1)||(i37.i1.u147.p897==1))||(((i36.i0.u114.p698==1)&&(i...198
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(E(EX(((i19.i0.u31.p180==1)&&(i19.i1.u60.p350==1))) U (((i32.i0.u124.p761==1)||(i37.i1.u147.p...247
Reverse transition relation is NOT exact ! Due to transitions t8, t46, t75, t114, t153, t202, i0.i1.t243, i0.i1.u82.t247, i1.i1.t427, i2.i1.t477, i3.i0.t48...1284
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 514 transition count 936
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 514 transition count 936
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 128 place count 514 transition count 920
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 149 place count 493 transition count 881
Iterating global reduction 1 with 21 rules applied. Total rules applied 170 place count 493 transition count 881
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 174 place count 493 transition count 877
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 482 transition count 834
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 482 transition count 834
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 202 place count 482 transition count 828
Applied a total of 202 rules in 31 ms. Remains 482 /570 variables (removed 88) and now considering 828/1104 (removed 276) transitions.
// Phase 1: matrix 828 rows 482 cols
[2025-06-07 20:43:27] [INFO ] Computed 49 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:43:27] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-07 20:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:43:27] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 827 sub problems to find dead transitions.
[2025-06-07 20:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 3 (OVERLAPS) 828/1310 variables, 482/531 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/1310 variables, and 531 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 3 (OVERLAPS) 828/1310 variables, 482/531 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1310 variables, 827/1358 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/1310 variables, and 1358 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 482/570 places, 828/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 482/570 places, 828/1104 transitions.
[2025-06-07 20:44:28] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:44:28] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:44:28] [INFO ] Input system was already deterministic with 828 transitions.
[2025-06-07 20:44:28] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:44:28] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:44:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7797457360485122677.gal : 4 ms
[2025-06-07 20:44:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10591889935417769117.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/CTLFireability7797457360485122677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10591889935417769117.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:44:58] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:44:58] [INFO ] Applying decomposition
[2025-06-07 20:44:58] [INFO ] Flatten gal took : 15 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/graph8256683582130400398.txt' '-o' '/tmp/graph8256683582130400398.bin' '-w' '/tmp/graph8256683582130400398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8256683582130400398.bin' '-l' '-1' '-v' '-w' '/tmp/graph8256683582130400398.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:44:58] [INFO ] Decomposing Gal with order
[2025-06-07 20:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:44:58] [INFO ] Removed a total of 814 redundant transitions.
[2025-06-07 20:44:58] [INFO ] Flatten gal took : 48 ms
[2025-06-07 20:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 27 ms.
[2025-06-07 20:44:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18195133115458331280.gal : 4 ms
[2025-06-07 20:44:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10573628567700991891.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/CTLFireability18195133115458331280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10573628567700991891.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,2.61692e+46,1.35057,60828,2532,22,47422,654,1039,547797,61,1223,0
Converting to forward existential form...Done !
original formula: !(A(!(AX(AG(((i15.u54.p304==1)&&(i23.u82.p474==1))))) U A(E(!((((i7.u23.p123==1)&&(i13.u46.p255==1))&&(i22.u80.p461==1))) U EG(((i7.u23.p...289
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,!(!((E(!(E(E(TRUE U ((i37.i1.i2.u159.p937==1)&&(i37.i0.i1.u165.p968==1))) U ((i8.u26.p142==...2111
Reverse transition relation is NOT exact ! Due to transitions t47, t76, t115, t154, t203, t273, i0.t390, i1.t420, i2.t470, i3.t489, i4.t480, i5.t460, i6.t4...1202
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Graph (trivial) has 486 edges and 570 vertex of which 61 / 570 are part of one of the 13 SCC in 6 ms
Free SCC test removed 48 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 521 transition count 963
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 169 rules applied. Total rules applied 258 place count 433 transition count 882
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 40 rules applied. Total rules applied 298 place count 395 transition count 880
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 302 place count 393 transition count 878
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 392 transition count 878
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 303 place count 392 transition count 854
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 351 place count 368 transition count 854
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 386 place count 333 transition count 686
Iterating global reduction 5 with 35 rules applied. Total rules applied 421 place count 333 transition count 686
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 438 place count 333 transition count 669
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 438 place count 333 transition count 661
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 454 place count 325 transition count 661
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 456 place count 323 transition count 644
Iterating global reduction 6 with 2 rules applied. Total rules applied 458 place count 323 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 460 place count 323 transition count 642
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 756 place count 175 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 757 place count 175 transition count 493
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 760 place count 172 transition count 473
Iterating global reduction 8 with 3 rules applied. Total rules applied 763 place count 172 transition count 473
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 766 place count 172 transition count 470
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 768 place count 170 transition count 468
Applied a total of 768 rules in 114 ms. Remains 170 /570 variables (removed 400) and now considering 468/1104 (removed 636) transitions.
[2025-06-07 20:45:28] [INFO ] Flow matrix only has 250 transitions (discarded 218 similar events)
// Phase 1: matrix 250 rows 170 cols
[2025-06-07 20:45:28] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:45:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-07 20:45:28] [INFO ] Flow matrix only has 250 transitions (discarded 218 similar events)
[2025-06-07 20:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:45:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-07 20:45:29] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:45:29] [INFO ] Redundant transitions in 24 ms returned []
Running 381 sub problems to find dead transitions.
[2025-06-07 20:45:29] [INFO ] Flow matrix only has 250 transitions (discarded 218 similar events)
[2025-06-07 20:45:29] [INFO ] Invariant cache hit.
[2025-06-07 20:45:29] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 9/170 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 249/419 variables, 170/219 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (OVERLAPS) 0/419 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 381 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/420 variables, and 224 constraints, problems are : Problem set: 0 solved, 381 unsolved in 17386 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 9/170 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 249/419 variables, 170/219 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 381/605 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:45:54] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:00] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:00] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:01] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:01] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 1)
(t3 0)
(t4 1)
(t5 1)
(t6 1)
(t7 1)
(t8 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/420 variables, and 610 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 47458ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 47459ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/570 places, 468/1104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47879 ms. Remains : 170/570 places, 468/1104 transitions.
[2025-06-07 20:46:16] [INFO ] Flatten gal took : 11 ms
[2025-06-07 20:46:16] [INFO ] Flatten gal took : 11 ms
[2025-06-07 20:46:16] [INFO ] Input system was already deterministic with 468 transitions.
[2025-06-07 20:46:16] [INFO ] Flatten gal took : 11 ms
[2025-06-07 20:46:16] [INFO ] Flatten gal took : 11 ms
[2025-06-07 20:46:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13142142458420227306.gal : 2 ms
[2025-06-07 20:46:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7089911411160411840.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/CTLFireability13142142458420227306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7089911411160411840.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.36096e+25,0.092101,7104,2,309,5,6234,6,0,1134,2953,0
Converting to forward existential form...Done !
original formula: ((!(A(A(((p639==1)&&(p711==1)) U (p750==1)) U (((p361==1)&&(p528==1))||((p66==1)&&(p892==1))))) * !(E(EG(((p463==1)&&(p666==1))) U EF((p6...378
=> equivalent forward existential formula: (([((Init * !(EG(!((((p361==1)&&(p528==1))||((p66==1)&&(p892==1))))))) * !(E(!((((p361==1)&&(p528==1))||((p66==1...723
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 464/0/4
(forward)formula 0,0,0.318051,10688,1,0,11,40005,34,3,5451,10409,9
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 516 transition count 917
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 516 transition count 917
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 126 place count 516 transition count 899
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 146 place count 496 transition count 867
Iterating global reduction 1 with 20 rules applied. Total rules applied 166 place count 496 transition count 867
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 169 place count 496 transition count 864
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 178 place count 487 transition count 840
Iterating global reduction 2 with 9 rules applied. Total rules applied 187 place count 487 transition count 840
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 191 place count 487 transition count 836
Applied a total of 191 rules in 31 ms. Remains 487 /570 variables (removed 83) and now considering 836/1104 (removed 268) transitions.
// Phase 1: matrix 836 rows 487 cols
[2025-06-07 20:46:16] [INFO ] Computed 49 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:17] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-07 20:46:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:17] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2025-06-07 20:46:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:37] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:37] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:37] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:37] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1323 variables, and 54 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 4 (OVERLAPS) 836/1323 variables, 487/541 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1323 variables, 835/1376 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:07] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:08] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:08] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:08] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:09] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:09] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1386 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 487/570 places, 836/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60741 ms. Remains : 487/570 places, 836/1104 transitions.
[2025-06-07 20:47:17] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:47:17] [INFO ] Flatten gal took : 22 ms
[2025-06-07 20:47:17] [INFO ] Input system was already deterministic with 836 transitions.
[2025-06-07 20:47:17] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:47:17] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:47:17] [INFO ] Time to serialize gal into /tmp/CTLFireability380556356755680841.gal : 2 ms
[2025-06-07 20:47:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17813016121475274958.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/CTLFireability380556356755680841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17813016121475274958.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-07 20:47:47] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:47:47] [INFO ] Applying decomposition
[2025-06-07 20:47:47] [INFO ] Flatten gal took : 20 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/graph9404142694806026817.txt' '-o' '/tmp/graph9404142694806026817.bin' '-w' '/tmp/graph9404142694806026817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9404142694806026817.bin' '-l' '-1' '-v' '-w' '/tmp/graph9404142694806026817.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:47:47] [INFO ] Decomposing Gal with order
[2025-06-07 20:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:47:48] [INFO ] Removed a total of 751 redundant transitions.
[2025-06-07 20:47:48] [INFO ] Flatten gal took : 50 ms
[2025-06-07 20:47:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 6 ms.
[2025-06-07 20:47:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9333885037204977327.gal : 4 ms
[2025-06-07 20:47:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1697737921071093208.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/CTLFireability9333885037204977327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1697737921071093208.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,4.26369e+46,0.641458,29760,2176,42,57904,988,1102,88617,77,2242,0
Converting to forward existential form...Done !
original formula: AG(EF((((A((((i16.u60.p342==1)&&(i21.u85.p493==1))&&((i27.u100.p601==1)&&(i27.u115.p692==1))) U A((i11.u69.p384==1) U (i35.u158.p956==1))...358
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((!((E(!(!((E(!((i35.u158.p956==1)) U (!((i11.u69.p384==1)) * !((i35.u158.p956==...787
Reverse transition relation is NOT exact ! Due to transitions t56, t75, t95, t114, t134, t154, t186, t259, t278, t361, t480, i0.t405, i1.t415, i2.t465, i3....1278
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 511 transition count 901
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 511 transition count 901
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 138 place count 511 transition count 881
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 159 place count 490 transition count 842
Iterating global reduction 1 with 21 rules applied. Total rules applied 180 place count 490 transition count 842
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 184 place count 490 transition count 838
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 195 place count 479 transition count 795
Iterating global reduction 2 with 11 rules applied. Total rules applied 206 place count 479 transition count 795
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 212 place count 479 transition count 789
Applied a total of 212 rules in 32 ms. Remains 479 /570 variables (removed 91) and now considering 789/1104 (removed 315) transitions.
// Phase 1: matrix 789 rows 479 cols
[2025-06-07 20:48:18] [INFO ] Computed 49 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:48:18] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 20:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:48:18] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 788 sub problems to find dead transitions.
[2025-06-07 20:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:36] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:36] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:36] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:37] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:38] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1268 variables, and 55 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/479 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (OVERLAPS) 789/1268 variables, 479/534 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1268 variables, 788/1322 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:06] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:06] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:07] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:07] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:08] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:08] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:09] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1268/1268 variables, and 1331 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 479/570 places, 789/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60630 ms. Remains : 479/570 places, 789/1104 transitions.
[2025-06-07 20:49:18] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:49:18] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:49:18] [INFO ] Input system was already deterministic with 789 transitions.
[2025-06-07 20:49:18] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:49:18] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:49:18] [INFO ] Time to serialize gal into /tmp/CTLFireability14602684355870553469.gal : 3 ms
[2025-06-07 20:49:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17240842115792333111.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/CTLFireability14602684355870553469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17240842115792333111.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:49:48] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:49:48] [INFO ] Applying decomposition
[2025-06-07 20:49:48] [INFO ] Flatten gal took : 13 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/graph16700306444792215927.txt' '-o' '/tmp/graph16700306444792215927.bin' '-w' '/tmp/graph16700306444792215927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16700306444792215927.bin' '-l' '-1' '-v' '-w' '/tmp/graph16700306444792215927.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:49:49] [INFO ] Decomposing Gal with order
[2025-06-07 20:49:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:49:49] [INFO ] Removed a total of 733 redundant transitions.
[2025-06-07 20:49:49] [INFO ] Flatten gal took : 27 ms
[2025-06-07 20:49:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2025-06-07 20:49:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14036726746129885344.gal : 4 ms
[2025-06-07 20:49:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15707256337105331832.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/CTLFireability14036726746129885344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15707256337105331832.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.89439e+46,0.379381,17480,1592,21,27728,648,1023,40022,53,1259,0
Converting to forward existential form...Done !
original formula: EX(AX(EG(!(E((i21.u90.p505==1) U ((i7.u26.p142==1)&&(i13.u49.p277==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(E((i21.u90.p505==1) U ((i7.u26.p142==1)&&(i13.u49.p277==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t56, t75, t95, t114, t134, t153, t183, t202, t253, t272, t352, t472, i0.t377, i1.t437, i...1244
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 510 transition count 900
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 510 transition count 900
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 140 place count 510 transition count 880
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 161 place count 489 transition count 841
Iterating global reduction 1 with 21 rules applied. Total rules applied 182 place count 489 transition count 841
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 489 transition count 837
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 196 place count 479 transition count 806
Iterating global reduction 2 with 10 rules applied. Total rules applied 206 place count 479 transition count 806
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 211 place count 479 transition count 801
Applied a total of 211 rules in 33 ms. Remains 479 /570 variables (removed 91) and now considering 801/1104 (removed 303) transitions.
// Phase 1: matrix 801 rows 479 cols
[2025-06-07 20:50:19] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:50:19] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-07 20:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:50:19] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 800 sub problems to find dead transitions.
[2025-06-07 20:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 801/1280 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 528 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 801/1280 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 800/1328 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1328 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 479/570 places, 801/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 479/570 places, 801/1104 transitions.
[2025-06-07 20:51:19] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:51:19] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:51:19] [INFO ] Input system was already deterministic with 801 transitions.
[2025-06-07 20:51:19] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:51:19] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:51:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10373245072419452751.gal : 3 ms
[2025-06-07 20:51:19] [INFO ] Time to serialize properties into /tmp/CTLFireability419350294112349.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/CTLFireability10373245072419452751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability419350294112349.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 -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:51:50] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:51:50] [INFO ] Applying decomposition
[2025-06-07 20:51:50] [INFO ] Flatten gal took : 13 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/graph2191492146489687251.txt' '-o' '/tmp/graph2191492146489687251.bin' '-w' '/tmp/graph2191492146489687251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2191492146489687251.bin' '-l' '-1' '-v' '-w' '/tmp/graph2191492146489687251.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:51:50] [INFO ] Decomposing Gal with order
[2025-06-07 20:51:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:51:50] [INFO ] Removed a total of 726 redundant transitions.
[2025-06-07 20:51:50] [INFO ] Flatten gal took : 26 ms
[2025-06-07 20:51:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 9 ms.
[2025-06-07 20:51:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2369229913425201835.gal : 4 ms
[2025-06-07 20:51:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16999804397005879176.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/CTLFireability2369229913425201835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16999804397005879176.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.91372e+46,0.313276,15996,1421,37,23919,848,1006,31974,78,1740,0
Converting to forward existential form...Done !
original formula: E(EG((i25.i0.u92.p577==1)) U EG((E(EF((i34.i0.u137.p840==1)) U AG(((i2.u8.p28==1)&&(i5.i1.u53.p315==1)))) * E((i0.i2.u70.p436!=1) U AX(((...197
=> equivalent forward existential formula: [FwdG(FwdU(Init,EG((i25.i0.u92.p577==1))),(E(E(TRUE U (i34.i0.u137.p840==1)) U !(E(TRUE U !(((i2.u8.p28==1)&&(i5...265
Reverse transition relation is NOT exact ! Due to transitions t46, t75, t202, t271, i0.i1.t377, i0.i2.t272, i0.i2.u70.t276, i1.i1.t467, i2.t486, i3.t477, i...1287
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 0,0,8.16636,264956,1,0,559361,1131,6993,638875,385,3153,751989
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 510 transition count 889
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 510 transition count 889
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 141 place count 510 transition count 868
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 161 place count 490 transition count 830
Iterating global reduction 1 with 20 rules applied. Total rules applied 181 place count 490 transition count 830
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 185 place count 490 transition count 826
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 195 place count 480 transition count 790
Iterating global reduction 2 with 10 rules applied. Total rules applied 205 place count 480 transition count 790
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 210 place count 480 transition count 785
Applied a total of 210 rules in 43 ms. Remains 480 /570 variables (removed 90) and now considering 785/1104 (removed 319) transitions.
// Phase 1: matrix 785 rows 480 cols
[2025-06-07 20:51:58] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:51:58] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 20:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:51:58] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-06-07 20:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (OVERLAPS) 785/1265 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1265/1265 variables, and 529 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (OVERLAPS) 785/1265 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1265 variables, 784/1313 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:52:55] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1265/1265 variables, and 1314 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 480/570 places, 785/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 480/570 places, 785/1104 transitions.
[2025-06-07 20:52:59] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:52:59] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:52:59] [INFO ] Input system was already deterministic with 785 transitions.
[2025-06-07 20:52:59] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:52:59] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4559501777956866136.gal : 3 ms
[2025-06-07 20:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5341253809929321699.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/CTLFireability4559501777956866136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5341253809929321699.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-07 20:53:29] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:53:29] [INFO ] Applying decomposition
[2025-06-07 20:53:29] [INFO ] Flatten gal took : 15 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/graph5943400215763802516.txt' '-o' '/tmp/graph5943400215763802516.bin' '-w' '/tmp/graph5943400215763802516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5943400215763802516.bin' '-l' '-1' '-v' '-w' '/tmp/graph5943400215763802516.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:53:29] [INFO ] Decomposing Gal with order
[2025-06-07 20:53:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:53:29] [INFO ] Removed a total of 725 redundant transitions.
[2025-06-07 20:53:29] [INFO ] Flatten gal took : 25 ms
[2025-06-07 20:53:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-06-07 20:53:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9236287570717595496.gal : 4 ms
[2025-06-07 20:53:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5291806705495357082.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/CTLFireability9236287570717595496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5291806705495357082.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.06969e+46,0.379179,18368,1791,22,29661,745,996,38950,50,1507,0
Converting to forward existential form...Done !
original formula: EF(AX(E((i18.u61.p359==1) U (i32.i1.u112.p664==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E((i18.u61.p359==1) U (i32.i1.u112.p664==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t46, t75, t153, t205, i0.i1.t398, i1.i1.t487, i2.t478, i3.t468, i4.t458, i5.t448, i6.t438...1297
(forward)formula 0,1,3.18357,158528,1,0,418802,745,6384,345058,246,1507,754117
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 514 transition count 907
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 514 transition count 907
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 131 place count 514 transition count 888
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 151 place count 494 transition count 850
Iterating global reduction 1 with 20 rules applied. Total rules applied 171 place count 494 transition count 850
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 175 place count 494 transition count 846
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 186 place count 483 transition count 803
Iterating global reduction 2 with 11 rules applied. Total rules applied 197 place count 483 transition count 803
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 203 place count 483 transition count 797
Applied a total of 203 rules in 35 ms. Remains 483 /570 variables (removed 87) and now considering 797/1104 (removed 307) transitions.
// Phase 1: matrix 797 rows 483 cols
[2025-06-07 20:53:32] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:53:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-07 20:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:53:33] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2025-06-07 20:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (OVERLAPS) 1/483 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (OVERLAPS) 797/1280 variables, 483/532 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 532 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 796 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (OVERLAPS) 1/483 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (OVERLAPS) 797/1280 variables, 483/532 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 796/1328 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1328 constraints, problems are : Problem set: 0 solved, 796 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 483/570 places, 797/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 483/570 places, 797/1104 transitions.
[2025-06-07 20:54:33] [INFO ] Flatten gal took : 11 ms
[2025-06-07 20:54:33] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:54:33] [INFO ] Input system was already deterministic with 797 transitions.
[2025-06-07 20:54:33] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:54:33] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:54:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3442064273037900534.gal : 2 ms
[2025-06-07 20:54:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11949393278235393892.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/CTLFireability3442064273037900534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11949393278235393892.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:55:03] [INFO ] Flatten gal took : 19 ms
[2025-06-07 20:55:03] [INFO ] Applying decomposition
[2025-06-07 20:55:03] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8730064403670079259.txt' '-o' '/tmp/graph8730064403670079259.bin' '-w' '/tmp/graph8730064403670079259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8730064403670079259.bin' '-l' '-1' '-v' '-w' '/tmp/graph8730064403670079259.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:55:03] [INFO ] Decomposing Gal with order
[2025-06-07 20:55:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:55:03] [INFO ] Removed a total of 713 redundant transitions.
[2025-06-07 20:55:03] [INFO ] Flatten gal took : 25 ms
[2025-06-07 20:55:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 7 ms.
[2025-06-07 20:55:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8513637567837050132.gal : 4 ms
[2025-06-07 20:55:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17267614910347951636.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/CTLFireability8513637567837050132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17267614910347951636.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.9892e+46,0.470681,22512,3064,25,39143,748,1038,47723,66,1449,0
Converting to forward existential form...Done !
original formula: E(AX(!(EX(EG((i37.i2.u143.p856==1))))) U AX((AG((((i11.u39.p218==1)&&(i2.i1.u61.p353==1))&&((i4.u11.p59==1)&&(i1.u30.p182==1)))) + ((i35....198
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(EX(EG((i37.i2.u143.p856==1)))))))) * !(EX(!((!(E(TRUE U !((((i11.u39.p218==1)&&(i2.i1.u61.p...268
Reverse transition relation is NOT exact ! Due to transitions t8, t46, t77, t116, t155, t204, i0.t273, i0.i1.t378, i0.i2.t274, i0.i2.u73.t278, i1.t409, i2....1288
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Graph (trivial) has 531 edges and 570 vertex of which 64 / 570 are part of one of the 13 SCC in 2 ms
Free SCC test removed 51 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 518 transition count 948
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 188 rules applied. Total rules applied 288 place count 419 transition count 859
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 330 place count 377 transition count 859
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 330 place count 377 transition count 834
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 380 place count 352 transition count 834
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 426 place count 306 transition count 636
Iterating global reduction 3 with 46 rules applied. Total rules applied 472 place count 306 transition count 636
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 491 place count 306 transition count 617
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 491 place count 306 transition count 606
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 513 place count 295 transition count 606
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 517 place count 291 transition count 575
Iterating global reduction 4 with 4 rules applied. Total rules applied 521 place count 291 transition count 575
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 525 place count 291 transition count 571
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 5 with 290 rules applied. Total rules applied 815 place count 146 transition count 426
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 819 place count 142 transition count 399
Iterating global reduction 5 with 4 rules applied. Total rules applied 823 place count 142 transition count 399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 827 place count 142 transition count 395
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 829 place count 140 transition count 393
Applied a total of 829 rules in 85 ms. Remains 140 /570 variables (removed 430) and now considering 393/1104 (removed 711) transitions.
[2025-06-07 20:55:33] [INFO ] Flow matrix only has 146 transitions (discarded 247 similar events)
// Phase 1: matrix 146 rows 140 cols
[2025-06-07 20:55:33] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:55:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 20:55:33] [INFO ] Flow matrix only has 146 transitions (discarded 247 similar events)
[2025-06-07 20:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:55:33] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:55:33] [INFO ] Redundant transitions in 6 ms returned []
Running 299 sub problems to find dead transitions.
[2025-06-07 20:55:33] [INFO ] Flow matrix only has 146 transitions (discarded 247 similar events)
[2025-06-07 20:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 5/140 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 145/285 variables, 140/189 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/286 variables, and 189 constraints, problems are : Problem set: 0 solved, 299 unsolved in 10525 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 5/140 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 145/285 variables, 140/189 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 299/488 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:55:49] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:55:54] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/286 variables, and 490 constraints, problems are : Problem set: 0 solved, 299 unsolved in 19309 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29865ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 29866ms
Starting structural reductions in SI_CTL mode, iteration 1 : 140/570 places, 393/1104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30201 ms. Remains : 140/570 places, 393/1104 transitions.
[2025-06-07 20:56:03] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:56:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 20:56:03] [INFO ] Input system was already deterministic with 393 transitions.
[2025-06-07 20:56:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 20:56:03] [INFO ] Flatten gal took : 7 ms
[2025-06-07 20:56:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6670008716540509914.gal : 1 ms
[2025-06-07 20:56:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5320511955656553822.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/CTLFireability6670008716540509914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5320511955656553822.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,5.64694e+21,0.070437,6572,2,242,5,4095,6,0,942,1684,0
Converting to forward existential form...Done !
original formula: AG(AF(!(E(A(((p799==1)&&(p851==1)) U (p446==1)) U AG((p28==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E(!((E(!((p446==1)) U (!(((p799==1)&&(p851==1))) * !((p446==1)))) + EG(!((p446==1)))))...195
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 391/0/2
Hit Full ! (commute/partial/dont) 391/0/2
(forward)formula 0,1,0.687938,25132,1,0,14,99100,37,6,4857,100303,14
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 516 transition count 915
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 516 transition count 915
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 126 place count 516 transition count 897
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 142 place count 500 transition count 869
Iterating global reduction 1 with 16 rules applied. Total rules applied 158 place count 500 transition count 869
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 160 place count 500 transition count 867
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 170 place count 490 transition count 825
Iterating global reduction 2 with 10 rules applied. Total rules applied 180 place count 490 transition count 825
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 186 place count 490 transition count 819
Applied a total of 186 rules in 53 ms. Remains 490 /570 variables (removed 80) and now considering 819/1104 (removed 285) transitions.
// Phase 1: matrix 819 rows 490 cols
[2025-06-07 20:56:04] [INFO ] Computed 49 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:56:04] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-07 20:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:56:05] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 818 sub problems to find dead transitions.
[2025-06-07 20:56:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:25] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:25] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/1309 variables, and 51 constraints, problems are : Problem set: 0 solved, 818 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 818/818 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 818 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 4 (OVERLAPS) 819/1309 variables, 490/541 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1309 variables, 818/1359 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:53] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:54] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:54] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:54] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:55] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:55] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:55] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:55] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:56] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:56] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:56] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:57] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:58] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:58] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:56:59] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1374 constraints, problems are : Problem set: 0 solved, 818 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 818/818 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 818 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 490/570 places, 819/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60670 ms. Remains : 490/570 places, 819/1104 transitions.
[2025-06-07 20:57:05] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:57:05] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:57:05] [INFO ] Input system was already deterministic with 819 transitions.
[2025-06-07 20:57:05] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:57:05] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13716251960914596095.gal : 3 ms
[2025-06-07 20:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14750675806677848766.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/CTLFireability13716251960914596095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14750675806677848766.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:57:35] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:57:35] [INFO ] Applying decomposition
[2025-06-07 20:57:35] [INFO ] Flatten gal took : 13 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/graph2650662781588277333.txt' '-o' '/tmp/graph2650662781588277333.bin' '-w' '/tmp/graph2650662781588277333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2650662781588277333.bin' '-l' '-1' '-v' '-w' '/tmp/graph2650662781588277333.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:57:35] [INFO ] Decomposing Gal with order
[2025-06-07 20:57:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:57:35] [INFO ] Removed a total of 771 redundant transitions.
[2025-06-07 20:57:35] [INFO ] Flatten gal took : 25 ms
[2025-06-07 20:57:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 9 ms.
[2025-06-07 20:57:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14495089874424794183.gal : 4 ms
[2025-06-07 20:57:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14534363578765253462.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/CTLFireability14495089874424794183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14534363578765253462.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,5.78909e+46,0.40044,18128,1680,27,28159,745,1056,39787,76,1569,0
Converting to forward existential form...Done !
original formula: AX((A(!(AF(((i21.u74.p437==1)&&(i23.u80.p474==1)))) U ((!((i4.i1.u16.p85==1)&&(i13.i1.u45.p255==1)))||(i33.i0.u108.p638==1))) * E(EF(!(E(...413
=> equivalent forward existential formula: (([((FwdU(EY(Init),!(((!((i4.i1.u16.p85==1)&&(i13.i1.u45.p255==1)))||(i33.i0.u108.p638==1)))) * !(((!((i4.i1.u16...683
Reverse transition relation is NOT exact ! Due to transitions t57, t96, t137, t156, t187, t206, t256, t276, t483, i0.i1.t227, i0.i1.u89.t231, i1.t379, i1.i...1391
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Graph (trivial) has 440 edges and 570 vertex of which 43 / 570 are part of one of the 9 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 535 transition count 970
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 182 rules applied. Total rules applied 279 place count 439 transition count 884
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 43 rules applied. Total rules applied 322 place count 398 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 324 place count 396 transition count 882
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 324 place count 396 transition count 860
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 368 place count 374 transition count 860
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 402 place count 340 transition count 743
Iterating global reduction 4 with 34 rules applied. Total rules applied 436 place count 340 transition count 743
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 447 place count 340 transition count 732
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 447 place count 340 transition count 725
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 461 place count 333 transition count 725
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 464 place count 330 transition count 704
Iterating global reduction 5 with 3 rules applied. Total rules applied 467 place count 330 transition count 704
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 470 place count 330 transition count 701
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 6 with 302 rules applied. Total rules applied 772 place count 179 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 773 place count 179 transition count 549
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 775 place count 177 transition count 538
Iterating global reduction 7 with 2 rules applied. Total rules applied 777 place count 177 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 779 place count 177 transition count 536
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 781 place count 175 transition count 534
Applied a total of 781 rules in 64 ms. Remains 175 /570 variables (removed 395) and now considering 534/1104 (removed 570) transitions.
[2025-06-07 20:58:05] [INFO ] Flow matrix only has 303 transitions (discarded 231 similar events)
// Phase 1: matrix 303 rows 175 cols
[2025-06-07 20:58:05] [INFO ] Computed 49 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:58:05] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-07 20:58:05] [INFO ] Flow matrix only has 303 transitions (discarded 231 similar events)
[2025-06-07 20:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:58:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:58:06] [INFO ] Redundant transitions in 5 ms returned []
Running 451 sub problems to find dead transitions.
[2025-06-07 20:58:06] [INFO ] Flow matrix only has 303 transitions (discarded 231 similar events)
[2025-06-07 20:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (OVERLAPS) 12/175 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 302/477 variables, 175/224 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 451 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/478 variables, and 224 constraints, problems are : Problem set: 0 solved, 451 unsolved in 22435 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (OVERLAPS) 12/175 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 302/477 variables, 175/224 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 451/675 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 451 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/478 variables, and 675 constraints, problems are : Problem set: 0 solved, 451 unsolved in 23782 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46279ms problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 46280ms
Starting structural reductions in SI_CTL mode, iteration 1 : 175/570 places, 534/1104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46718 ms. Remains : 175/570 places, 534/1104 transitions.
[2025-06-07 20:58:52] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:58:52] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:58:52] [INFO ] Input system was already deterministic with 534 transitions.
[2025-06-07 20:58:52] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:58:52] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:58:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1629995571928921366.gal : 2 ms
[2025-06-07 20:58:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4155832139220032656.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/CTLFireability1629995571928921366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4155832139220032656.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,4.79894e+25,0.105144,7552,2,350,5,7977,6,0,1227,3280,0
Converting to forward existential form...Done !
original formula: E((((((((p14==1)&&(p33==1))&&((p52==1)&&(p71==1)))&&(((p90==1)&&(p109==1))&&((p128==1)&&(p147==1))))&&((((p166==1)&&(p185==1))&&((p204==1...1163
=> equivalent forward existential formula: (([(FwdU((FwdU(FwdU(Init,(((((((p14==1)&&(p33==1))&&((p52==1)&&(p71==1)))&&(((p90==1)&&(p109==1))&&((p128==1)&&(...4425
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 484/2352/50
Hit Full ! (commute/partial/dont) 501/0/33
Hit Full ! (commute/partial/dont) 521/12/13
(forward)formula 0,1,0.499963,16128,1,0,15,67717,36,3,6981,29168,15
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 515 transition count 894
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 515 transition count 894
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 131 place count 515 transition count 873
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 148 place count 498 transition count 838
Iterating global reduction 1 with 17 rules applied. Total rules applied 165 place count 498 transition count 838
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 168 place count 498 transition count 835
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 177 place count 489 transition count 797
Iterating global reduction 2 with 9 rules applied. Total rules applied 186 place count 489 transition count 797
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 191 place count 489 transition count 792
Applied a total of 191 rules in 36 ms. Remains 489 /570 variables (removed 81) and now considering 792/1104 (removed 312) transitions.
// Phase 1: matrix 792 rows 489 cols
[2025-06-07 20:58:52] [INFO ] Computed 49 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:58:53] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-07 20:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:58:53] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 791 sub problems to find dead transitions.
[2025-06-07 20:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 3 (OVERLAPS) 792/1281 variables, 489/538 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/1281 variables, and 538 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 791 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 3 (OVERLAPS) 792/1281 variables, 489/538 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 791/1329 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 1329 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 791 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 489/570 places, 792/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60698 ms. Remains : 489/570 places, 792/1104 transitions.
[2025-06-07 20:59:53] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:59:53] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:59:53] [INFO ] Input system was already deterministic with 792 transitions.
[2025-06-07 20:59:53] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:59:53] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:59:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2808005751434843645.gal : 2 ms
[2025-06-07 20:59:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16780826201564142679.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/CTLFireability2808005751434843645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16780826201564142679.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 21:00:23] [INFO ] Flatten gal took : 13 ms
[2025-06-07 21:00:23] [INFO ] Applying decomposition
[2025-06-07 21:00:23] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13879263551475210134.txt' '-o' '/tmp/graph13879263551475210134.bin' '-w' '/tmp/graph13879263551475210134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13879263551475210134.bin' '-l' '-1' '-v' '-w' '/tmp/graph13879263551475210134.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:00:23] [INFO ] Decomposing Gal with order
[2025-06-07 21:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:00:23] [INFO ] Removed a total of 707 redundant transitions.
[2025-06-07 21:00:23] [INFO ] Flatten gal took : 24 ms
[2025-06-07 21:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2025-06-07 21:00:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12865683901993748271.gal : 5 ms
[2025-06-07 21:00:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7968695474677177817.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/CTLFireability12865683901993748271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7968695474677177817.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,5.23808e+46,0.662555,23628,2387,24,35321,697,1073,64990,62,1288,0
Converting to forward existential form...Done !
original formula: (EF(((EX(EX(A((i10.u36.p196==1) U (i3.u11.p47==1)))) + (i42.i0.u159.p938==1)) + (i7.u25.p130==1))) * E(((((i32.u109.p641==1) + E((i30.i0....262
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((EX(EX(!((E(!((i3.u11.p47==1)) U (!((i10.u36.p196==1)) * !((i3.u11.p47==1)))) + EG(!((i...385
Reverse transition relation is NOT exact ! Due to transitions t8, t27, t49, t78, t120, t159, t210, t279, i0.i1.t394, i1.i1.t457, i2.t496, i3.t487, i4.t477,...1307
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Graph (trivial) has 534 edges and 570 vertex of which 68 / 570 are part of one of the 14 SCC in 2 ms
Free SCC test removed 54 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 515 transition count 945
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 188 rules applied. Total rules applied 288 place count 416 transition count 856
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 330 place count 374 transition count 856
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 330 place count 374 transition count 832
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 378 place count 350 transition count 832
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 423 place count 305 transition count 641
Iterating global reduction 3 with 45 rules applied. Total rules applied 468 place count 305 transition count 641
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 487 place count 305 transition count 622
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 487 place count 305 transition count 611
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 509 place count 294 transition count 611
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 513 place count 290 transition count 580
Iterating global reduction 4 with 4 rules applied. Total rules applied 517 place count 290 transition count 580
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 521 place count 290 transition count 576
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 5 with 294 rules applied. Total rules applied 815 place count 143 transition count 429
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 819 place count 139 transition count 402
Iterating global reduction 5 with 4 rules applied. Total rules applied 823 place count 139 transition count 402
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 827 place count 139 transition count 398
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 829 place count 137 transition count 396
Applied a total of 829 rules in 56 ms. Remains 137 /570 variables (removed 433) and now considering 396/1104 (removed 708) transitions.
[2025-06-07 21:00:53] [INFO ] Flow matrix only has 136 transitions (discarded 260 similar events)
// Phase 1: matrix 136 rows 137 cols
[2025-06-07 21:00:53] [INFO ] Computed 49 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:00:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-07 21:00:54] [INFO ] Flow matrix only has 136 transitions (discarded 260 similar events)
[2025-06-07 21:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:00:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:00:54] [INFO ] Redundant transitions in 2 ms returned []
Running 296 sub problems to find dead transitions.
[2025-06-07 21:00:54] [INFO ] Flow matrix only has 136 transitions (discarded 260 similar events)
[2025-06-07 21:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 135/272 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/273 variables, and 186 constraints, problems are : Problem set: 0 solved, 296 unsolved in 10021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 135/272 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 296/482 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/273 variables, and 482 constraints, problems are : Problem set: 0 solved, 296 unsolved in 10235 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20289ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 20290ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/570 places, 396/1104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20603 ms. Remains : 137/570 places, 396/1104 transitions.
[2025-06-07 21:01:14] [INFO ] Flatten gal took : 11 ms
[2025-06-07 21:01:14] [INFO ] Flatten gal took : 6 ms
[2025-06-07 21:01:14] [INFO ] Input system was already deterministic with 396 transitions.
[2025-06-07 21:01:14] [INFO ] Flatten gal took : 6 ms
[2025-06-07 21:01:14] [INFO ] Flatten gal took : 6 ms
[2025-06-07 21:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10985100769132063977.gal : 2 ms
[2025-06-07 21:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13583696415193672263.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/CTLFireability10985100769132063977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13583696415193672263.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,3.27887e+21,0.069277,6460,2,226,5,3848,6,0,933,1596,0
Converting to forward existential form...Done !
original formula: EF(AG(((p266==1)&&(p471==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p266==1)&&(p471==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.196697,7356,1,0,7,18533,15,1,4190,3296,5
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 1104/1104 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 510 transition count 900
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 510 transition count 900
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 140 place count 510 transition count 880
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 161 place count 489 transition count 841
Iterating global reduction 1 with 21 rules applied. Total rules applied 182 place count 489 transition count 841
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 489 transition count 837
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 197 place count 478 transition count 794
Iterating global reduction 2 with 11 rules applied. Total rules applied 208 place count 478 transition count 794
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 214 place count 478 transition count 788
Applied a total of 214 rules in 26 ms. Remains 478 /570 variables (removed 92) and now considering 788/1104 (removed 316) transitions.
// Phase 1: matrix 788 rows 478 cols
[2025-06-07 21:01:14] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:01:14] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-07 21:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:01:15] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 787 sub problems to find dead transitions.
[2025-06-07 21:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 3 (OVERLAPS) 788/1266 variables, 478/527 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1266/1266 variables, and 527 constraints, problems are : Problem set: 0 solved, 787 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 787/787 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 787 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 3 (OVERLAPS) 788/1266 variables, 478/527 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1266 variables, 787/1314 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1266 variables, and 1314 constraints, problems are : Problem set: 0 solved, 787 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 787/787 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 787 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 478/570 places, 788/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60627 ms. Remains : 478/570 places, 788/1104 transitions.
[2025-06-07 21:02:15] [INFO ] Flatten gal took : 11 ms
[2025-06-07 21:02:15] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:02:15] [INFO ] Input system was already deterministic with 788 transitions.
[2025-06-07 21:02:15] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:02:15] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:02:15] [INFO ] Time to serialize gal into /tmp/CTLFireability487341382442007135.gal : 3 ms
[2025-06-07 21:02:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4533197861076686317.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/CTLFireability487341382442007135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4533197861076686317.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 21:02:45] [INFO ] Flatten gal took : 17 ms
[2025-06-07 21:02:45] [INFO ] Applying decomposition
[2025-06-07 21:02:45] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8836377415804063833.txt' '-o' '/tmp/graph8836377415804063833.bin' '-w' '/tmp/graph8836377415804063833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8836377415804063833.bin' '-l' '-1' '-v' '-w' '/tmp/graph8836377415804063833.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:02:45] [INFO ] Decomposing Gal with order
[2025-06-07 21:02:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:02:45] [INFO ] Removed a total of 727 redundant transitions.
[2025-06-07 21:02:45] [INFO ] Flatten gal took : 25 ms
[2025-06-07 21:02:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 12 ms.
[2025-06-07 21:02:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9162329580811550681.gal : 4 ms
[2025-06-07 21:02:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7202779070239782553.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/CTLFireability9162329580811550681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7202779070239782553.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.72474e+46,0.356503,15612,1297,24,22494,587,1016,31550,55,1108,0
Converting to forward existential form...Done !
original formula: EF(AG(AX(((i8.u28.p161==1)&&(i19.i1.u69.p410==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((i8.u28.p161==1)&&(i19.i1.u69.p410==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t114, t153, t202, i0.i1.t396, i1.i1.t466, i2.t485, i3.t476, i4.t456, i5.t446, i6.t436, i...1285
(forward)formula 0,1,2.51743,109436,1,0,302532,587,6485,217671,268,1108,528622
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2025-06-07 21:02:48] [INFO ] Flatten gal took : 20 ms
[2025-06-07 21:02:48] [INFO ] Flatten gal took : 17 ms
[2025-06-07 21:02:48] [INFO ] Applying decomposition
[2025-06-07 21:02:48] [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/graph8410343123119978784.txt' '-o' '/tmp/graph8410343123119978784.bin' '-w' '/tmp/graph8410343123119978784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8410343123119978784.bin' '-l' '-1' '-v' '-w' '/tmp/graph8410343123119978784.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:02:48] [INFO ] Decomposing Gal with order
[2025-06-07 21:02:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:02:48] [INFO ] Removed a total of 1095 redundant transitions.
[2025-06-07 21:02:48] [INFO ] Flatten gal took : 31 ms
[2025-06-07 21:02:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2025-06-07 21:02:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9193845059845884475.gal : 5 ms
[2025-06-07 21:02:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8041823769066498000.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/CTLFireability9193845059845884475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8041823769066498000.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 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,1.02515e+50,0.703231,29700,2803,40,52727,931,1283,87682,86,2438,0
Converting to forward existential form...Done !
original formula: AG(((AG((i19.u106.p541==1)) + A(A(((i15.u66.p323==1)&&(i25.u96.p493==1)) U (i32.i0.i2.u179.p918==1)) U AF((i8.u30.p142==1)))) + (EX((((i2...234
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((EX((((i23.u102.p519==1)&&(i11.u55.p266==1))&&(i21.u90.p455==1))) + (i15.u63.p310==...465
Reverse transition relation is NOT exact ! Due to transitions t65, t86, t109, t145, t196, t222, t244, t326, t560, i0.t448, i0.t443, i0.t338, i0.u80.t342, i...1597
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
(forward)formula 0,0,636.246,2435000,1,0,3.40288e+06,1050,4764,1.00718e+07,231,3243,835291
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((!(E(AX(A(((i13.u69.p342==1)&&(i23.u100.p512==1)) U (i29.u144.p723==1))) U (AX(((i23.u102.p520==1)&&(i26.u130.p666==1))) * EF((i6.u23....366
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(EX(!(!((E(!((i29.u144.p723==1)) U (!(((i13.u69.p342==1)&&(i23.u100.p512==1))) * !((i29.u144....506
(forward)formula 1,1,1152.84,2995812,1,0,3.7176e+06,1139,4176,1.74803e+07,218,3464,1611309
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(AX(!(E(EX(((i10.u37.p180==1)&&(i3.u70.p350==1))) U (((i32.i0.i0.u150.p761==1)||(i33.u173.p897==1))||(((i27.u135.p698==1)&&(i0.u48.p237...185
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(E(EX(((i10.u37.p180==1)&&(i3.u70.p350==1))) U (((i32.i0.i0.u150.p761==1)||(i33.u173.p897==1)...234
(forward)formula 2,1,1315.04,3373436,1,0,5.4252e+06,1139,3424,1.95967e+07,178,3464,4666392
FORMULA Champagne-PT-H09T0R-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-07 21:31:29] [INFO ] Applying decomposition
[2025-06-07 21:31:29] [INFO ] Flatten gal took : 18 ms
[2025-06-07 21:31:29] [INFO ] Decomposing Gal with order
[2025-06-07 21:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:31:29] [INFO ] Removed a total of 920 redundant transitions.
[2025-06-07 21:31:29] [INFO ] Flatten gal took : 28 ms
[2025-06-07 21:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 15 ms.
[2025-06-07 21:31:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17031004884158517382.gal : 4 ms
[2025-06-07 21:31:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4211021659230584678.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/CTLFireability17031004884158517382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4211021659230584678.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 6 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.02515e+50,0.382605,20704,1257,492,32436,2091,1053,80704,231,17857,0
Converting to forward existential form...Done !
original formula: !(A(!(AX(AG(((i1.i0.i0.i0.i0.i0.i0.i0.i0.u36.p304==1)&&(i1.i1.i0.i0.i0.i0.i0.i0.u52.p474==1))))) U A(E(!((((i0.i0.i0.i0.i0.i0.i0.u17.p123...495
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,!(!((E(!(E(E(TRUE U ((i1.i1.i1.i1.i1.i1.i1.i0.u93.p937==1)&&(i1.i1.i1.i1.i1.i1.i1.i1.u96.p9...3385
Reverse transition relation is NOT exact ! Due to transitions i0.t443, i0.u23.t448, i0.i0.u22.t458, i0.i0.i0.u21.t467, i0.i0.i0.u21.t469, i0.i0.i0.i0.u20.t...3651
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="Champagne-PT-H09T0R"
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 Champagne-PT-H09T0R, 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 r254-tall-174931339300122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H09T0R.tgz
mv Champagne-PT-H09T0R 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 ;