About the Execution of ITS-Tools for NoC3x3-PT-3A
| 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 | FFFFFTF?FF?TTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100186.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 NoC3x3-PT-3A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 133K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2023-12
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2023-13
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2023-14
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2023-15
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-00
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-01
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-02
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-03
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-04
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-05
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-06
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-07
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-08
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-09
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-10
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748818685127
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 22:58:06] [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-01 22:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:58:06] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-01 22:58:06] [INFO ] Transformed 370 places.
[2025-06-01 22:58:06] [INFO ] Transformed 450 transitions.
[2025-06-01 22:58:06] [INFO ] Found NUPN structural information;
[2025-06-01 22:58:06] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 195 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 362 transition count 449
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 61 place count 309 transition count 393
Ensure Unique test removed 16 places
Iterating global reduction 1 with 69 rules applied. Total rules applied 130 place count 293 transition count 393
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 166 place count 293 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 190 place count 293 transition count 333
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 195 place count 288 transition count 333
Applied a total of 195 rules in 63 ms. Remains 288 /370 variables (removed 82) and now considering 333/449 (removed 116) transitions.
[2025-06-01 22:58:06] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
// Phase 1: matrix 305 rows 288 cols
[2025-06-01 22:58:06] [INFO ] Computed 98 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:58:07] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-06-01 22:58:07] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
[2025-06-01 22:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:58:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 22:58:07] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-01 22:58:07] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
[2025-06-01 22:58:07] [INFO ] Invariant cache hit.
[2025-06-01 22:58:07] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 4/288 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 304/592 variables, 288/386 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 11/397 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 1/593 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 398 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 288/288 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 4/288 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 304/592 variables, 288/386 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 11/397 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 332/729 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (OVERLAPS) 1/593 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 730 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 288/288 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 288/370 places, 333/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60831 ms. Remains : 288/370 places, 333/449 transitions.
Support contains 195 out of 288 places after structural reductions.
[2025-06-01 22:59:07] [INFO ] Flatten gal took : 54 ms
[2025-06-01 22:59:07] [INFO ] Flatten gal took : 27 ms
[2025-06-01 22:59:07] [INFO ] Input system was already deterministic with 333 transitions.
Support contains 192 out of 288 places (down from 195) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 109 to 108
RANDOM walk for 40000 steps (8 resets) in 2030 ms. (19 steps per ms) remains 2/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38468 steps (8 resets) in 113 ms. (337 steps per ms) remains 0/1 properties
[2025-06-01 22:59:08] [INFO ] Flatten gal took : 22 ms
[2025-06-01 22:59:08] [INFO ] Flatten gal took : 22 ms
[2025-06-01 22:59:08] [INFO ] Input system was already deterministic with 333 transitions.
Computed a total of 5 stabilizing places and 1 stable transitions
Graph (complete) has 921 edges and 288 vertex of which 284 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 274 transition count 333
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 74 place count 214 transition count 251
Ensure Unique test removed 27 places
Iterating global reduction 1 with 87 rules applied. Total rules applied 161 place count 187 transition count 251
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 195 place count 187 transition count 217
Applied a total of 195 rules in 17 ms. Remains 187 /288 variables (removed 101) and now considering 217/333 (removed 116) transitions.
[2025-06-01 22:59:08] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2025-06-01 22:59:08] [INFO ] Computed 57 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:08] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-01 22:59:08] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2025-06-01 22:59:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:59:08] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-01 22:59:08] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2025-06-01 22:59:08] [INFO ] Invariant cache hit.
[2025-06-01 22:59:08] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 1/396 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 254 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9253 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 216/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 470 constraints, problems are : Problem set: 0 solved, 216 unsolved in 20545 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29827ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 29828ms
Starting structural reductions in LTL mode, iteration 1 : 187/288 places, 217/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30107 ms. Remains : 187/288 places, 217/333 transitions.
[2025-06-01 22:59:38] [INFO ] Flatten gal took : 17 ms
[2025-06-01 22:59:38] [INFO ] Flatten gal took : 11 ms
[2025-06-01 22:59:38] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-01 22:59:38] [INFO ] Flatten gal took : 10 ms
[2025-06-01 22:59:38] [INFO ] Flatten gal took : 13 ms
[2025-06-01 22:59:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13248881061460393002.gal : 4 ms
[2025-06-01 22:59:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11595386277809549377.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13248881061460393002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11595386277809549377.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,9.95167e+22,0.450736,21668,2,1540,5,96170,6,0,958,91639,0
Converting to forward existential form...Done !
original formula: AG(!(A(((p141==1)&&(p205==1)) U EX((((((p293==1)&&(p345==1))||((p141==1)&&(p194==1)))&&(p122==1))&&(p144==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX((((((p293==1)&&(p345==1))||((p141==1)&&(p194==1)))&&(p122==1))&&(p144==1))))))) *...367
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,1.09958,37224,1,0,13,217129,19,7,4791,95368,14
FORMULA NoC3x3-PT-3A-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 274 transition count 333
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 73 place count 215 transition count 254
Ensure Unique test removed 26 places
Iterating global reduction 1 with 85 rules applied. Total rules applied 158 place count 189 transition count 254
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 192 place count 189 transition count 220
Applied a total of 192 rules in 9 ms. Remains 189 /288 variables (removed 99) and now considering 220/333 (removed 113) transitions.
[2025-06-01 22:59:40] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:59:40] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-01 22:59:40] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2025-06-01 22:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:59:40] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-01 22:59:40] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2025-06-01 22:59:40] [INFO ] Invariant cache hit.
[2025-06-01 22:59:40] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 257 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11179 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 219/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21940 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33144ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 33145ms
Starting structural reductions in LTL mode, iteration 1 : 189/288 places, 220/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33382 ms. Remains : 189/288 places, 220/333 transitions.
[2025-06-01 23:00:13] [INFO ] Flatten gal took : 12 ms
[2025-06-01 23:00:13] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:00:13] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-01 23:00:13] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:00:13] [INFO ] Flatten gal took : 10 ms
[2025-06-01 23:00:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7252693116108146857.gal : 5 ms
[2025-06-01 23:00:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5217856521095782146.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/CTLFireability7252693116108146857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5217856521095782146.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07934e+23,0.552785,23160,2,1609,5,102967,6,0,969,99589,0
Converting to forward existential form...Done !
original formula: EF(AX((AX((((p300==0)||(p345==0))&&((p92==0)||(p116==0)))) + (AX(((p150==0)||(p215==0))) * AF(((p162==0)||(p194==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(EX(!((((p300==0)||(p345==0))&&((p92==0)||(p116==0)))))) + (!(EX(!(((p150==0)||(p21...215
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.45531,42768,1,0,19,248006,23,8,4719,140569,12
FORMULA NoC3x3-PT-3A-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Graph (complete) has 921 edges and 288 vertex of which 284 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 places
Reduce places removed 11 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 273 transition count 297
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 76 place count 235 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 235 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 233 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 233 transition count 293
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 232 transition count 293
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 141 place count 172 transition count 213
Ensure Unique test removed 27 places
Iterating global reduction 2 with 87 rules applied. Total rules applied 228 place count 145 transition count 213
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 2 with 57 rules applied. Total rules applied 285 place count 145 transition count 156
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 40 rules applied. Total rules applied 325 place count 117 transition count 144
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 329 place count 113 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 330 place count 113 transition count 143
Applied a total of 330 rules in 35 ms. Remains 113 /288 variables (removed 175) and now considering 143/333 (removed 190) transitions.
[2025-06-01 23:00:14] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 113 cols
[2025-06-01 23:00:14] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-01 23:00:15] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2025-06-01 23:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 23:00:15] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 23:00:15] [INFO ] Redundant transitions in 52 ms returned [24, 30, 31, 42, 43, 65, 66, 69, 79, 92, 93, 95, 99, 102, 103, 104, 119, 120, 122, 126, 127, 128, 129, 135]
Found 24 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 24 transitions
Redundant transitions reduction (with SMT) removed 24 transitions.
Running 95 sub problems to find dead transitions.
[2025-06-01 23:00:15] [INFO ] Flow matrix only has 118 transitions (discarded 1 similar events)
// Phase 1: matrix 118 rows 113 cols
[2025-06-01 23:00:15] [INFO ] Computed 47 invariants in 1 ms
[2025-06-01 23:00:15] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 12/113 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 117/230 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/231 variables, and 169 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1847 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 12/113 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 117/230 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 95/264 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/231 variables, and 264 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2651 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4507ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4507ms
Starting structural reductions in SI_CTL mode, iteration 1 : 113/288 places, 119/333 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 113 transition count 108
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 91 transition count 108
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 37 place count 91 transition count 104
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 38 edges and 83 vertex of which 10 / 83 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 50 place count 78 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 55 place count 78 transition count 95
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 79 place count 62 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 60 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 33 edges and 60 vertex of which 10 / 60 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 86 place count 55 transition count 83
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 91 place count 55 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 102 place count 55 transition count 67
Applied a total of 102 rules in 25 ms. Remains 55 /113 variables (removed 58) and now considering 67/119 (removed 52) transitions.
[2025-06-01 23:00:19] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
// Phase 1: matrix 66 rows 55 cols
[2025-06-01 23:00:19] [INFO ] Computed 23 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-01 23:00:19] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-01 23:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 23:00:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/288 places, 67/333 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4849 ms. Remains : 55/288 places, 67/333 transitions.
[2025-06-01 23:00:19] [INFO ] Flatten gal took : 3 ms
[2025-06-01 23:00:19] [INFO ] Flatten gal took : 14 ms
[2025-06-01 23:00:19] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-01 23:00:19] [INFO ] Flatten gal took : 3 ms
[2025-06-01 23:00:19] [INFO ] Flatten gal took : 2 ms
[2025-06-01 23:00:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2692403833546667254.gal : 0 ms
[2025-06-01 23:00:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5919868834681196663.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/CTLFireability2692403833546667254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5919868834681196663.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.79159e+08,0.014485,4344,2,144,5,2356,5,0,288,2309,0
Converting to forward existential form...Done !
original formula: EF(AG(((p205==0)&&((p166==0)||(p194==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p205==0)&&((p166==0)||(p194==0)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.026458,4728,1,0,6,5415,13,0,1298,2309,5
FORMULA NoC3x3-PT-3A-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 276 transition count 333
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 58 place count 230 transition count 274
Ensure Unique test removed 21 places
Iterating global reduction 1 with 67 rules applied. Total rules applied 125 place count 209 transition count 274
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 156 place count 209 transition count 243
Applied a total of 156 rules in 6 ms. Remains 209 /288 variables (removed 79) and now considering 243/333 (removed 90) transitions.
[2025-06-01 23:00:19] [INFO ] Flow matrix only has 229 transitions (discarded 14 similar events)
// Phase 1: matrix 229 rows 209 cols
[2025-06-01 23:00:19] [INFO ] Computed 65 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 23:00:19] [INFO ] Flow matrix only has 229 transitions (discarded 14 similar events)
[2025-06-01 23:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:00:20] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-01 23:00:20] [INFO ] Flow matrix only has 229 transitions (discarded 14 similar events)
[2025-06-01 23:00:20] [INFO ] Invariant cache hit.
[2025-06-01 23:00:20] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/209 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 228/437 variables, 209/274 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 1/438 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/438 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 284 constraints, problems are : Problem set: 0 solved, 242 unsolved in 14402 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 209/209 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/209 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 228/437 variables, 209/274 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 242/525 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/438 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (OVERLAPS) 0/438 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 526 constraints, problems are : Problem set: 0 solved, 242 unsolved in 29823 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 209/209 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44251ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44253ms
Starting structural reductions in LTL mode, iteration 1 : 209/288 places, 243/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44498 ms. Remains : 209/288 places, 243/333 transitions.
[2025-06-01 23:01:04] [INFO ] Flatten gal took : 11 ms
[2025-06-01 23:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:01:04] [INFO ] Input system was already deterministic with 243 transitions.
[2025-06-01 23:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17556695871007321978.gal : 3 ms
[2025-06-01 23:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4293975866194547153.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/CTLFireability17556695871007321978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4293975866194547153.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.20368e+24,1.577,54812,2,2411,5,246034,6,0,1069,264161,0
Converting to forward existential form...Done !
original formula: (EX((((p70==0)||(p88==0)) + EX(((p94==0)||(p124==0))))) * E((((((p230==1)&&(p266==1)) + EX(((p162==1)&&(p194==1)))) + (((p307==1)&&(p326=...750
=> equivalent forward existential formula: [((FwdU((Init * EX((((p70==0)||(p88==0)) + EX(((p94==0)||(p124==0)))))),(((((p230==1)&&(p266==1)) + EX(((p162==1...893
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/8
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-01 23:01:34] [INFO ] Flatten gal took : 15 ms
[2025-06-01 23:01:34] [INFO ] Applying decomposition
[2025-06-01 23:01:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13939603897417832383.txt' '-o' '/tmp/graph13939603897417832383.bin' '-w' '/tmp/graph13939603897417832383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13939603897417832383.bin' '-l' '-1' '-v' '-w' '/tmp/graph13939603897417832383.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:01:34] [INFO ] Decomposing Gal with order
[2025-06-01 23:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:01:34] [INFO ] Removed a total of 55 redundant transitions.
[2025-06-01 23:01:34] [INFO ] Flatten gal took : 48 ms
[2025-06-01 23:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 12 ms.
[2025-06-01 23:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10521078835386859222.gal : 5 ms
[2025-06-01 23:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13377490554201991765.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/CTLFireability10521078835386859222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13377490554201991765.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.20368e+24,0.433004,20712,505,127,31634,1941,712,66719,159,8914,0
Converting to forward existential form...Done !
original formula: (EX((((i2.u12.p70==0)||(i2.u12.p88==0)) + EX(((i3.i0.u15.p94==0)||(i3.i0.u15.p124==0))))) * E((((((i5.i0.u27.p230==1)&&(i5.i0.u32.p266==1...1191
=> equivalent forward existential formula: [((FwdU((Init * EX((((i2.u12.p70==0)||(i2.u12.p88==0)) + EX(((i3.i0.u15.p94==0)||(i3.i0.u15.p124==0)))))),(((((i...1374
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 275 transition count 333
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 72 place count 216 transition count 255
Ensure Unique test removed 27 places
Iterating global reduction 1 with 86 rules applied. Total rules applied 158 place count 189 transition count 255
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 193 place count 189 transition count 220
Applied a total of 193 rules in 6 ms. Remains 189 /288 variables (removed 99) and now considering 220/333 (removed 113) transitions.
[2025-06-01 23:02:04] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
// Phase 1: matrix 210 rows 189 cols
[2025-06-01 23:02:04] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:02:04] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-01 23:02:04] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
[2025-06-01 23:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:02:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:02:05] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-01 23:02:05] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
[2025-06-01 23:02:05] [INFO ] Invariant cache hit.
[2025-06-01 23:02:05] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 209/398 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 257 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11119 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 209/398 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 219/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/399 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 476 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21179 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32317ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 32318ms
Starting structural reductions in LTL mode, iteration 1 : 189/288 places, 220/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32529 ms. Remains : 189/288 places, 220/333 transitions.
[2025-06-01 23:02:37] [INFO ] Flatten gal took : 10 ms
[2025-06-01 23:02:37] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:02:37] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-01 23:02:37] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:02:37] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:02:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8202019000368584219.gal : 2 ms
[2025-06-01 23:02:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1671202801544406038.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/CTLFireability8202019000368584219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1671202801544406038.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19339e+23,0.52732,22896,2,1597,5,101139,6,0,969,97731,0
Converting to forward existential form...Done !
original formula: EX(EG(((AG(AF(((p151==1)&&(p249==1)))) * AF(((p22==1)&&(p47==1)))) * A(((p27==1)&&(p59==1)) U !(((p31==1)&&(p58==1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),((!(E(TRUE U !(!(EG(!(((p151==1)&&(p249==1)))))))) * !(EG(!(((p22==1)&&(p47==1)))))) * !((E(!(!((...281
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 218/0/2
(forward)formula 0,0,1.22453,35736,1,0,12,204057,47,2,4994,97731,17
FORMULA NoC3x3-PT-3A-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 275 transition count 333
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 70 place count 218 transition count 254
Ensure Unique test removed 23 places
Iterating global reduction 1 with 80 rules applied. Total rules applied 150 place count 195 transition count 254
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 180 place count 195 transition count 224
Applied a total of 180 rules in 8 ms. Remains 195 /288 variables (removed 93) and now considering 224/333 (removed 109) transitions.
[2025-06-01 23:02:38] [INFO ] Flow matrix only has 216 transitions (discarded 8 similar events)
// Phase 1: matrix 216 rows 195 cols
[2025-06-01 23:02:38] [INFO ] Computed 62 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:02:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 23:02:38] [INFO ] Flow matrix only has 216 transitions (discarded 8 similar events)
[2025-06-01 23:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:02:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:02:38] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-06-01 23:02:38] [INFO ] Flow matrix only has 216 transitions (discarded 8 similar events)
[2025-06-01 23:02:38] [INFO ] Invariant cache hit.
[2025-06-01 23:02:38] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 215/410 variables, 195/257 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 267 constraints, problems are : Problem set: 0 solved, 223 unsolved in 11870 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 215/410 variables, 195/257 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 223/489 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 490 constraints, problems are : Problem set: 0 solved, 223 unsolved in 22038 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33927ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 33928ms
Starting structural reductions in LTL mode, iteration 1 : 195/288 places, 224/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34164 ms. Remains : 195/288 places, 224/333 transitions.
[2025-06-01 23:03:12] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:03:12] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:03:12] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-01 23:03:12] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:03:12] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:03:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1038361610786673662.gal : 2 ms
[2025-06-01 23:03:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1293633729765185346.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/CTLFireability1038361610786673662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1293633729765185346.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19711e+23,0.671367,26908,2,2087,5,122591,6,0,997,117796,0
Converting to forward existential form...Done !
original formula: EG(A(AG(!(((((p234==1)&&(p244==1))&&((p150==1)&&(p215==1))) * AX(((p267==1)&&(p283==1)))))) U ((!(((AF(((p273==1)&&(p281==1))) + ((p167==...339
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((!(((!(EG(!(((p273==1)&&(p281==1))))) + ((p167==1)&&(p211==1))) + ((p159==1)&&(p176==1)))) * ...1116
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 220/2/4
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 213/0/11
Using saturation style SCC detection
(forward)formula 0,0,1.57425,44436,1,0,27,258581,62,13,5217,117796,24
FORMULA NoC3x3-PT-3A-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 274 transition count 333
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 71 place count 217 transition count 259
Ensure Unique test removed 27 places
Iterating global reduction 1 with 84 rules applied. Total rules applied 155 place count 190 transition count 259
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 188 place count 190 transition count 226
Applied a total of 188 rules in 10 ms. Remains 190 /288 variables (removed 98) and now considering 226/333 (removed 107) transitions.
[2025-06-01 23:03:14] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
// Phase 1: matrix 215 rows 190 cols
[2025-06-01 23:03:14] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:03:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-01 23:03:14] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
[2025-06-01 23:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:03:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 23:03:14] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-01 23:03:14] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
[2025-06-01 23:03:14] [INFO ] Invariant cache hit.
[2025-06-01 23:03:14] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 214/404 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 10/257 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 1/405 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/405 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 258 constraints, problems are : Problem set: 0 solved, 225 unsolved in 10652 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 214/404 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 10/257 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 225/482 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 1/405 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 483 constraints, problems are : Problem set: 0 solved, 225 unsolved in 22309 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32980ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 32980ms
Starting structural reductions in LTL mode, iteration 1 : 190/288 places, 226/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33203 ms. Remains : 190/288 places, 226/333 transitions.
[2025-06-01 23:03:47] [INFO ] Flatten gal took : 10 ms
[2025-06-01 23:03:47] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:03:47] [INFO ] Input system was already deterministic with 226 transitions.
[2025-06-01 23:03:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:03:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:03:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10994845027780049115.gal : 1 ms
[2025-06-01 23:03:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12188156497682270744.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/CTLFireability10994845027780049115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12188156497682270744.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86656e+23,0.509494,22996,2,1579,5,101712,6,0,979,96721,0
Converting to forward existential form...Done !
original formula: AX(!(E(AF(!(E((p187==1) U ((p23==1)&&(p59==1))))) U EX(E(((p312==1)&&(p337==1)) U ((p153==1)&&(p249==1)))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(EY(Init),!(EG(!(!(E((p187==1) U ((p23==1)&&(p59==1))))))))),((p312==1)&&(p337==1))) * ((p153==1)&...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 222/0/4
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-01 23:04:17] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:04:17] [INFO ] Applying decomposition
[2025-06-01 23:04:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15399603216309164768.txt' '-o' '/tmp/graph15399603216309164768.bin' '-w' '/tmp/graph15399603216309164768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15399603216309164768.bin' '-l' '-1' '-v' '-w' '/tmp/graph15399603216309164768.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:04:17] [INFO ] Decomposing Gal with order
[2025-06-01 23:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:04:17] [INFO ] Removed a total of 50 redundant transitions.
[2025-06-01 23:04:17] [INFO ] Flatten gal took : 23 ms
[2025-06-01 23:04:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-06-01 23:04:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9616504953377873194.gal : 6 ms
[2025-06-01 23:04:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5394812983330997014.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/CTLFireability9616504953377873194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5394812983330997014.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.86656e+23,0.225199,12332,389,97,16600,1544,651,26632,120,6252,0
Converting to forward existential form...Done !
original formula: AX(!(E(AF(!(E((i4.i1.u24.p187==1) U ((i1.i0.u8.p23==1)&&(i1.i0.u8.p59==1))))) U EX(E(((i7.u42.p312==1)&&(i7.u42.p337==1)) U ((i4.i2.u21.p...189
=> equivalent forward existential formula: [(FwdU(EY(FwdU(EY(Init),!(EG(!(!(E((i4.i1.u24.p187==1) U ((i1.i0.u8.p23==1)&&(i1.i0.u8.p59==1))))))))),((i7.u42....238
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 8 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 276 transition count 333
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 70 place count 218 transition count 253
Ensure Unique test removed 24 places
Iterating global reduction 1 with 82 rules applied. Total rules applied 152 place count 194 transition count 253
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 183 place count 194 transition count 222
Applied a total of 183 rules in 10 ms. Remains 194 /288 variables (removed 94) and now considering 222/333 (removed 111) transitions.
[2025-06-01 23:04:47] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 194 cols
[2025-06-01 23:04:47] [INFO ] Computed 62 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:04:48] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-01 23:04:48] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2025-06-01 23:04:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:04:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:04:48] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-06-01 23:04:48] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2025-06-01 23:04:48] [INFO ] Invariant cache hit.
[2025-06-01 23:04:48] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 213/407 variables, 194/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 9/265 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/408 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 266 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9984 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 194/194 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 213/407 variables, 194/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 9/265 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 221/486 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/408 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 487 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20828 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 194/194 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30831ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 30832ms
Starting structural reductions in LTL mode, iteration 1 : 194/288 places, 222/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31171 ms. Remains : 194/288 places, 222/333 transitions.
[2025-06-01 23:05:19] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:05:19] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:05:19] [INFO ] Input system was already deterministic with 222 transitions.
[2025-06-01 23:05:19] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:05:19] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:05:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1733944218248112487.gal : 1 ms
[2025-06-01 23:05:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16177184134887750610.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/CTLFireability1733944218248112487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16177184134887750610.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.11039e+23,0.538017,25032,2,1940,5,111760,6,0,991,107494,0
Converting to forward existential form...Done !
original formula: E(AX((!(((EG(((p225==1)&&(p239==1))) + (p84==1)) * (p326==1))) * ((EG(((p141==1)&&(p205==1))) + !(((p140==1)&&(p210==1)))) + (((p138==1)&...356
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!((!(((EG(((p225==1)&&(p239==1))) + (p84==1)) * (p326==1))) * ((EG(((p141==1)&&(p205==1))) + !...592
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,1.92243,65024,1,0,32,394624,57,18,5156,211223,32
FORMULA NoC3x3-PT-3A-CTLFireability-2025-07 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 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 275 transition count 333
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 72 place count 216 transition count 252
Ensure Unique test removed 25 places
Iterating global reduction 1 with 84 rules applied. Total rules applied 156 place count 191 transition count 252
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 188 place count 191 transition count 220
Applied a total of 188 rules in 8 ms. Remains 191 /288 variables (removed 97) and now considering 220/333 (removed 113) transitions.
[2025-06-01 23:05:21] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 191 cols
[2025-06-01 23:05:21] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:05:21] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-01 23:05:21] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2025-06-01 23:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:05:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:05:21] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-01 23:05:21] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2025-06-01 23:05:21] [INFO ] Invariant cache hit.
[2025-06-01 23:05:21] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 211/402 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/403 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 261 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11565 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 191/191 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 211/402 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 219/479 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/403 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 480 constraints, problems are : Problem set: 0 solved, 219 unsolved in 23633 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 191/191 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35233ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 35233ms
Starting structural reductions in LTL mode, iteration 1 : 191/288 places, 220/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35470 ms. Remains : 191/288 places, 220/333 transitions.
[2025-06-01 23:05:56] [INFO ] Flatten gal took : 10 ms
[2025-06-01 23:05:56] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:05:56] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-01 23:05:56] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:05:56] [INFO ] Flatten gal took : 19 ms
[2025-06-01 23:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability7157155504889612575.gal : 2 ms
[2025-06-01 23:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability6726824374030816040.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/CTLFireability7157155504889612575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6726824374030816040.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,9.92129e+22,0.466751,23368,2,1699,5,104723,6,0,974,100185,0
Converting to forward existential form...Done !
original formula: AX((!(A(AX(AF(((p1==1)&&(p21==1)))) U E((((p222==1)&&(p263==1))&&((p168==1)&&(p183==1))) U (((p22==1)&&(p59==1))||(p258==1))))) + AG(((p1...176
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(!((E(!(E((((p222==1)&&(p263==1))&&((p168==1)&&(p183==1))) U (((p22==1)&&(p59==1))||(p258=...448
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 210/28/10
Using saturation style SCC detection
(forward)formula 0,1,1.21767,42608,1,0,19,258951,34,7,5062,100185,20
FORMULA NoC3x3-PT-3A-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 275 transition count 333
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 55 place count 233 transition count 275
Ensure Unique test removed 19 places
Iterating global reduction 1 with 61 rules applied. Total rules applied 116 place count 214 transition count 275
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 140 place count 214 transition count 251
Applied a total of 140 rules in 9 ms. Remains 214 /288 variables (removed 74) and now considering 251/333 (removed 82) transitions.
[2025-06-01 23:05:57] [INFO ] Flow matrix only has 238 transitions (discarded 13 similar events)
// Phase 1: matrix 238 rows 214 cols
[2025-06-01 23:05:57] [INFO ] Computed 66 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:05:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-01 23:05:58] [INFO ] Flow matrix only has 238 transitions (discarded 13 similar events)
[2025-06-01 23:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:05:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 23:05:58] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-01 23:05:58] [INFO ] Flow matrix only has 238 transitions (discarded 13 similar events)
[2025-06-01 23:05:58] [INFO ] Invariant cache hit.
[2025-06-01 23:05:58] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 237/451 variables, 214/280 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 1/452 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/452 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 291 constraints, problems are : Problem set: 0 solved, 250 unsolved in 13953 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 214/214 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 237/451 variables, 214/280 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 250/540 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/452 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 541 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 214/214 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43999ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 44000ms
Starting structural reductions in LTL mode, iteration 1 : 214/288 places, 251/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44259 ms. Remains : 214/288 places, 251/333 transitions.
[2025-06-01 23:06:42] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:06:42] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:06:42] [INFO ] Input system was already deterministic with 251 transitions.
[2025-06-01 23:06:42] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:06:42] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4689852492042058798.gal : 1 ms
[2025-06-01 23:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9160635896423445401.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/CTLFireability4689852492042058798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9160635896423445401.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54715e+24,1.16839,38632,2,2427,5,180168,6,0,1100,176757,0
Converting to forward existential form...Done !
original formula: A(((E(!(EX(((p132==1)&&(p183==1)))) U EG(((p206==1)&&(p296==1)))) * (p348==1)) * ((p362==1) * (AX(((((!((p160==1)&&(p194==1)))&&(!((p195=...908
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !(!((((p230==1)&&(p242==1))||((p150==1)&&(p205==1))))))) * !((((p110==1)&&(p127==1...2088
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 247/2/4
Hit Full ! (commute/partial/dont) 249/0/2
(forward)formula 0,0,6.03862,145008,1,0,81,927306,78,42,5924,598461,74
FORMULA NoC3x3-PT-3A-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 7 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 277 transition count 333
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 66 place count 222 transition count 260
Ensure Unique test removed 25 places
Iterating global reduction 1 with 80 rules applied. Total rules applied 146 place count 197 transition count 260
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 176 place count 197 transition count 230
Applied a total of 176 rules in 5 ms. Remains 197 /288 variables (removed 91) and now considering 230/333 (removed 103) transitions.
[2025-06-01 23:06:48] [INFO ] Flow matrix only has 219 transitions (discarded 11 similar events)
// Phase 1: matrix 219 rows 197 cols
[2025-06-01 23:06:48] [INFO ] Computed 62 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:06:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-01 23:06:48] [INFO ] Flow matrix only has 219 transitions (discarded 11 similar events)
[2025-06-01 23:06:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:06:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 23:06:48] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-01 23:06:48] [INFO ] Flow matrix only has 219 transitions (discarded 11 similar events)
[2025-06-01 23:06:48] [INFO ] Invariant cache hit.
[2025-06-01 23:06:48] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 218/415 variables, 197/259 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 10/269 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 1/416 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 270 constraints, problems are : Problem set: 0 solved, 229 unsolved in 13768 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 197/197 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 218/415 variables, 197/259 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 10/269 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 229/498 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 1/416 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 499 constraints, problems are : Problem set: 0 solved, 229 unsolved in 25042 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 197/197 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38843ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 38844ms
Starting structural reductions in LTL mode, iteration 1 : 197/288 places, 230/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39097 ms. Remains : 197/288 places, 230/333 transitions.
[2025-06-01 23:07:27] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:07:27] [INFO ] Flatten gal took : 8 ms
[2025-06-01 23:07:27] [INFO ] Input system was already deterministic with 230 transitions.
[2025-06-01 23:07:27] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:07:27] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:07:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7053081847061951647.gal : 1 ms
[2025-06-01 23:07:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13672482573488353848.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/CTLFireability7053081847061951647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13672482573488353848.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31244e+23,0.605256,24532,2,1750,5,108881,6,0,1011,104545,0
Converting to forward existential form...Done !
original formula: AG(E(((E(EG(((p216==1)&&(p248==1))) U ((p154==1)&&(p169==1))) + EG((((p54==1)&&(p4==1))&&(p17==1)))) + (AF((((p161==1)&&(p186==1))&&((p10...461
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((E(EG(((p216==1)&&(p248==1))) U ((p154==1)&&(p169==1))) + EG((((p54==1)&&(p4==1))&&(p17...622
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 228/0/2
(forward)formula 0,0,3.94614,117096,1,0,73,663243,69,42,5228,638490,63
FORMULA NoC3x3-PT-3A-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 276 transition count 333
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 65 place count 223 transition count 261
Ensure Unique test removed 25 places
Iterating global reduction 1 with 78 rules applied. Total rules applied 143 place count 198 transition count 261
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 175 place count 198 transition count 229
Applied a total of 175 rules in 4 ms. Remains 198 /288 variables (removed 90) and now considering 229/333 (removed 104) transitions.
[2025-06-01 23:07:31] [INFO ] Flow matrix only has 218 transitions (discarded 11 similar events)
// Phase 1: matrix 218 rows 198 cols
[2025-06-01 23:07:31] [INFO ] Computed 61 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-01 23:07:31] [INFO ] Flow matrix only has 218 transitions (discarded 11 similar events)
[2025-06-01 23:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:07:31] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-06-01 23:07:31] [INFO ] Flow matrix only has 218 transitions (discarded 11 similar events)
[2025-06-01 23:07:31] [INFO ] Invariant cache hit.
[2025-06-01 23:07:31] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 1/198 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 217/415 variables, 198/259 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 1/416 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 269 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12598 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 1/198 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 217/415 variables, 198/259 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 228/496 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 1/416 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 497 constraints, problems are : Problem set: 0 solved, 228 unsolved in 24989 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37611ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 37614ms
Starting structural reductions in LTL mode, iteration 1 : 198/288 places, 229/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37855 ms. Remains : 198/288 places, 229/333 transitions.
[2025-06-01 23:08:09] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:08:09] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:08:09] [INFO ] Input system was already deterministic with 229 transitions.
[2025-06-01 23:08:09] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:08:09] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:08:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17588599314656733535.gal : 1 ms
[2025-06-01 23:08:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14531778752977192392.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/CTLFireability17588599314656733535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14531778752977192392.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.9002e+23,0.585048,24464,2,1742,5,109544,6,0,1011,104591,0
Converting to forward existential form...Done !
original formula: EF((((((p297==1)&&(p334==1)) * ((p345==0) * (AG(((p8==1)&&(p13==1))) + AF(((p159==0)||(p176==0)))))) * ((((p153==0)||(p249==0))||((p269==...455
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (((p297==1)&&(p334==1)) * ((p345==0) * (!(E(TRUE U !(((p8==1)&&(p13==1))))) + !(EG(!(((p1...773
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.16585,32904,1,0,15,188896,28,5,5075,104591,13
FORMULA NoC3x3-PT-3A-CTLFireability-2025-11 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 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 8 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 276 transition count 333
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 71 place count 217 transition count 253
Ensure Unique test removed 27 places
Iterating global reduction 1 with 86 rules applied. Total rules applied 157 place count 190 transition count 253
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 191 place count 190 transition count 219
Applied a total of 191 rules in 6 ms. Remains 190 /288 variables (removed 98) and now considering 219/333 (removed 114) transitions.
[2025-06-01 23:08:10] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 190 cols
[2025-06-01 23:08:10] [INFO ] Computed 59 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:08:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-01 23:08:10] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2025-06-01 23:08:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:08:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:08:10] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 23:08:10] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2025-06-01 23:08:10] [INFO ] Invariant cache hit.
[2025-06-01 23:08:10] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 209/399 variables, 190/249 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 259 constraints, problems are : Problem set: 0 solved, 218 unsolved in 11300 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 190/190 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 209/399 variables, 190/249 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 477 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20632 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 190/190 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31950ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 31951ms
Starting structural reductions in LTL mode, iteration 1 : 190/288 places, 219/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32179 ms. Remains : 190/288 places, 219/333 transitions.
[2025-06-01 23:08:42] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:08:42] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:08:42] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-01 23:08:42] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:08:42] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:08:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14898445582137242189.gal : 1 ms
[2025-06-01 23:08:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7571907600419704808.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/CTLFireability14898445582137242189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7571907600419704808.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.26054e+23,0.520722,21916,2,1572,5,95856,6,0,972,91843,0
Converting to forward existential form...Done !
original formula: ((AG(AF((((p42==0)||(p64==0)) + !(A(((p75==1)&&(p87==1)) U ((p150==1)&&(p176==1))))))) + EG(EX(((p9==1)&&(p115==1))))) + AX(((p122==1)&&(...166
=> equivalent forward existential formula: [(EY((Init * !((!(E(TRUE U !(!(EG(!((((p42==0)||(p64==0)) + !(!((E(!(((p150==1)&&(p176==1))) U (!(((p75==1)&&(p8...307
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 209/0/10
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,1.63927,49344,1,0,22,295236,40,8,5118,150697,19
FORMULA NoC3x3-PT-3A-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 274 transition count 333
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 74 place count 214 transition count 251
Ensure Unique test removed 27 places
Iterating global reduction 1 with 87 rules applied. Total rules applied 161 place count 187 transition count 251
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 195 place count 187 transition count 217
Applied a total of 195 rules in 5 ms. Remains 187 /288 variables (removed 101) and now considering 217/333 (removed 116) transitions.
[2025-06-01 23:08:44] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2025-06-01 23:08:44] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:08:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 23:08:44] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2025-06-01 23:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:08:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:08:44] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-01 23:08:44] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2025-06-01 23:08:44] [INFO ] Invariant cache hit.
[2025-06-01 23:08:44] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 1/396 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 254 constraints, problems are : Problem set: 0 solved, 216 unsolved in 10403 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 216/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 470 constraints, problems are : Problem set: 0 solved, 216 unsolved in 20132 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30552ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30553ms
Starting structural reductions in LTL mode, iteration 1 : 187/288 places, 217/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30774 ms. Remains : 187/288 places, 217/333 transitions.
[2025-06-01 23:09:15] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:09:15] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:09:15] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-01 23:09:15] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:09:15] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:09:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10533020954075456158.gal : 1 ms
[2025-06-01 23:09:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10567183110638120595.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/CTLFireability10533020954075456158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10567183110638120595.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00612e+23,0.475186,21604,2,1538,5,93601,6,0,958,89529,0
Converting to forward existential form...Done !
original formula: EG(AX(AF((A(((p141==1)&&(p215==1)) U ((p150==1)&&(p205==1))) * (((p121==0)||(p89==1))||((p18==1)&&(p95==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!((!((E(!(((p150==1)&&(p205==1))) U (!(((p141==1)&&(p215==1))) * !(((p150==1)&&(p205==1))...258
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 206/0/11
Using saturation style SCC detection
(forward)formula 0,0,1.07079,32852,1,0,13,187286,34,3,4959,89529,13
FORMULA NoC3x3-PT-3A-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 275 transition count 333
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 69 place count 219 transition count 259
Ensure Unique test removed 25 places
Iterating global reduction 1 with 81 rules applied. Total rules applied 150 place count 194 transition count 259
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 181 place count 194 transition count 228
Applied a total of 181 rules in 8 ms. Remains 194 /288 variables (removed 94) and now considering 228/333 (removed 105) transitions.
[2025-06-01 23:09:16] [INFO ] Flow matrix only has 218 transitions (discarded 10 similar events)
// Phase 1: matrix 218 rows 194 cols
[2025-06-01 23:09:16] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:09:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-01 23:09:16] [INFO ] Flow matrix only has 218 transitions (discarded 10 similar events)
[2025-06-01 23:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:09:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 23:09:16] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2025-06-01 23:09:16] [INFO ] Flow matrix only has 218 transitions (discarded 10 similar events)
[2025-06-01 23:09:16] [INFO ] Invariant cache hit.
[2025-06-01 23:09:16] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 217/411 variables, 194/254 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 1/412 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/412 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 265 constraints, problems are : Problem set: 0 solved, 227 unsolved in 12582 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 194/194 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 217/411 variables, 194/254 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 227/491 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 1/412 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (OVERLAPS) 0/412 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 492 constraints, problems are : Problem set: 0 solved, 227 unsolved in 25622 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 194/194 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38230ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 38232ms
Starting structural reductions in LTL mode, iteration 1 : 194/288 places, 228/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38476 ms. Remains : 194/288 places, 228/333 transitions.
[2025-06-01 23:09:54] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:09:54] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:09:54] [INFO ] Input system was already deterministic with 228 transitions.
[2025-06-01 23:09:54] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:09:54] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:09:54] [INFO ] Time to serialize gal into /tmp/CTLFireability560171070901536683.gal : 1 ms
[2025-06-01 23:09:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14512514231929375758.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/CTLFireability560171070901536683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14512514231929375758.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98854e+23,0.585679,24044,2,1664,5,105908,6,0,994,102190,0
Converting to forward existential form...Done !
original formula: A(AF(!(((EX(!(((p278==1)&&(p280==1)))) * (((((p151==1)&&(p205==1))&&((p161==1)&&(p187==1)))||((p297==1)&&(p330==1)))||((p25==1)&&(p59==1)...234
=> equivalent forward existential formula: [((Init * !(EG(!((((p356==1)&&(p363==1))&&((p29==1)&&(p65==1))))))) * !(E(!((((p356==1)&&(p363==1))&&((p29==1)&&...409
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 214/0/14
(forward)formula 0,0,4.72665,136272,1,0,16,860688,29,7,5159,551694,15
FORMULA NoC3x3-PT-3A-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 333/333 transitions.
Ensure Unique test removed 10 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 275 transition count 333
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 69 place count 219 transition count 256
Ensure Unique test removed 25 places
Iterating global reduction 1 with 81 rules applied. Total rules applied 150 place count 194 transition count 256
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 182 place count 194 transition count 224
Applied a total of 182 rules in 7 ms. Remains 194 /288 variables (removed 94) and now considering 224/333 (removed 109) transitions.
[2025-06-01 23:09:59] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
// Phase 1: matrix 215 rows 194 cols
[2025-06-01 23:09:59] [INFO ] Computed 60 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:09:59] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-01 23:09:59] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2025-06-01 23:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:09:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 23:09:59] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-06-01 23:09:59] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2025-06-01 23:09:59] [INFO ] Invariant cache hit.
[2025-06-01 23:09:59] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 214/408 variables, 194/254 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 1/409 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 264 constraints, problems are : Problem set: 0 solved, 223 unsolved in 12558 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 194/194 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 214/408 variables, 194/254 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 223/486 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 1/409 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 487 constraints, problems are : Problem set: 0 solved, 223 unsolved in 26239 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 194/194 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38816ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 38817ms
Starting structural reductions in LTL mode, iteration 1 : 194/288 places, 224/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39052 ms. Remains : 194/288 places, 224/333 transitions.
[2025-06-01 23:10:38] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:10:38] [INFO ] Flatten gal took : 6 ms
[2025-06-01 23:10:38] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-01 23:10:38] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:10:38] [INFO ] Flatten gal took : 5 ms
[2025-06-01 23:10:38] [INFO ] Time to serialize gal into /tmp/CTLFireability18433378892585169264.gal : 1 ms
[2025-06-01 23:10:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4202537792650770924.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/CTLFireability18433378892585169264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4202537792650770924.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.9913e+23,0.66403,28416,2,1793,5,130123,6,0,990,127669,0
Converting to forward existential form...Done !
original formula: E(EF((!(EF(((p55==1)&&(p133==1)))) + E(((p60==1)&&(p74==1)) U ((p145==1)&&(p189==1))))) U EX(EX((((A(((p43==1)&&(p54==1)) U ((p26==1)&&(p...228
=> equivalent forward existential formula: [(((((EY(EY(FwdU(Init,E(TRUE U (!(E(TRUE U ((p55==1)&&(p133==1)))) + E(((p60==1)&&(p74==1)) U ((p145==1)&&(p189=...358
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 220/0/4
Hit Full ! (commute/partial/dont) 216/7/8
(forward)formula 0,0,2.15762,66984,1,0,21,384436,41,7,5404,228533,26
FORMULA NoC3x3-PT-3A-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-01 23:10:40] [INFO ] Flatten gal took : 10 ms
[2025-06-01 23:10:40] [INFO ] Flatten gal took : 8 ms
[2025-06-01 23:10:40] [INFO ] Applying decomposition
[2025-06-01 23:10:40] [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/graph3584114098263706881.txt' '-o' '/tmp/graph3584114098263706881.bin' '-w' '/tmp/graph3584114098263706881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3584114098263706881.bin' '-l' '-1' '-v' '-w' '/tmp/graph3584114098263706881.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:10:40] [INFO ] Decomposing Gal with order
[2025-06-01 23:10:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:10:41] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-01 23:10:41] [INFO ] Flatten gal took : 17 ms
[2025-06-01 23:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 9 ms.
[2025-06-01 23:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2347953479718949339.gal : 3 ms
[2025-06-01 23:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17402776085114195286.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/CTLFireability2347953479718949339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17402776085114195286.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 2 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.05574e+27,27.1225,485196,1134,529,606291,8426,922,3.70245e+06,345,48229,0
Converting to forward existential form...Done !
original formula: (EX((((i2.u12.p70==0)||(i2.u12.p88==0)) + EX(((i3.i1.u17.p94==0)||(i3.i0.u13.p124==0))))) * E((((((i7.u24.p230==1)&&(i6.u28.p266==1)) + E...1141
=> equivalent forward existential formula: [((FwdU((Init * EX((((i2.u12.p70==0)||(i2.u12.p88==0)) + EX(((i3.i1.u17.p94==0)||(i3.i0.u13.p124==0)))))),(((((i...1324
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Detected timeout of ITS tools.
[2025-06-01 23:34:52] [INFO ] Applying decomposition
[2025-06-01 23:34:52] [INFO ] Flatten gal took : 20 ms
[2025-06-01 23:34:52] [INFO ] Decomposing Gal with order
[2025-06-01 23:34:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:34:52] [INFO ] Removed a total of 138 redundant transitions.
[2025-06-01 23:34:52] [INFO ] Flatten gal took : 20 ms
[2025-06-01 23:34:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 5 ms.
[2025-06-01 23:34:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16117408455255343039.gal : 2 ms
[2025-06-01 23:34:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11035908042285508494.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/CTLFireability16117408455255343039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11035908042285508494.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 2 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.05574e+27,2.70009,88856,1087,116,184092,833,759,266020,153,4068,0
Converting to forward existential form...Done !
original formula: (EX((((u15.p70==0)||(u20.p88==0)) + EX(((u21.p94==0)||(u27.p124==0))))) * E((((((u41.p230==1)&&(u46.p266==1)) + EX(((u32.p162==1)&&(u36.p...951
=> equivalent forward existential formula: [((FwdU((Init * EX((((u15.p70==0)||(u20.p88==0)) + EX(((u21.p94==0)||(u27.p124==0)))))),(((((u41.p230==1)&&(u46....1110
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 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
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
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 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
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
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
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
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="NoC3x3-PT-3A"
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 NoC3x3-PT-3A, 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 r142-tall-174876812100186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A 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 ;