About the Execution of ITS-Tools for MedleyA-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 446029.00 | 0.00 | 0.00 | TTFFTFFTTFTTTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000121.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-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 28K 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-04-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748843537895
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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 05:52:20] [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 05:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:52:20] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-02 05:52:20] [INFO ] Transformed 115 places.
[2025-06-02 05:52:20] [INFO ] Transformed 107 transitions.
[2025-06-02 05:52:20] [INFO ] Found NUPN structural information;
[2025-06-02 05:52:20] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
FORMULA MedleyA-PT-04-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 113 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 113 transition count 106
Applied a total of 3 rules in 53 ms. Remains 113 /115 variables (removed 2) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 113 cols
[2025-06-02 05:52:21] [INFO ] Computed 8 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:52:21] [INFO ] Implicit Places using invariants in 397 ms returned []
[2025-06-02 05:52:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:52:21] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-02 05:52:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:23] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:23] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:23] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:23] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:23] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 18 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 05:52:24] [INFO ] Deduced a trap composed of 26 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 05:52:24] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:24] [INFO ] Deduced a trap composed of 20 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 05:52:25] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 16 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 05:52:25] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:25] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:26] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 106/219 variables, 113/157 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:29] [INFO ] Deduced a trap composed of 11 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 05:52:29] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:29] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:31] [INFO ] Deduced a trap along path composed of 19 places in 69 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:33] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/219 variables, 113/161 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 105/266 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:38] [INFO ] Deduced a trap composed of 24 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 05:52:38] [INFO ] Deduced a trap composed of 28 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 05:52:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:39] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:39] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:44] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:44] [INFO ] Deduced a trap composed of 40 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 05:52:44] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:58] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:52:58] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:01] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:02] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:02] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/219 variables, and 282 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45516ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 45546ms
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 106/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46395 ms. Remains : 113/115 places, 106/107 transitions.
Support contains 79 out of 113 places after structural reductions.
[2025-06-02 05:53:07] [INFO ] Flatten gal took : 58 ms
[2025-06-02 05:53:07] [INFO ] Flatten gal took : 25 ms
[2025-06-02 05:53:07] [INFO ] Input system was already deterministic with 106 transitions.
Support contains 76 out of 113 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (1137 resets) in 2283 ms. (17 steps per ms) remains 11/62 properties
BEST_FIRST walk for 40002 steps (298 resets) in 469 ms. (85 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (300 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (298 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (313 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (295 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (382 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (298 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (287 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (285 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (348 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (283 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
[2025-06-02 05:53:09] [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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 72/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 106/200 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (OVERLAPS) 19/219 variables, 19/121 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 121 constraints, problems are : Problem set: 1 solved, 10 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 73/92 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 20 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 05:53:10] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 21 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 05:53:10] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 10/18 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 106/198 variables, 92/111 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/115 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 22 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 05:53:11] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:11] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:11] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:11] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 5/120 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 21/219 variables, 21/141 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/147 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 147 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2270 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2756ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 7106 ms.
Support contains 17 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 106/106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 113 transition count 88
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 95 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 93 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 93 transition count 81
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 88 transition count 81
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 83 transition count 76
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 83 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 83 transition count 75
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 82 transition count 75
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 90 place count 68 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 68 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 67 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 67 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 66 transition count 59
Applied a total of 94 rules in 49 ms. Remains 66 /113 variables (removed 47) and now considering 59/106 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 66/113 places, 59/106 transitions.
RANDOM walk for 40000 steps (3016 resets) in 372 ms. (107 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1107 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1122 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1106 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1166 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1092 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1699 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1691 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1117 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1044 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 7805 steps, run visited all 9 properties in 123 ms. (steps per millisecond=63 )
Probabilistic random walk after 7805 steps, saw 3646 distinct states, run finished after 131 ms. (steps per millisecond=59 ) properties seen :9
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-06-02 05:53:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 05:53:20] [INFO ] Flatten gal took : 15 ms
[2025-06-02 05:53:20] [INFO ] Input system was already deterministic with 106 transitions.
Computed a total of 113 stabilizing places and 106 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 113 transition count 106
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 112 transition count 83
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 89 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 46 place count 89 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 83 transition count 76
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 77 transition count 70
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 77 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 77 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 76 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 98 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 60 transition count 54
Applied a total of 102 rules in 46 ms. Remains 60 /113 variables (removed 53) and now considering 54/106 (removed 52) transitions.
// Phase 1: matrix 54 rows 60 cols
[2025-06-02 05:53:20] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 05:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:20] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:53:20] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-02 05:53: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/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:20] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:20] [INFO ] Deduced a trap composed of 6 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 05:53:20] [INFO ] Deduced a trap composed of 8 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 05:53:20] [INFO ] Deduced a trap composed of 4 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 05:53:21] [INFO ] Deduced a trap composed of 6 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 05:53:21] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:21] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 54/113 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/114 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 74 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 54/113 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 53/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:24] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/114 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:25] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 129 constraints, problems are : Problem set: 0 solved, 53 unsolved in 5801 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8867ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 8868ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/113 places, 54/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9144 ms. Remains : 60/113 places, 54/106 transitions.
[2025-06-02 05:53:29] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:53:29] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:53:29] [INFO ] Input system was already deterministic with 54 transitions.
[2025-06-02 05:53:29] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:53:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:53:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3077554439632800239.gal : 3 ms
[2025-06-02 05:53:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8072647663727279280.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/CTLCardinality3077554439632800239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8072647663727279280.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,292656,0.033549,4416,2,683,5,2849,6,0,296,2234,0
Converting to forward existential form...Done !
original formula: EF(!(A(((p97==0)||(p95==1)) U !((((p11==0)||(p54==1))||(p97==1))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(!((((p11==0)||(p54==1))||(p97==1))))) * (!(((p97==0)||(p95==1))) * !(!((((p11==0)||(p5...261
Hit Full ! (commute/partial/dont) 48/0/6
(forward)formula 0,1,0.042276,4672,1,0,8,2849,18,2,579,2234,4
FORMULA MedleyA-PT-04-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 88
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 95 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 94 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 94 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 88 transition count 81
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 83 transition count 76
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 83 transition count 76
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 84 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 69 transition count 62
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 68 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 67 transition count 61
Applied a total of 88 rules in 30 ms. Remains 67 /113 variables (removed 46) and now considering 61/106 (removed 45) transitions.
// Phase 1: matrix 61 rows 67 cols
[2025-06-02 05:53:29] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:29] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 05:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:53:29] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-02 05:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:30] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:30] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:30] [INFO ] Deduced a trap composed of 11 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 05:53:30] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/128 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:31] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 81 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/128 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 60/141 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:33] [INFO ] Deduced a trap composed of 12 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 05:53:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 143 constraints, problems are : Problem set: 0 solved, 60 unsolved in 8402 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10912ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 10913ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/113 places, 61/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11107 ms. Remains : 67/113 places, 61/106 transitions.
[2025-06-02 05:53:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:53:40] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:53:40] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-02 05:53:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:53:40] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:53:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality1678209824787487822.gal : 2 ms
[2025-06-02 05:53:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17827457620789025778.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/CTLCardinality1678209824787487822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17827457620789025778.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,671019,0.028949,4572,2,1020,5,3573,6,0,330,2608,0
Converting to forward existential form...Done !
original formula: EF(((AG(((p4==1)||((p27==0)&&(p37==1)))) * (p111==0)) * (((p113==0)||(p84==1))&&(((p41==0)||(p105==1))||((p23==0)||(p43==1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((p113==0)||(p84==1))&&(((p41==0)||(p105==1))||((p23==0)||(p43==1))))) * (p111==0)) * !(E...210
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t11, t14, t18, t45, t48, t54, Intersection with reachable at each step e...210
(forward)formula 0,0,0.307314,14044,1,0,142,59319,144,64,2061,45066,135
FORMULA MedleyA-PT-04-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 91
Applied a total of 30 rules in 13 ms. Remains 98 /113 variables (removed 15) and now considering 91/106 (removed 15) transitions.
// Phase 1: matrix 91 rows 98 cols
[2025-06-02 05:53:41] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 05:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:41] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-02 05:53: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/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:42] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:42] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:42] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:43] [INFO ] Deduced a trap composed of 18 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 05:53:43] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:43] [INFO ] Deduced a trap composed of 17 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 05:53:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:44] [INFO ] Deduced a trap composed of 10 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 05:53:44] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:44] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6802 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:48] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:50] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:53] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:00] [INFO ] Deduced a trap along path composed of 8 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:00] [INFO ] Deduced a trap along path composed of 8 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:08] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:11] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36831ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 36832ms
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 91/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37137 ms. Remains : 98/113 places, 91/106 transitions.
[2025-06-02 05:54:18] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:54:18] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:54:18] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-02 05:54:18] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:54:18] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:54:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality108847669319326218.gal : 2 ms
[2025-06-02 05:54:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11768768470763110270.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/CTLCardinality108847669319326218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11768768470763110270.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15274e+07,0.046833,5072,2,1685,5,5606,6,0,485,4533,0
Converting to forward existential form...Done !
original formula: (EX(TRUE) * EX(AX((p97==1))))
=> equivalent forward existential formula: [(EY((Init * EX(TRUE))) * !(EX(!((p97==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t47, t50, t77, t85, Intersecti...242
(forward)formula 0,0,0.630431,24124,1,0,205,114784,199,93,2833,89845,194
FORMULA MedleyA-PT-04-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 112 transition count 82
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 89 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 89 transition count 76
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 83 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 77 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 77 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 70 place count 77 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 76 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 61 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 58 transition count 52
Applied a total of 107 rules in 22 ms. Remains 58 /113 variables (removed 55) and now considering 52/106 (removed 54) transitions.
// Phase 1: matrix 52 rows 58 cols
[2025-06-02 05:54:18] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:54:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 05:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:54:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:54:19] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-02 05:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:19] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:19] [INFO ] Deduced a trap composed of 5 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 05:54:19] [INFO ] Deduced a trap composed of 5 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 05:54:19] [INFO ] Deduced a trap composed of 5 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 05:54:19] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 70 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2641 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 51/120 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 122 constraints, problems are : Problem set: 0 solved, 51 unsolved in 4529 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7184ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 7185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/113 places, 52/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7381 ms. Remains : 58/113 places, 52/106 transitions.
[2025-06-02 05:54:26] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:54:26] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:54:26] [INFO ] Input system was already deterministic with 52 transitions.
RANDOM walk for 752 steps (108 resets) in 10 ms. (68 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-04-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 05:54:26] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:54:26] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:54:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2039419075256440381.gal : 1 ms
[2025-06-02 05:54:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15510119298935714244.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/ReachabilityCardinality2039419075256440381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15510119298935714244.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 SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 112 transition count 90
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 97 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 95 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 34 place count 95 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 92 transition count 85
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 44 place count 88 transition count 81
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 88 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 88 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 87 transition count 80
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 73 transition count 66
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 73 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 72 transition count 65
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 71 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 70 transition count 64
Applied a total of 84 rules in 35 ms. Remains 70 /113 variables (removed 43) and now considering 64/106 (removed 42) transitions.
// Phase 1: matrix 64 rows 70 cols
[2025-06-02 05:54:26] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:54:26] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 05:54:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:54:26] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:54:26] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-02 05:54:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:27] [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 05:54:27] [INFO ] Deduced a trap composed of 6 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 05:54:27] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:27] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:27] [INFO ] Deduced a trap composed of 7 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 05:54:27] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 64/133 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/134 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 84 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4484 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 64/133 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 61/144 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:32] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:36] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 147 constraints, problems are : Problem set: 0 solved, 61 unsolved in 12607 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 17112ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 17113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/113 places, 64/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17408 ms. Remains : 70/113 places, 64/106 transitions.
[2025-06-02 05:54:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:54:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:54:43] [INFO ] Input system was already deterministic with 64 transitions.
[2025-06-02 05:54:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:54:43] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:54:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality6439626537664844286.gal : 2 ms
[2025-06-02 05:54:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5702142009367959578.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/CTLCardinality6439626537664844286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5702142009367959578.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.39481e+06,0.032554,4604,2,772,5,3370,6,0,344,2731,0
Converting to forward existential form...Done !
original formula: AF((EF((A((p53==1) U (p34==1)) * ((AG((p112==1)) + (p90==0)) + (((p46==1)&&((p44==0)||(p53==1)))||((p12==0)&&(p80==1)))))) + (A((A((p50==...312
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (!((E(!((p34==1)) U (!((p53==1)) * !((p34==1)))) + EG(!((p34==1))))) * ((!(E(TRUE U !((p1...647
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t8, t10, t12, t15, t16, t26, t54, Intersection with reachable at each step e...210
(forward)formula 0,1,7.49967,210316,1,0,1639,1.347e+06,195,553,2272,1.60389e+06,1655
FORMULA MedleyA-PT-04-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 91
Applied a total of 30 rules in 7 ms. Remains 98 /113 variables (removed 15) and now considering 91/106 (removed 15) transitions.
// Phase 1: matrix 91 rows 98 cols
[2025-06-02 05:54:51] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:54:51] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-02 05:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:54:51] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-02 05:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:52] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:53] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:53] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:53] [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 05:54:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:54] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:54] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:54] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6472 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 8 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 8 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:18] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36510ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 36510ms
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 91/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36895 ms. Remains : 98/113 places, 91/106 transitions.
[2025-06-02 05:55:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:55:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:55:28] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-02 05:55:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:55:28] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:55:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9325178239133496844.gal : 2 ms
[2025-06-02 05:55:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1390318700969183360.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/CTLCardinality9325178239133496844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1390318700969183360.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15274e+07,0.069679,5196,2,1685,5,5606,6,0,485,4533,0
Converting to forward existential form...Done !
original formula: A(((p77==0)||(p47==1)) U (EG((((p0!=0) * EG(((p25==0)||(p73==1)))) * !(AX(((p110==0)||(p106==1)))))) + EX(TRUE)))
=> equivalent forward existential formula: [((Init * !(EG(!((EG((((p0!=0) * EG(((p25==0)||(p73==1)))) * !(!(EX(!(((p110==0)||(p106==1)))))))) + EX(TRUE))))...400
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t47, t50, t77, t85, Intersecti...242
(forward)formula 0,1,11.3848,285116,1,0,1463,1.68496e+06,214,231,2867,2.16128e+06,1461
FORMULA MedleyA-PT-04-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 101 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 92
Applied a total of 28 rules in 9 ms. Remains 99 /113 variables (removed 14) and now considering 92/106 (removed 14) transitions.
// Phase 1: matrix 92 rows 99 cols
[2025-06-02 05:55:39] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:55:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 05:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:55:40] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-02 05:55:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 16 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 05:55:41] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:41] [INFO ] Deduced a trap composed of 17 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 05:55:41] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:43] [INFO ] Deduced a trap composed of 11 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 05:55:43] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:43] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:43] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:46] [INFO ] Deduced a trap along path composed of 8 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/191 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 91 unsolved in 9625 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:51] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:51] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:51] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:56] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:58] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:03] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:10] [INFO ] Deduced a trap composed of 26 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 05:56:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:19] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 221 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39661ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 39662ms
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 92/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39944 ms. Remains : 99/113 places, 92/106 transitions.
[2025-06-02 05:56:19] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:56:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:56:19] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-02 05:56:19] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:56:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:56:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5806470425940688132.gal : 3 ms
[2025-06-02 05:56:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4994358962493261616.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/CTLCardinality5806470425940688132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4994358962493261616.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33654e+07,0.080047,5072,2,1750,5,5623,6,0,490,4464,0
Converting to forward existential form...Done !
original formula: EX(EF(AG(((p76==0)||((p80==1)&&(p4==0))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((p76==0)||((p80==1)&&(p4==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t11, t13, t15, t20, t22, t27, t29, t34, t36, t41, t43, t48, t51, t78, t86, Inter...247
(forward)formula 0,1,1.55298,41188,1,0,242,230763,207,111,3114,168886,245
FORMULA MedleyA-PT-04-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 101 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 93
Applied a total of 26 rules in 5 ms. Remains 100 /113 variables (removed 13) and now considering 93/106 (removed 13) transitions.
// Phase 1: matrix 93 rows 100 cols
[2025-06-02 05:56:21] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 05:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:21] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-02 05:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:22] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:22] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:22] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:23] [INFO ] Deduced a trap composed of 16 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 05:56:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:23] [INFO ] Deduced a trap composed of 17 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 05:56:23] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:24] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:24] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:25] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:25] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:25] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 7520 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:31] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:32] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:56:33] [INFO ] Deduced a trap composed of 17 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 05:56:33] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 218 constraints, problems are : Problem set: 0 solved, 92 unsolved in 25363 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32903ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 32904ms
Starting structural reductions in LTL mode, iteration 1 : 100/113 places, 93/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33102 ms. Remains : 100/113 places, 93/106 transitions.
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:56:54] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:56:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17234670894702454401.gal : 2 ms
[2025-06-02 05:56:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16961195540388223984.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/CTLCardinality17234670894702454401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16961195540388223984.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,4.15274e+07,0.050777,5080,2,1677,5,5553,6,0,495,4510,0
Converting to forward existential form...Done !
original formula: E(((p87==0)||(p75==1)) U A((EF((p39==1)) + !(E(((p19==1)||(p107==1)) U AX((p102==1))))) U EG(AX(((p4==0)||(p111==1))))))
=> equivalent forward existential formula: [((FwdU(Init,((p87==0)||(p75==1))) * !(EG(!(EG(!(EX(!(((p4==0)||(p111==1)))))))))) * !(E(!(EG(!(EX(!(((p4==0)||(...302
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t47, t48, t49, t78, t87, Inter...247
Hit Full ! (commute/partial/dont) 89/0/4
(forward)formula 0,1,12.5204,287748,1,0,1687,1.79725e+06,230,392,3193,2.06074e+06,1675
FORMULA MedleyA-PT-04-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 112 transition count 84
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 91 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 91 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 85 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 79 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 79 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 79 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 78 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 98 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 60 transition count 54
Applied a total of 102 rules in 27 ms. Remains 60 /113 variables (removed 53) and now considering 54/106 (removed 52) transitions.
// Phase 1: matrix 54 rows 60 cols
[2025-06-02 05:57:07] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:07] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-02 05:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:07] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:57:07] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-02 05:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:07] [INFO ] Deduced a trap composed of 5 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 05:57:07] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:08] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 54/113 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/114 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 72 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 54/113 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 53/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/114 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 125 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7100ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 7101ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/113 places, 54/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7352 ms. Remains : 60/113 places, 54/106 transitions.
[2025-06-02 05:57:14] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:57:14] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:57:14] [INFO ] Input system was already deterministic with 54 transitions.
[2025-06-02 05:57:14] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:57:14] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:57:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality554942701266276634.gal : 1 ms
[2025-06-02 05:57:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9919303342241486272.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/CTLCardinality554942701266276634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9919303342241486272.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,480422,0.039957,4456,2,627,5,2788,6,0,296,2131,0
Converting to forward existential form...Done !
original formula: EG(EF((p15==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p15==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t14, t47, t48, Intersection with reachable at each step enabled. (destro...194
dead was empty
(forward)formula 0,0,1.428,34456,1,0,686,177624,131,91,1905,161507,699
FORMULA MedleyA-PT-04-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 107 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 107 transition count 100
Applied a total of 12 rules in 2 ms. Remains 107 /113 variables (removed 6) and now considering 100/106 (removed 6) transitions.
// Phase 1: matrix 100 rows 107 cols
[2025-06-02 05:57:15] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 05:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:16] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2025-06-02 05:57: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/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:17] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:17] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:17] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:18] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:19] [INFO ] Deduced a trap composed of 20 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 05:57:19] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:19] [INFO ] Deduced a trap composed of 20 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 05:57:19] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:19] [INFO ] Deduced a trap composed of 17 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 05:57:19] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:19] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:19] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:20] [INFO ] Deduced a trap composed of 20 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 05:57:20] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:20] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:20] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:20] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:20] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:20] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:21] [INFO ] Deduced a trap composed of 18 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 05:57:21] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:21] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:21] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:22] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/207 variables, 107/151 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:23] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:23] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:23] [INFO ] Deduced a trap composed of 14 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 05:57:24] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 155 constraints, problems are : Problem set: 0 solved, 99 unsolved in 11637 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:28] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:28] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/207 variables, 107/157 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 99/256 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:30] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:34] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/207 variables, and 259 constraints, problems are : Problem set: 0 solved, 99 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41676ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 41677ms
Starting structural reductions in LTL mode, iteration 1 : 107/113 places, 100/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41955 ms. Remains : 107/113 places, 100/106 transitions.
[2025-06-02 05:57:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:57:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:57:57] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-02 05:57:57] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:57:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:57:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14646556849245751591.gal : 1 ms
[2025-06-02 05:57:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12730067064972792268.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/CTLCardinality14646556849245751591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12730067064972792268.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,4.36424e+07,0.094233,5184,2,1728,5,5636,6,0,530,4474,0
Converting to forward existential form...Done !
original formula: ((AF(((!(A((p70==1) U (p16==0))) + (A(((p69==0)||(p35==1)) U (p36==1)) * AF(((p22==0)||(p82==1))))) + ((AX((((p83==0)||(p66==1))&&(p47==1...594
=> equivalent forward existential formula: (([FwdG(Init,!(((!(!((E(!((p16==0)) U (!((p70==1)) * !((p16==0)))) + EG(!((p16==0)))))) + (!((E(!((p36==1)) U (!...1238
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t11, t14, t17, t18, t20, t22, t24, t29, t32, t35, t38, t41, t42, t44, t46, t48, t...278
dead was empty
(forward)formula 0,0,16.0392,430628,1,0,2588,2.82172e+06,280,876,3285,3.01584e+06,2671
FORMULA MedleyA-PT-04-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 101 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 101 transition count 94
Applied a total of 24 rules in 4 ms. Remains 101 /113 variables (removed 12) and now considering 94/106 (removed 12) transitions.
// Phase 1: matrix 94 rows 101 cols
[2025-06-02 05:58:14] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:58:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 05:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:58:14] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-02 05:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:15] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:15] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:15] [INFO ] Deduced a trap composed of 21 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 05:58:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:16] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:16] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:16] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:16] [INFO ] Deduced a trap composed of 18 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 05:58:16] [INFO ] Deduced a trap composed of 19 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 05:58:16] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:17] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6743 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 93/214 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:25] [INFO ] Deduced a trap composed of 17 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 05:58:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:26] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:28] [INFO ] Deduced a trap composed of 27 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 05:58:28] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:29] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:37] [INFO ] Deduced a trap composed of 16 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 05:58:38] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/195 variables, and 224 constraints, problems are : Problem set: 0 solved, 93 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36769ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 36770ms
Starting structural reductions in LTL mode, iteration 1 : 101/113 places, 94/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37041 ms. Remains : 101/113 places, 94/106 transitions.
[2025-06-02 05:58:51] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:58:51] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:58:51] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-02 05:58:51] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:58:51] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:58:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality17620496493287193535.gal : 1 ms
[2025-06-02 05:58:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality18286998808187388884.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/CTLCardinality17620496493287193535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18286998808187388884.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,4.16831e+07,0.047717,5080,2,1657,5,5440,6,0,500,4435,0
Converting to forward existential form...Done !
original formula: !(A(A(!(E(AG((p56==0)) U EX(TRUE))) U ((EX((p44==0)) + (p61!=1)) * !(E((p77==1) U (p26==1))))) U !(((EX(E((p68==1) U ((p36==0)||(p102==1)...255
=> equivalent forward existential formula: ((([(FwdU(EY((FwdU(Init,!(!(((EX(E((p68==1) U ((p36==0)||(p102==1)))) + (p66==1)) + (E(TRUE U EX(TRUE)) + E(E(TR...2089
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t13, t15, t16, t20, t23, t26, t28, t30, t35, t37, t42, t45, t48, t50, t53, t80, ...252
Hit Full ! (commute/partial/dont) 92/0/2
(forward)formula 0,1,6.80259,178064,1,0,1528,1.06794e+06,240,268,3298,1.22998e+06,1554
FORMULA MedleyA-PT-04-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 112 transition count 86
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 93 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 38 place count 93 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 88 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 83 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 83 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 83 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 82 transition count 75
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 92 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 65 transition count 58
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 63 transition count 57
Applied a total of 96 rules in 23 ms. Remains 63 /113 variables (removed 50) and now considering 57/106 (removed 49) transitions.
// Phase 1: matrix 57 rows 63 cols
[2025-06-02 05:58:58] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:58:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 05:58:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:58:58] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:58:58] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 05:58:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:58] [INFO ] Deduced a trap composed of 5 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 05:58:58] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:59] [INFO ] Deduced a trap composed of 6 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 05:58:59] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 75 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 55/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 1/120 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 130 constraints, problems are : Problem set: 0 solved, 55 unsolved in 4708 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8043ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 8043ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/113 places, 57/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8239 ms. Remains : 63/113 places, 57/106 transitions.
[2025-06-02 05:59:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:59:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:59:06] [INFO ] Input system was already deterministic with 57 transitions.
[2025-06-02 05:59:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:59:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:59:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality15785337900284092323.gal : 2 ms
[2025-06-02 05:59:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality16223180661709305945.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/CTLCardinality15785337900284092323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16223180661709305945.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,910267,0.024795,4384,2,641,5,2892,6,0,311,2188,0
Converting to forward existential form...Done !
original formula: EF(((p13==1) * (EF(((p40==0)||(p102==1))) + (EF(((p44==0)||(p14==1))) * AF((p24==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (p13==1)),TRUE) * ((p40==0)||(p102==1)))] != FALSE + [(((FwdU(Init,TRUE) * (p13==1)) ...221
(forward)formula 0,1,0.042087,4640,1,0,10,4319,10,2,585,2975,4
FORMULA MedleyA-PT-04-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 91
Applied a total of 30 rules in 2 ms. Remains 98 /113 variables (removed 15) and now considering 91/106 (removed 15) transitions.
// Phase 1: matrix 91 rows 98 cols
[2025-06-02 05:59:06] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:06] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 05:59:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:06] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-02 05:59: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/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:07] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:07] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:08] [INFO ] Deduced a trap composed of 16 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 05:59:08] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:08] [INFO ] Deduced a trap composed of 19 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 05:59:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:09] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:09] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:09] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:09] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6903 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:14] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:16] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:25] [INFO ] Deduced a trap along path composed of 8 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:25] [INFO ] Deduced a trap along path composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:34] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36939ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 36939ms
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 91/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37233 ms. Remains : 98/113 places, 91/106 transitions.
[2025-06-02 05:59:43] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:59:43] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:59:43] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-02 05:59:43] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:59:43] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:59:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1897010703636253077.gal : 2 ms
[2025-06-02 05:59:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality12282892628085074872.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/CTLCardinality1897010703636253077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12282892628085074872.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,4.15274e+07,0.073204,5196,2,1685,5,5606,6,0,485,4533,0
Converting to forward existential form...Done !
original formula: AX(AG(((p61==1) + (!(E((p20==1) U (p111==1))) * AG((p28==0))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),TRUE) * !((p61==1))),(p20==1)) * (p111==1))] = FALSE * [(FwdU((FwdU(EY(Init),TRUE) * !((p...194
(forward)formula 0,0,0.152934,6348,1,0,13,11828,12,4,973,13430,7
FORMULA MedleyA-PT-04-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-02 05:59:43] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:59:43] [INFO ] Flatten gal took : 6 ms
Total runtime 443583 ms.
BK_STOP 1748843983924
--------------------
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-04"
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-04, 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-174876524000121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-04.tgz
mv MedleyA-PT-04 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 ;