About the Execution of ITS-Tools for MedleyA-PT-21
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 | T?FFTTTF?TFFTTF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200257.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 MedleyA-PT-21, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200257
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 70K 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 MedleyA-PT-21-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748889447776
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 18:37:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:37:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:37:30] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-06-02 18:37:30] [INFO ] Transformed 306 places.
[2025-06-02 18:37:30] [INFO ] Transformed 298 transitions.
[2025-06-02 18:37:30] [INFO ] Found NUPN structural information;
[2025-06-02 18:37:30] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-21-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 283 transition count 275
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 283 transition count 275
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 269 transition count 261
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 269 transition count 261
Applied a total of 74 rules in 118 ms. Remains 269 /306 variables (removed 37) and now considering 261/298 (removed 37) transitions.
// Phase 1: matrix 261 rows 269 cols
[2025-06-02 18:37:30] [INFO ] Computed 20 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:31] [INFO ] Implicit Places using invariants in 637 ms returned []
[2025-06-02 18:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:31] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-06-02 18:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:37] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:38] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:38] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:38] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:38] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:38] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:39] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:39] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:39] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:39] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:39] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:40] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:40] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:41] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:41] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:41] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:41] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:42] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:42] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:42] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:42] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:42] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:44] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:45] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:45] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:45] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:45] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:46] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:46] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/530 variables, 269/325 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:55] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:55] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:55] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:55] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:56] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:56] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/530 variables, and 331 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 42/62 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/530 variables, 269/331 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 260/591 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:07] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:08] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:08] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:08] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:08] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:09] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:09] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:10] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:10] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:10] [INFO ] Deduced a trap composed of 74 places in 237 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:11] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:11] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:12] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:12] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 14/605 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:15] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:16] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:16] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:16] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:16] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:18] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:18] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 7/612 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:25] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:26] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:26] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:27] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:31] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 617 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 269/306 places, 261/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61520 ms. Remains : 269/306 places, 261/298 transitions.
Support contains 100 out of 269 places after structural reductions.
[2025-06-02 18:38:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 18:38:32] [INFO ] Flatten gal took : 69 ms
[2025-06-02 18:38:32] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MedleyA-PT-21-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 18:38:32] [INFO ] Flatten gal took : 31 ms
[2025-06-02 18:38:32] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 73 out of 269 places (down from 100) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2640 ms. (15 steps per ms) remains 7/44 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2025-06-02 18:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 203/269 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 261/530 variables, 269/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 289 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 203/269 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:33] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 261/530 variables, 269/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:34] [INFO ] Deduced a trap along path composed of 11 places in 52 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1879 steps, including 15 resets, run visited all 2 properties in 10 ms. (steps per millisecond=187 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 17 ms.
[2025-06-02 18:38:34] [INFO ] Flatten gal took : 23 ms
[2025-06-02 18:38:34] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:38:34] [INFO ] Input system was already deterministic with 261 transitions.
Computed a total of 54 stabilizing places and 54 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 239 transition count 231
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 239 transition count 231
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 221 transition count 213
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 221 transition count 213
Applied a total of 96 rules in 29 ms. Remains 221 /269 variables (removed 48) and now considering 213/261 (removed 48) transitions.
// Phase 1: matrix 213 rows 221 cols
[2025-06-02 18:38:34] [INFO ] Computed 20 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:34] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 18:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:34] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-02 18:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:38] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:39] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:39] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:39] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:44] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 254 constraints, problems are : Problem set: 0 solved, 212 unsolved in 20171 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:55] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 212/466 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:58] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:59] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:59] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:59] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:00] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 6/472 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:02] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:02] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:03] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:03] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:03] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:15] [INFO ] Deduced a trap along path composed of 10 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:16] [INFO ] Deduced a trap along path composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 481 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 50224ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 50225ms
Starting structural reductions in LTL mode, iteration 1 : 221/269 places, 213/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50690 ms. Remains : 221/269 places, 213/261 transitions.
[2025-06-02 18:39:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:39:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:39:25] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-02 18:39:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:39:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:39:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality13033289233688036514.gal : 6 ms
[2025-06-02 18:39:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality10223006385791186353.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/CTLCardinality13033289233688036514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10223006385791186353.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.31918e+17,2.06531,55696,2,10395,5,226296,6,0,1099,299385,0
Converting to forward existential form...Done !
original formula: AG(EF(((EX(TRUE) + (p76==0)) + (p97==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((EX(TRUE) + (p76==0)) + (p97==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t117, t120, t128, t143, t153, ...351
(forward)formula 0,1,15.3072,342348,1,0,371,1.7243e+06,448,194,6094,1.72773e+06,438
FORMULA MedleyA-PT-21-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Graph (trivial) has 197 edges and 269 vertex of which 6 / 269 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 263 transition count 187
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 195 transition count 187
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 137 place count 195 transition count 158
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 195 place count 166 transition count 158
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 139 transition count 131
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 139 transition count 131
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 249 place count 139 transition count 118
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 275 place count 126 transition count 118
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 321 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 324 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 328 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 336 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 336 place count 94 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 93 transition count 85
Applied a total of 338 rules in 78 ms. Remains 93 /269 variables (removed 176) and now considering 85/261 (removed 176) transitions.
// Phase 1: matrix 85 rows 93 cols
[2025-06-02 18:39:40] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:39:40] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 18:39:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:39:41] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:39:41] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-02 18:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:42] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:42] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:42] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:42] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 115 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 57/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 172 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2449 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5147ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5150ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/269 places, 85/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5794 ms. Remains : 93/269 places, 85/261 transitions.
[2025-06-02 18:39:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:39:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:39:46] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 1276 steps (37 resets) in 9 ms. (127 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 18:39:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:39:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:39:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7750210995848392457.gal : 2 ms
[2025-06-02 18:39:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9402191221820941893.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7750210995848392457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9402191221820941893.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 246 transition count 238
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 246 transition count 238
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 234 transition count 226
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 234 transition count 226
Applied a total of 70 rules in 20 ms. Remains 234 /269 variables (removed 35) and now considering 226/261 (removed 35) transitions.
// Phase 1: matrix 226 rows 234 cols
[2025-06-02 18:39:46] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:39:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 18:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:39:47] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 18:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:50] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:50] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:50] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:51] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:51] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:51] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:51] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:51] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:52] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:52] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:52] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:52] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:54] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:39:57] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/460 variables, 234/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:05] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 273 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 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/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:18] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:18] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/274 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 225/499 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:21] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:22] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:22] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:23] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:23] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:25] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:25] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:26] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:26] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:27] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:28] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:28] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:28] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:36] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:41] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 517 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 234/269 places, 226/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 234/269 places, 226/261 transitions.
[2025-06-02 18:40:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:40:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:40:47] [INFO ] Input system was already deterministic with 226 transitions.
[2025-06-02 18:40:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:40:47] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:40:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13612532011356854546.gal : 4 ms
[2025-06-02 18:40:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality14676350354941728090.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/CTLCardinality13612532011356854546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14676350354941728090.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.04177e+17,10.6498,237124,2,27788,5,850392,6,0,1164,1.47558e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 18:41:17] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:41:17] [INFO ] Applying decomposition
[2025-06-02 18:41:17] [INFO ] Flatten gal took : 11 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/graph8262010041710216669.txt' '-o' '/tmp/graph8262010041710216669.bin' '-w' '/tmp/graph8262010041710216669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8262010041710216669.bin' '-l' '-1' '-v' '-w' '/tmp/graph8262010041710216669.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:41:17] [INFO ] Decomposing Gal with order
[2025-06-02 18:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:41:17] [INFO ] Removed a total of 29 redundant transitions.
[2025-06-02 18:41:17] [INFO ] Flatten gal took : 73 ms
[2025-06-02 18:41:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 18:41:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11448359760590967672.gal : 9 ms
[2025-06-02 18:41:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3964560854460827191.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/CTLCardinality11448359760590967672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3964560854460827191.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.04177e+17,0.617539,22136,2084,33,39044,344,557,56087,55,924,0
Converting to forward existential form...Done !
original formula: E(AX(E((((!((i4.u35.p118==0)||(i15.i0.u88.p305==1)))||(i0.u10.p39!=0))||((i6.u40.p130==0)&&((i0.u12.p42==0)||(i15.i0.u78.p252==1)))) U ((...404
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(E((((!((i4.u35.p118==0)||(i15.i0.u88.p305==1)))||(i0.u10.p39!=0))||((i6.u40.p130==0)&&((i0.u1...456
Reverse transition relation is NOT exact ! Due to transitions t184, t185, t187, t188, t189, t194, t195, t205, t208, t216, t221, i0.t165, i0.u11.t173, i1.u3...617
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 234
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 234
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 70 place count 226 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 86 place count 226 transition count 218
Applied a total of 86 rules in 15 ms. Remains 226 /269 variables (removed 43) and now considering 218/261 (removed 43) transitions.
// Phase 1: matrix 218 rows 226 cols
[2025-06-02 18:41:47] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 18:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 18:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:52] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:53] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:53] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:53] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:41:58] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 260 constraints, problems are : Problem set: 0 solved, 217 unsolved in 21861 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:11] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/444 variables, 226/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 217/477 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:14] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:16] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:17] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:20] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:21] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:21] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:22] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:26] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:39] [INFO ] Deduced a trap along path composed of 7 places in 47 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 487 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51893ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 51894ms
Starting structural reductions in LTL mode, iteration 1 : 226/269 places, 218/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52304 ms. Remains : 226/269 places, 218/261 transitions.
[2025-06-02 18:42:39] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:42:39] [INFO ] Flatten gal took : 15 ms
[2025-06-02 18:42:39] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 18:42:39] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:42:39] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:42:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality10363942483849672201.gal : 4 ms
[2025-06-02 18:42:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6091297126054559172.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/CTLCardinality10363942483849672201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6091297126054559172.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.89414e+17,3.90126,88048,2,13215,5,338377,6,0,1124,510434,0
Converting to forward existential form...Done !
original formula: EX((AG(EX(!(E((p271==1) U (p265==1))))) + (((A(AX((p95==0)) U !(EG(((p138==0)||(p84==1))))) * EX(((p245==0)||(p237==1)))) * (EX((p81==1))...218
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(EX(!(E((p271==1) U (p265==1))))))))] != FALSE + [(FwdU((EY(Init) * ((!((E(!(!(EG(((p1...403
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t25, t29, t30, t37, t46, t49, t53, t63, t84, t99, t109, t129, t144,...370
(forward)formula 0,1,19.0369,367820,1,0,394,1.86844e+06,459,201,6098,1.89113e+06,452
FORMULA MedleyA-PT-21-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 240 transition count 232
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 240 transition count 232
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 75 place count 223 transition count 215
Iterating global reduction 0 with 17 rules applied. Total rules applied 92 place count 223 transition count 215
Applied a total of 92 rules in 14 ms. Remains 223 /269 variables (removed 46) and now considering 215/261 (removed 46) transitions.
// Phase 1: matrix 215 rows 223 cols
[2025-06-02 18:42:59] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:42:59] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 18:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:42:59] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 18:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:05] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:05] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:05] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:05] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:07] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:11] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/438 variables, 223/257 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:20] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 258 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/257 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 214/471 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:33] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:33] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:33] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:33] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:33] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:35] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:36] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 7/478 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:38] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:40] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:41] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:41] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:41] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:41] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 6/484 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:45] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:45] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 487 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 223/269 places, 215/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60599 ms. Remains : 223/269 places, 215/261 transitions.
[2025-06-02 18:43:59] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:43:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:43:59] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-02 18:43:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:43:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:43:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14981687071000811322.gal : 2 ms
[2025-06-02 18:43:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3446322145599045748.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/CTLCardinality14981687071000811322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3446322145599045748.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.5809e+17,3.77077,89960,2,17646,5,359087,6,0,1109,508933,0
Converting to forward existential form...Done !
original formula: E(EG(AX(A(AG((p236==1)) U ((p195==1)&&(p169==1))))) U AG(EF((!(((p287==0)||(p203==1))) * AG((p92==1))))))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(EX(!(!((E(!(((p195==1)&&(p169==1))) U (!(!(E(TRUE U !((p236==1))))) * !(((p195==1)&&(p169==1)))...290
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t11, t13, t20, t29, t30, t37, t52, t62, t68, t71, t84, t99, t109, t119, ...363
(forward)formula 0,0,26.5669,566040,1,0,380,2.92127e+06,454,195,6015,2.97228e+06,444
FORMULA MedleyA-PT-21-CTLCardinality-2025-06 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 : 269/269 places, 261/261 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 240 transition count 232
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 240 transition count 232
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 77 place count 221 transition count 213
Iterating global reduction 0 with 19 rules applied. Total rules applied 96 place count 221 transition count 213
Applied a total of 96 rules in 10 ms. Remains 221 /269 variables (removed 48) and now considering 213/261 (removed 48) transitions.
// Phase 1: matrix 213 rows 221 cols
[2025-06-02 18:44:26] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:26] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 18:44:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:27] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-02 18:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:32] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:33] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:33] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:33] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:35] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:44] [INFO ] Deduced a trap along path composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 254 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/465 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:01] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:01] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:03] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:03] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:03] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:03] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 7/472 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:05] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:06] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:06] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:08] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:09] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:12] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:25] [INFO ] Deduced a trap along path composed of 7 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 480 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 221/269 places, 213/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60468 ms. Remains : 221/269 places, 213/261 transitions.
[2025-06-02 18:45:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:45:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:45:27] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-02 18:45:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:45:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality449185715343130966.gal : 3 ms
[2025-06-02 18:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4130578978439304671.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/CTLCardinality449185715343130966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4130578978439304671.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.39421e+17,2.42329,59392,2,10611,5,243460,6,0,1099,319472,0
Converting to forward existential form...Done !
original formula: EF(AX((EG(((p206==1) + AG(((p119==0)||(p235==1))))) + (p61==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG(((p206==1) + !(E(TRUE U !(((p119==0)||(p235==1))))))) + (p61==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t62, t70, t83, t98, t108, t128, t143, t153, t17...348
Detected timeout of ITS tools.
[2025-06-02 18:45:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:45:57] [INFO ] Applying decomposition
[2025-06-02 18:45:57] [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/graph4152424248787874453.txt' '-o' '/tmp/graph4152424248787874453.bin' '-w' '/tmp/graph4152424248787874453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4152424248787874453.bin' '-l' '-1' '-v' '-w' '/tmp/graph4152424248787874453.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:45:57] [INFO ] Decomposing Gal with order
[2025-06-02 18:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:45:57] [INFO ] Removed a total of 32 redundant transitions.
[2025-06-02 18:45:57] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 18:45:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16173597188678219776.gal : 5 ms
[2025-06-02 18:45:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6285352317550900258.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/CTLCardinality16173597188678219776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6285352317550900258.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39421e+17,0.367322,14540,1998,30,25939,284,516,25207,44,712,0
Converting to forward existential form...Done !
original formula: EF(AX((EG(((i12.u62.p206==1) + AG(((i8.u38.p119==0)||(i10.u70.p235==1))))) + (i4.i0.u14.p61==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG(((i12.u62.p206==1) + !(E(TRUE U !(((i8.u38.p119==0)||(i10.u70.p235==1))))))) + (i...186
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t170, t171, t172, t174, t175, t176, t180, t181, t182, t192, t195, t200, t203, t208,...484
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 a local 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
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 a local 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
(forward)formula 0,1,8.27286,234444,1,0,478771,284,3133,699994,232,712,772961
FORMULA MedleyA-PT-21-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Graph (trivial) has 195 edges and 269 vertex of which 6 / 269 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 263 transition count 190
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 198 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 196 transition count 188
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 135 place count 196 transition count 158
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 195 place count 166 transition count 158
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 221 place count 140 transition count 132
Iterating global reduction 3 with 26 rules applied. Total rules applied 247 place count 140 transition count 132
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 247 place count 140 transition count 119
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 273 place count 127 transition count 119
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 313 place count 107 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 106 transition count 98
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 105 vertex of which 5 / 105 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 316 place count 102 transition count 98
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 320 place count 101 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 326 place count 98 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 98 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 328 place count 98 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 330 place count 97 transition count 89
Applied a total of 330 rules in 46 ms. Remains 97 /269 variables (removed 172) and now considering 89/261 (removed 172) transitions.
// Phase 1: matrix 89 rows 97 cols
[2025-06-02 18:46:05] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:05] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 18:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:06] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:46:06] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-02 18:46:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/97 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:06] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 88/185 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 119 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/97 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 88/185 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 83/202 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:13] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:13] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 204 constraints, problems are : Problem set: 0 solved, 83 unsolved in 7256 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 12317ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 12318ms
Starting structural reductions in SI_CTL mode, iteration 1 : 97/269 places, 89/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12630 ms. Remains : 97/269 places, 89/261 transitions.
[2025-06-02 18:46:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:46:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:46:18] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-02 18:46:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:46:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:46:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17758235215388944582.gal : 1 ms
[2025-06-02 18:46:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12332996460554251641.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/CTLCardinality17758235215388944582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12332996460554251641.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.11072e+11,0.12547,7992,2,548,5,20091,5,0,476,23873,0
Converting to forward existential form...Done !
original formula: EF(EG(((p88!=1) + ((p102!=0) * EF((p172==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p88!=1) + ((p102!=0) * E(TRUE U (p172==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t33, t37, t41, t43, t73, t75, t77, Intersection with reachable at each step enab...207
(forward)formula 0,1,1.64681,47320,1,0,171,209853,204,76,2856,278438,197
FORMULA MedleyA-PT-21-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 239 transition count 231
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 239 transition count 231
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 221 transition count 213
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 221 transition count 213
Applied a total of 96 rules in 8 ms. Remains 221 /269 variables (removed 48) and now considering 213/261 (removed 48) transitions.
// Phase 1: matrix 213 rows 221 cols
[2025-06-02 18:46:20] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:20] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-02 18:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:20] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-02 18:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:25] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:26] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:26] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:26] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:26] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:26] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:27] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:27] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:29] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:35] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:42] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 255 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/466 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:53] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:54] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:54] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:54] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:55] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:56] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:56] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:57] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:57] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 9/475 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:00] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:03] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:07] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:08] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:09] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 481 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 221/269 places, 213/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 221/269 places, 213/261 transitions.
[2025-06-02 18:47:20] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:47:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:47:20] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-02 18:47:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:47:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:47:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8759740750899388721.gal : 3 ms
[2025-06-02 18:47:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality2410620748152420449.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/CTLCardinality8759740750899388721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2410620748152420449.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.31918e+17,2.14814,56072,2,10405,5,228486,6,0,1099,300262,0
Converting to forward existential form...Done !
original formula: AG(EX(EG(E(((p187==0)&&((p25==0)||(p179==1))) U ((p285==1)||(p88==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(E(((p187==0)&&((p25==0)||(p179==1))) U ((p285==1)||(p88==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t10, t19, t28, t29, t36, t51, t61, t71, t74, t83, t98, t108, t128, t143, t153, t1...349
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 18:47:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:47:50] [INFO ] Applying decomposition
[2025-06-02 18:47:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9894991567037032477.txt' '-o' '/tmp/graph9894991567037032477.bin' '-w' '/tmp/graph9894991567037032477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9894991567037032477.bin' '-l' '-1' '-v' '-w' '/tmp/graph9894991567037032477.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:47:50] [INFO ] Decomposing Gal with order
[2025-06-02 18:47:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:47:50] [INFO ] Removed a total of 35 redundant transitions.
[2025-06-02 18:47:50] [INFO ] Flatten gal took : 17 ms
[2025-06-02 18:47:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 18:47:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6805094098732043876.gal : 3 ms
[2025-06-02 18:47:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7534056783631420254.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/CTLCardinality6805094098732043876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7534056783631420254.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.31918e+17,0.264886,12848,1622,31,21183,275,496,21821,44,665,0
Converting to forward existential form...Done !
original formula: AG(EX(EG(E(((i1.i2.u60.p187==0)&&((i3.u9.p25==0)||(i10.u57.p179==1))) U ((i0.u86.p285==1)||(i1.i1.u29.p88==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(E(((i1.i2.u60.p187==0)&&((i3.u9.p25==0)||(i10.u57.p179==1))) U ((i0.u86.p285==1)||(i...186
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t170, t171, t172, t174, t175, t176, t180, t181, t182, t192, t195, t200, t203, t208,...459
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 4
Fast SCC detection found a local 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
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 a local 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
(forward)formula 0,0,3.49442,114864,1,0,269513,310,2975,368819,234,699,421447
FORMULA MedleyA-PT-21-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 243 transition count 235
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 243 transition count 235
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 67 place count 228 transition count 220
Iterating global reduction 0 with 15 rules applied. Total rules applied 82 place count 228 transition count 220
Applied a total of 82 rules in 9 ms. Remains 228 /269 variables (removed 41) and now considering 220/261 (removed 41) transitions.
// Phase 1: matrix 220 rows 228 cols
[2025-06-02 18:47:54] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:54] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 18:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:54] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-02 18:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:59] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:59] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:59] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:00] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:00] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:00] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:00] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:00] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:00] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:01] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:01] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:01] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:02] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/448 variables, 228/263 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:10] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/448 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 264 constraints, problems are : Problem set: 0 solved, 219 unsolved in 26842 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 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/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/448 variables, 228/263 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 219/482 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:23] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:23] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:24] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:24] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:24] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:24] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:25] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:26] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:26] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:27] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 10/492 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:29] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:29] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:35] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:36] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:36] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:37] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:41] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:42] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:42] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:47] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 502 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 56872ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 56873ms
Starting structural reductions in LTL mode, iteration 1 : 228/269 places, 220/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57238 ms. Remains : 228/269 places, 220/261 transitions.
[2025-06-02 18:48:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:48:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:48:51] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-02 18:48:51] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:48:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:48:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality17540093538381170149.gal : 2 ms
[2025-06-02 18:48:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16037775213463436810.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/CTLCardinality17540093538381170149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16037775213463436810.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07069e+17,5.22973,125600,2,21666,5,499626,6,0,1134,738339,0
Converting to forward existential form...Done !
original formula: (AG((AG(((p40==1) * AX(FALSE))) * EX(TRUE))) + AG((EF((AG((p194==0)) * EX((p270==0)))) + E(EX(A(((p267==0)||(p131==1)) U ((p147==0)||(p29...223
=> equivalent forward existential formula: [((FwdU((Init * !(!(E(TRUE U !((!(E(TRUE U !(((p40==1) * !(EX(!(FALSE))))))) * EX(TRUE))))))),TRUE) * !(E(EX(!((...414
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t12, t15, t21, t25, t31, t32, t39, t54, t64, t71, t75, t89, t101, t104, ...381
Detected timeout of ITS tools.
[2025-06-02 18:49:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:49:21] [INFO ] Applying decomposition
[2025-06-02 18:49:21] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7924926413659459569.txt' '-o' '/tmp/graph7924926413659459569.bin' '-w' '/tmp/graph7924926413659459569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7924926413659459569.bin' '-l' '-1' '-v' '-w' '/tmp/graph7924926413659459569.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:49:21] [INFO ] Decomposing Gal with order
[2025-06-02 18:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:49:21] [INFO ] Removed a total of 31 redundant transitions.
[2025-06-02 18:49:21] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 18:49:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16990335854514935176.gal : 3 ms
[2025-06-02 18:49:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17028788902976620102.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/CTLCardinality16990335854514935176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17028788902976620102.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07069e+17,0.740305,26008,1515,29,46285,270,527,70405,45,701,0
Converting to forward existential form...Done !
original formula: (AG((AG(((i2.u12.p40==1) * AX(FALSE))) * EX(TRUE))) + AG((EF((AG((i10.u61.p194==0)) * EX((i13.i1.u82.p270==0)))) + E(EX(A(((i13.i0.u83.p2...313
=> equivalent forward existential formula: [((FwdU((Init * !(!(E(TRUE U !((!(E(TRUE U !(((i2.u12.p40==1) * !(EX(!(FALSE))))))) * EX(TRUE))))))),TRUE) * !(E...530
Reverse transition relation is NOT exact ! Due to transitions t177, t178, t181, t182, t187, t188, t199, t202, t207, t210, t215, t218, i0.i0.u3.t0, i1.u13.t...571
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 233
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 233
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 224 transition count 216
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 224 transition count 216
Applied a total of 90 rules in 9 ms. Remains 224 /269 variables (removed 45) and now considering 216/261 (removed 45) transitions.
// Phase 1: matrix 216 rows 224 cols
[2025-06-02 18:49:51] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:49:52] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 18:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:49:52] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-02 18:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:57] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:57] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:57] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:58] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:58] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:58] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:58] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:58] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:58] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:59] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:59] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/258 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 258 constraints, problems are : Problem set: 0 solved, 215 unsolved in 27214 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:22] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:24] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/440 variables, 224/260 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 215/475 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:29] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:30] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:30] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:31] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:32] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:32] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:32] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:33] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:33] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 9/484 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:36] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:36] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:38] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:38] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:41] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:41] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:43] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:47] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 492 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57251ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 57252ms
Starting structural reductions in LTL mode, iteration 1 : 224/269 places, 216/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57636 ms. Remains : 224/269 places, 216/261 transitions.
[2025-06-02 18:50:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:50:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:50:49] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-02 18:50:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:50:49] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:50:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11160136412990252949.gal : 2 ms
[2025-06-02 18:50:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15473603277521164060.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/CTLCardinality11160136412990252949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15473603277521164060.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04942e+17,3.73005,93716,2,19019,5,377704,6,0,1114,533871,0
Converting to forward existential form...Done !
original formula: AX(E((p294==0) U !(AX(AF((p290==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E((p294==0) U !(!(EX(!(!(EG(!((p290==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t12, t15, t17, t23, t32, t33, t40, t55, t65, t86, t101, t111, t131, t146...359
(forward)formula 0,1,26.3301,591976,1,0,396,2.95465e+06,459,199,6047,3.36533e+06,463
FORMULA MedleyA-PT-21-CTLCardinality-2024-12 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 : 269/269 places, 261/261 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 233
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 233
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 71 place count 226 transition count 218
Iterating global reduction 0 with 15 rules applied. Total rules applied 86 place count 226 transition count 218
Applied a total of 86 rules in 8 ms. Remains 226 /269 variables (removed 43) and now considering 218/261 (removed 43) transitions.
// Phase 1: matrix 218 rows 226 cols
[2025-06-02 18:51:16] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 18:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:16] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 18:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:22] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:22] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:22] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:22] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:22] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:23] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:23] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:23] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/261 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:30] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 262 constraints, problems are : Problem set: 0 solved, 217 unsolved in 29885 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/262 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 217/479 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:52] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:53] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:53] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:54] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:55] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:55] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:55] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 7/486 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:57] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:58] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:59] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:00] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:00] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:04] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:05] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:10] [INFO ] Deduced a trap along path composed of 11 places in 103 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:11] [INFO ] Deduced a trap along path composed of 4 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:11] [INFO ] Deduced a trap along path composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:12] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:13] [INFO ] Deduced a trap along path composed of 11 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 498 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 59921ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 59922ms
Starting structural reductions in LTL mode, iteration 1 : 226/269 places, 218/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60280 ms. Remains : 226/269 places, 218/261 transitions.
[2025-06-02 18:52:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:52:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:52:16] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 18:52:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:52:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:52:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2229532919979467582.gal : 2 ms
[2025-06-02 18:52:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality525048294899741062.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/CTLCardinality2229532919979467582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality525048294899741062.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.05618e+17,5.12089,127304,2,21390,5,486196,6,0,1124,765926,0
Converting to forward existential form...Done !
original formula: (AF(((!(E(((p174==0)||(p81==1)) U ((p13==0)||(p42==1)))) + !(A((p278!=0) U ((p8==0)||(p291==1))))) + AF((((p74==1)&&((p227==0)||(p119==1)...230
=> equivalent forward existential formula: ([FwdG(Init,!(((!(E(((p174==0)||(p81==1)) U ((p13==0)||(p42==1)))) + !(!((E(!(((p8==0)||(p291==1))) U (!((p278!=...461
Hit Full ! (commute/partial/dont) 213/5/5
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t11, t13, t20, t29, t30, t37, t47, t51, t54, t64, t74, t79, t86, t101, t...374
Detected timeout of ITS tools.
[2025-06-02 18:52:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:52:46] [INFO ] Applying decomposition
[2025-06-02 18:52:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14483503600403563244.txt' '-o' '/tmp/graph14483503600403563244.bin' '-w' '/tmp/graph14483503600403563244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14483503600403563244.bin' '-l' '-1' '-v' '-w' '/tmp/graph14483503600403563244.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:52:46] [INFO ] Decomposing Gal with order
[2025-06-02 18:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:52:46] [INFO ] Removed a total of 31 redundant transitions.
[2025-06-02 18:52:46] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 18:52:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10854600440546396914.gal : 15 ms
[2025-06-02 18:52:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality7285936916130720213.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/CTLCardinality10854600440546396914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7285936916130720213.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05618e+17,0.84674,26936,3581,43,51114,301,554,64443,57,780,0
Converting to forward existential form...Done !
original formula: (AF(((!(E(((i10.u53.p174==0)||(i4.i1.u25.p81==1)) U ((i1.u5.p13==0)||(i2.u8.p42==1)))) + !(A((i0.i0.u0.p278!=0) U ((i1.u3.p8==0)||(i3.i0....355
=> equivalent forward existential formula: ([FwdG(Init,!(((!(E(((i10.u53.p174==0)||(i4.i1.u25.p81==1)) U ((i1.u5.p13==0)||(i2.u8.p42==1)))) + !(!((E(!(((i1...660
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Reverse transition relation is NOT exact ! Due to transitions t10, t29, t175, t176, t179, t180, t181, t185, t186, t187, t197, t205, t208, t213, i0.i1.u79.t...557
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 261/261 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 240 transition count 232
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 240 transition count 232
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 76 place count 222 transition count 214
Iterating global reduction 0 with 18 rules applied. Total rules applied 94 place count 222 transition count 214
Applied a total of 94 rules in 8 ms. Remains 222 /269 variables (removed 47) and now considering 214/261 (removed 47) transitions.
// Phase 1: matrix 214 rows 222 cols
[2025-06-02 18:53:16] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:53:16] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 18:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:53:17] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-02 18:53:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:22] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:23] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:23] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:25] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:33] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/436 variables, and 256 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:47] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:51] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:52] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:52] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:53] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:53] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:54] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:58] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:01] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:02] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:08] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 22 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
(s71 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 480 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 222/269 places, 214/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60392 ms. Remains : 222/269 places, 214/261 transitions.
[2025-06-02 18:54:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:54:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:54:17] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-02 18:54:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:54:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:54:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7972525843898294525.gal : 3 ms
[2025-06-02 18:54:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality18205643496753113531.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/CTLCardinality7972525843898294525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18205643496753113531.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.49229e+17,2.42761,63280,2,10830,5,256571,6,0,1104,347086,0
Converting to forward existential form...Done !
original formula: EG(AG(AF((EG((p112==1)) * AX(((p155==0)&&(p23==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((EG((p112==1)) * !(EX(!(((p155==0)&&(p23==1)))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t114, t118, t129, t144, t1...349
(forward)formula 0,0,18.3475,420552,1,0,390,2.08292e+06,458,196,6280,2.3431e+06,459
FORMULA MedleyA-PT-21-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 18:54:35] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:54:35] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:54:35] [INFO ] Applying decomposition
[2025-06-02 18:54:35] [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/graph15782737400387889034.txt' '-o' '/tmp/graph15782737400387889034.bin' '-w' '/tmp/graph15782737400387889034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15782737400387889034.bin' '-l' '-1' '-v' '-w' '/tmp/graph15782737400387889034.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:54:35] [INFO ] Decomposing Gal with order
[2025-06-02 18:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:54:35] [INFO ] Removed a total of 28 redundant transitions.
[2025-06-02 18:54:35] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 18:54:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality13495659555727803876.gal : 6 ms
[2025-06-02 18:54:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9116788956185796780.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/CTLCardinality13495659555727803876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9116788956185796780.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 3 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.43464e+18,6.62214,142288,11061,32,265221,373,628,467496,54,1040,0
Converting to forward existential form...Done !
original formula: E(AX(E((((!((i7.i0.u44.p118==0)||(i0.i0.u107.p305==1)))||(i3.i2.u15.p39!=0))||((i8.u49.p130==0)&&((i3.i0.u10.p42==0)||(i0.i1.u93.p252==1)...414
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(E((((!((i7.i0.u44.p118==0)||(i0.i0.u107.p305==1)))||(i3.i2.u15.p39!=0))||((i8.u49.p130==0)&&(...466
Reverse transition relation is NOT exact ! Due to transitions t218, t219, t220, t222, t223, t224, t229, t241, t243, t251, t257, i0.i0.u107.t7, i0.i1.t40, i...902
Detected timeout of ITS tools.
[2025-06-02 19:20:17] [INFO ] Applying decomposition
[2025-06-02 19:20:17] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:20:17] [INFO ] Decomposing Gal with order
[2025-06-02 19:20:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:20:17] [INFO ] Removed a total of 8 redundant transitions.
[2025-06-02 19:20:17] [INFO ] Flatten gal took : 12 ms
[2025-06-02 19:20:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 9 ms.
[2025-06-02 19:20:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1454507280458002709.gal : 3 ms
[2025-06-02 19:20:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality4440833694326638790.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/CTLCardinality1454507280458002709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4440833694326638790.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 3 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.43464e+18,44.5532,906748,6346,2292,894613,17706,457,8.3324e+06,267,251046,0
Converting to forward existential form...Done !
original formula: E(AX(E((((!((i0.i0.i0.i0.i0.i1.i1.i0.u21.p118==0)||(u38.p305==1)))||(i0.i0.i0.i0.i0.i0.i1.i0.u12.p39!=0))||((i0.i0.i0.i0.i0.i1.i1.i0.u22....619
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(E((((!((i0.i0.i0.i0.i0.i1.i1.i0.u21.p118==0)||(u38.p305==1)))||(i0.i0.i0.i0.i0.i0.i1.i0.u12.p...671
Reverse transition relation is NOT exact ! Due to transitions t218, t224, u38.t6, u38.t7, i0.t230, i0.i0.u34.t26, i0.i0.u34.t30, i0.i0.u34.t33, i0.i0.i0.u3...1776
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="MedleyA-PT-21"
export BK_EXAMINATION="CTLCardinality"
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 MedleyA-PT-21, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;