Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500450.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 CO4-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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.5K 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 132K 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 CO4-PT-10-CTLFireability-2024-12
FORMULA_NAME CO4-PT-10-CTLFireability-2024-13
FORMULA_NAME CO4-PT-10-CTLFireability-2024-14
FORMULA_NAME CO4-PT-10-CTLFireability-2024-15
FORMULA_NAME CO4-PT-10-CTLFireability-2025-00
FORMULA_NAME CO4-PT-10-CTLFireability-2025-01
FORMULA_NAME CO4-PT-10-CTLFireability-2025-02
FORMULA_NAME CO4-PT-10-CTLFireability-2025-03
FORMULA_NAME CO4-PT-10-CTLFireability-2025-04
FORMULA_NAME CO4-PT-10-CTLFireability-2025-05
FORMULA_NAME CO4-PT-10-CTLFireability-2025-06
FORMULA_NAME CO4-PT-10-CTLFireability-2025-07
FORMULA_NAME CO4-PT-10-CTLFireability-2025-08
FORMULA_NAME CO4-PT-10-CTLFireability-2025-09
FORMULA_NAME CO4-PT-10-CTLFireability-2025-10
FORMULA_NAME CO4-PT-10-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748606581372

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 12:03:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:03:02] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-05-30 12:03:02] [INFO ] Transformed 544 places.
[2025-05-30 12:03:02] [INFO ] Transformed 615 transitions.
[2025-05-30 12:03:02] [INFO ] Found NUPN structural information;
[2025-05-30 12:03:02] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 157 places in 9 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 375 transition count 435
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 62 place count 328 transition count 387
Iterating global reduction 1 with 47 rules applied. Total rules applied 109 place count 328 transition count 387
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 143 place count 294 transition count 353
Iterating global reduction 1 with 34 rules applied. Total rules applied 177 place count 294 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 179 place count 294 transition count 351
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 195 place count 278 transition count 335
Iterating global reduction 2 with 16 rules applied. Total rules applied 211 place count 278 transition count 335
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 217 place count 272 transition count 329
Iterating global reduction 2 with 6 rules applied. Total rules applied 223 place count 272 transition count 329
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 225 place count 270 transition count 327
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 270 transition count 327
Applied a total of 227 rules in 99 ms. Remains 270 /387 variables (removed 117) and now considering 327/438 (removed 111) transitions.
// Phase 1: matrix 327 rows 270 cols
[2025-05-30 12:03:02] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:03] [INFO ] Implicit Places using invariants in 235 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 269/387 places, 327/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 269/387 places, 327/438 transitions.
Support contains 66 out of 269 places after structural reductions.
[2025-05-30 12:03:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-05-30 12:03:03] [INFO ] Flatten gal took : 48 ms
FORMULA CO4-PT-10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:03:03] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:03:03] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 47 out of 269 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (76 resets) in 1985 ms. (20 steps per ms) remains 30/42 properties
BEST_FIRST walk for 4002 steps (25 resets) in 143 ms. (27 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (34 resets) in 68 ms. (57 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (39 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (38 resets) in 21 ms. (182 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4001 steps (20 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4001 steps (34 resets) in 30 ms. (129 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4001 steps (35 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (32 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (25 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (28 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (35 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (34 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (30 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (23 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (21 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (23 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (23 resets) in 16 ms. (235 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4001 steps (29 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (35 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
// Phase 1: matrix 327 rows 269 cols
[2025-05-30 12:03:04] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SMT process timed out in 8116ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 327/327 transitions.
Graph (trivial) has 227 edges and 269 vertex of which 3 / 269 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 395 edges and 267 vertex of which 256 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 256 transition count 201
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 117 rules applied. Total rules applied 233 place count 151 transition count 189
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 244 place count 140 transition count 189
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 244 place count 140 transition count 173
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 276 place count 124 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 277 place count 123 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 278 place count 123 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 122 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 122 transition count 171
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 332 place count 96 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 96 transition count 143
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 335 place count 94 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 337 place count 94 transition count 141
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 363 place count 81 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 368 place count 81 transition count 137
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 377 place count 72 transition count 119
Iterating global reduction 5 with 9 rules applied. Total rules applied 386 place count 72 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 391 place count 72 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 395 place count 72 transition count 110
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 405 place count 72 transition count 100
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 416 place count 62 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 417 place count 62 transition count 98
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 419 place count 62 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 420 place count 61 transition count 97
Applied a total of 420 rules in 89 ms. Remains 61 /269 variables (removed 208) and now considering 97/327 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 61/269 places, 97/327 transitions.
RANDOM walk for 40000 steps (464 resets) in 580 ms. (68 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40004 steps (115 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (103 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
[2025-05-30 12:03:12] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
// Phase 1: matrix 94 rows 61 cols
[2025-05-30 12:03:12] [INFO ] Computed 1 invariants in 1 ms
[2025-05-30 12:03:12] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/92 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 9/34 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 49/141 variables, 29/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp35 is UNSAT
After SMT solving in domain Real declared 152/155 variables, and 70 constraints, problems are : Problem set: 3 solved, 0 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 59/61 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2025-05-30 12:03:13] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:03:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-10-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:03:13] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:03:13] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 33 out of 269 places (down from 41) after GAL structural reductions.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 398 edges and 269 vertex of which 260 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 298
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 241 transition count 297
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 222 transition count 278
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 222 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 222 transition count 276
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 106 place count 213 transition count 267
Iterating global reduction 2 with 9 rules applied. Total rules applied 115 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 213 transition count 266
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 122 place count 207 transition count 260
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 206 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 206 transition count 258
Applied a total of 131 rules in 32 ms. Remains 206 /269 variables (removed 63) and now considering 258/327 (removed 69) transitions.
// Phase 1: matrix 258 rows 206 cols
[2025-05-30 12:03:13] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 12:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:13] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:20] [INFO ] Deduced a trap composed of 15 places in 957 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 17269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:37] [INFO ] Deduced a trap along path composed of 3 places in 256 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 469 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47364ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 47367ms
Starting structural reductions in LTL mode, iteration 1 : 206/269 places, 258/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47603 ms. Remains : 206/269 places, 258/327 transitions.
[2025-05-30 12:04:00] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:04:00] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:04:00] [INFO ] Input system was already deterministic with 258 transitions.
[2025-05-30 12:04:00] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:04:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18261357034931723898.gal : 4 ms
[2025-05-30 12:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability202179591675936831.ctl : 6 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/CTLFireability18261357034931723898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability202179591675936831.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,382516,0.101665,7692,2,1318,5,13762,6,0,1080,14926,0


Converting to forward existential form...Done !
original formula: EF((AX(FALSE) * (p299==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p299==1)) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t93, t150, t1...295
(forward)formula 0,0,0.7815,33280,1,0,331,85810,532,220,5598,98335,523
FORMULA CO4-PT-10-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 299
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 242 transition count 298
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 224 transition count 280
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 224 transition count 278
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 102 place count 215 transition count 269
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 215 transition count 268
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 210 transition count 263
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 210 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 210 transition count 262
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 209 transition count 261
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 209 transition count 261
Applied a total of 125 rules in 24 ms. Remains 209 /269 variables (removed 60) and now considering 261/327 (removed 66) transitions.
// Phase 1: matrix 261 rows 209 cols
[2025-05-30 12:04:01] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-30 12:04:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-05-30 12:04:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/470 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:07] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:07] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 214 constraints, problems are : Problem set: 0 solved, 260 unsolved in 16444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/470 variables, 209/214 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 260/474 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:25] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 475 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46493ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 46494ms
Starting structural reductions in LTL mode, iteration 1 : 209/269 places, 261/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46702 ms. Remains : 209/269 places, 261/327 transitions.
[2025-05-30 12:04:48] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:04:48] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:04:48] [INFO ] Input system was already deterministic with 261 transitions.
[2025-05-30 12:04:48] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:04:48] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6148512916077762752.gal : 3 ms
[2025-05-30 12:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17953037742363494877.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/CTLFireability6148512916077762752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17953037742363494877.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,389734,0.093652,7900,2,1339,5,13941,6,0,1094,15404,0


Converting to forward existential form...Done !
original formula: (EG(AG((p216==0))) * A(A(((p295==1) * AX(FALSE)) U (AX(FALSE) + EF(EX((p363==1))))) U ((p207!=1)&&(p283==1))))
=> equivalent forward existential formula: [(((Init * EG(!(E(TRUE U !((p216==0)))))) * !(EG(!(((p207!=1)&&(p283==1)))))) * !(E(!(((p207!=1)&&(p283==1))) U ...394
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t151, t152, t...296
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.8792,409404,1,0,1326,2.0339e+06,563,777,6414,2.96596e+06,1599
FORMULA CO4-PT-10-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 300
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 300
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 222 transition count 280
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 222 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 96 place count 222 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 213 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 213 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 213 transition count 268
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 121 place count 207 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 127 place count 207 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 207 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 206 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 206 transition count 260
Applied a total of 130 rules in 16 ms. Remains 206 /269 variables (removed 63) and now considering 260/327 (removed 67) transitions.
// Phase 1: matrix 260 rows 206 cols
[2025-05-30 12:05:01] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 12:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:01] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-05-30 12:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/466 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:07] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:07] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 211 constraints, problems are : Problem set: 0 solved, 259 unsolved in 16051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/466 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 259/470 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:40] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 471 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46096ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 46097ms
Starting structural reductions in LTL mode, iteration 1 : 206/269 places, 260/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46272 ms. Remains : 206/269 places, 260/327 transitions.
[2025-05-30 12:05:47] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:05:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:47] [INFO ] Input system was already deterministic with 260 transitions.
[2025-05-30 12:05:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:47] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16775800007669348594.gal : 1 ms
[2025-05-30 12:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability564574402369159509.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/CTLFireability16775800007669348594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability564574402369159509.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,489062,0.093467,7768,2,1322,5,13614,6,0,1082,14585,0


Converting to forward existential form...Done !
original formula: A((p201==1) U EX(!(A(EF((p537==1)) U EX((p209==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(!((E(!(EX((p209==1))) U (!(E(TRUE U (p537==1))) * !(EX((p209==1))))) + EG(!(EX((p209==1)))...410
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t95...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,1,6.99459,200624,1,0,733,985146,555,472,6356,1.22589e+06,932
FORMULA CO4-PT-10-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 298
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 241 transition count 297
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 221 transition count 277
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 221 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 108 place count 212 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 117 place count 212 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 212 transition count 265
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 206 transition count 259
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 206 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 206 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 205 transition count 257
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 205 transition count 257
Applied a total of 133 rules in 16 ms. Remains 205 /269 variables (removed 64) and now considering 257/327 (removed 70) transitions.
// Phase 1: matrix 257 rows 205 cols
[2025-05-30 12:05:54] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-30 12:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-05-30 12:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/462 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:00] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:00] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 210 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/462 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 256/466 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:16] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 467 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45962ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 45963ms
Starting structural reductions in LTL mode, iteration 1 : 205/269 places, 257/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46180 ms. Remains : 205/269 places, 257/327 transitions.
[2025-05-30 12:06:40] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:06:40] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:06:40] [INFO ] Input system was already deterministic with 257 transitions.
[2025-05-30 12:06:40] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:06:40] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:06:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1886591199190157966.gal : 1 ms
[2025-05-30 12:06:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16789068521450587672.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/CTLFireability1886591199190157966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16789068521450587672.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,380110,0.096818,7680,2,1311,5,13574,6,0,1074,14525,0


Converting to forward existential form...Done !
original formula: (AX(AF(EG((p271==0)))) + AF(AX((p541==0))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(EG(!(EG((p271==0)))))))))),!(!(EX(!((p541==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t93, t149, t1...295
Using saturation style SCC detection
(forward)formula 0,1,4.92544,160220,1,0,876,762186,548,494,6015,959214,1137
FORMULA CO4-PT-10-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Graph (trivial) has 273 edges and 269 vertex of which 3 / 269 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 396 edges and 267 vertex of which 258 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 257 transition count 190
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 127 rules applied. Total rules applied 253 place count 133 transition count 187
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 257 place count 132 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 260 place count 129 transition count 184
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 260 place count 129 transition count 169
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 290 place count 114 transition count 169
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 297 place count 107 transition count 161
Iterating global reduction 4 with 7 rules applied. Total rules applied 304 place count 107 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 305 place count 107 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 305 place count 107 transition count 158
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 309 place count 105 transition count 158
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 312 place count 102 transition count 155
Iterating global reduction 5 with 3 rules applied. Total rules applied 315 place count 102 transition count 155
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 345 place count 87 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 3 rules applied. Total rules applied 348 place count 87 transition count 136
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 350 place count 86 transition count 135
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 353 place count 83 transition count 132
Iterating global reduction 7 with 3 rules applied. Total rules applied 356 place count 83 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 365 place count 83 transition count 123
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 4 rules applied. Total rules applied 369 place count 83 transition count 119
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 373 place count 79 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 373 place count 79 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 375 place count 78 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 377 place count 77 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 379 place count 75 transition count 115
Applied a total of 379 rules in 40 ms. Remains 75 /269 variables (removed 194) and now considering 115/327 (removed 212) transitions.
// Phase 1: matrix 115 rows 75 cols
[2025-05-30 12:06:45] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 12:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:06:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:06:46] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-30 12:06:46] [INFO ] Invariant cache hit.
[2025-05-30 12:06:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/189 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/190 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 79 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3198 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 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/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/189 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 105/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/190 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 184 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8226ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 8227ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/269 places, 115/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8363 ms. Remains : 75/269 places, 115/327 transitions.
[2025-05-30 12:06:54] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:06:54] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:06:54] [INFO ] Input system was already deterministic with 115 transitions.
[2025-05-30 12:06:54] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:06:54] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9326492571082820244.gal : 1 ms
[2025-05-30 12:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1035949051632592857.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/CTLFireability9326492571082820244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1035949051632592857.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,9559,0.029217,4472,2,234,5,2164,6,0,407,1955,0


Converting to forward existential form...Done !
original formula: A((p367==1) U EF(EG(AG(A((p369==1) U (p418==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG(!(E(TRUE U !(!((E(!((p418==1)) U (!((p369==1)) * !((p418==1)))) + EG(!((p418==1))))...413
Reverse transition relation is NOT exact ! Due to transitions t9, t21, t34, t38, t43, t112, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,0,0.237024,14072,1,0,268,57543,268,145,2550,54217,396
FORMULA CO4-PT-10-CTLFireability-2025-06 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 : 269/269 places, 327/327 transitions.
Graph (trivial) has 277 edges and 269 vertex of which 3 / 269 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 396 edges and 267 vertex of which 258 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 257 transition count 184
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 263 place count 127 transition count 183
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 263 place count 127 transition count 169
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 291 place count 113 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 297 place count 107 transition count 162
Iterating global reduction 2 with 6 rules applied. Total rules applied 303 place count 107 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 107 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 304 place count 107 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 308 place count 105 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 311 place count 102 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 314 place count 102 transition count 156
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 346 place count 86 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 349 place count 86 transition count 136
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 351 place count 85 transition count 135
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 354 place count 82 transition count 132
Iterating global reduction 5 with 3 rules applied. Total rules applied 357 place count 82 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 364 place count 82 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 82 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 368 place count 80 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 368 place count 80 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 370 place count 79 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 372 place count 78 transition count 121
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 78 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 374 place count 78 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 76 transition count 118
Applied a total of 376 rules in 39 ms. Remains 76 /269 variables (removed 193) and now considering 118/327 (removed 209) transitions.
// Phase 1: matrix 118 rows 76 cols
[2025-05-30 12:06:54] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 12:06:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:06:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:06:54] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-30 12:06:54] [INFO ] Invariant cache hit.
[2025-05-30 12:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 80 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 108/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/194 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 188 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4987 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8404ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 8404ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/269 places, 118/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8543 ms. Remains : 76/269 places, 118/327 transitions.
[2025-05-30 12:07:03] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:07:03] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:07:03] [INFO ] Input system was already deterministic with 118 transitions.
[2025-05-30 12:07:03] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:07:03] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:07:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11871887656543537357.gal : 0 ms
[2025-05-30 12:07:03] [INFO ] Time to serialize properties into /tmp/CTLFireability2459404632044829371.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/CTLFireability11871887656543537357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2459404632044829371.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,13105,0.02471,4512,2,241,5,2295,6,0,414,2181,0


Converting to forward existential form...Done !
original formula: EG(AG((EG((p478==0)) + (p335==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((EG((p478==0)) + (p335==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t24, t39, t43, t48, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,0,0.256696,15204,1,0,263,67360,267,143,2615,59857,392
FORMULA CO4-PT-10-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 240 transition count 297
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 240 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 240 transition count 296
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 220 transition count 276
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 220 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 220 transition count 274
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 211 transition count 265
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 211 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 211 transition count 264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 205 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 205 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 205 transition count 257
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 204 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 204 transition count 256
Applied a total of 135 rules in 14 ms. Remains 204 /269 variables (removed 65) and now considering 256/327 (removed 71) transitions.
// Phase 1: matrix 256 rows 204 cols
[2025-05-30 12:07:03] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:03] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-30 12:07:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:03] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-05-30 12:07:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:09] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:09] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 209 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 255/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:26] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 465 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45348ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 45348ms
Starting structural reductions in LTL mode, iteration 1 : 204/269 places, 256/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45609 ms. Remains : 204/269 places, 256/327 transitions.
[2025-05-30 12:07:49] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:07:49] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:49] [INFO ] Input system was already deterministic with 256 transitions.
[2025-05-30 12:07:49] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:07:49] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:07:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1619921320402168485.gal : 1 ms
[2025-05-30 12:07:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1323117812680724321.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/CTLFireability1619921320402168485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1323117812680724321.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,377704,0.091588,7652,2,1304,5,13498,6,0,1070,14450,0


Converting to forward existential form...Done !
original formula: EX(AG((p318==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p318==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t93, t148, t1...295
(forward)formula 0,0,1.12253,42112,1,0,347,132872,534,227,5874,133168,546
FORMULA CO4-PT-10-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 243 transition count 300
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 243 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 243 transition count 299
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 226 transition count 282
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 226 transition count 280
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 219 transition count 273
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 219 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 219 transition count 272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 214 transition count 267
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 214 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 214 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 213 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 213 transition count 265
Applied a total of 117 rules in 26 ms. Remains 213 /269 variables (removed 56) and now considering 265/327 (removed 62) transitions.
// Phase 1: matrix 265 rows 213 cols
[2025-05-30 12:07:50] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 12:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:50] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-05-30 12:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/478 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 218 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16710 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/478 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 264/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 482 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46741ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 46742ms
Starting structural reductions in LTL mode, iteration 1 : 213/269 places, 265/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46941 ms. Remains : 213/269 places, 265/327 transitions.
[2025-05-30 12:08:37] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:37] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:37] [INFO ] Input system was already deterministic with 265 transitions.
[2025-05-30 12:08:37] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:08:37] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16883639315411106652.gal : 2 ms
[2025-05-30 12:08:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15157110659333586759.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/CTLFireability16883639315411106652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15157110659333586759.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,399358,0.103184,7960,2,1361,5,14199,6,0,1115,15830,0


Converting to forward existential form...Done !
original formula: EX((A((p144==1) U AF((p410==1))) * !(E((p382==1) U (p428==1)))))
=> equivalent forward existential formula: [((EY(Init) * !((E(!(!(EG(!((p410==1))))) U (!((p144==1)) * !(!(EG(!((p410==1))))))) + EG(!(!(EG(!((p410==1)))))...200
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t98, t153, t1...295
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.00471,203020,1,0,910,966953,566,540,6235,1.27739e+06,1208
FORMULA CO4-PT-10-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 299
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 242 transition count 298
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 224 transition count 280
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 224 transition count 278
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 217 transition count 271
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 217 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 217 transition count 270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 213 transition count 266
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 213 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 212 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 212 transition count 265
Applied a total of 118 rules in 22 ms. Remains 212 /269 variables (removed 57) and now considering 265/327 (removed 62) transitions.
// Phase 1: matrix 265 rows 212 cols
[2025-05-30 12:08:44] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-30 12:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:44] [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.
Running 264 sub problems to find dead transitions.
[2025-05-30 12:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/477 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:50] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 217 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16545 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/477 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 264/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:07] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 482 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46582ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 46582ms
Starting structural reductions in LTL mode, iteration 1 : 212/269 places, 265/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46774 ms. Remains : 212/269 places, 265/327 transitions.
[2025-05-30 12:09:31] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:31] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:09:31] [INFO ] Input system was already deterministic with 265 transitions.
[2025-05-30 12:09:31] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:09:31] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:09:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7900855138292126748.gal : 1 ms
[2025-05-30 12:09:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3958616003731191930.ctl : 14 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/CTLFireability7900855138292126748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3958616003731191930.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,429082,0.106065,7956,2,1372,5,14331,6,0,1110,15182,0


Converting to forward existential form...Done !
original formula: EF((E(!(AX(AF((p515==1)))) U ((p216!=1) * AX((p250!=1)))) * EG((EX((p458==1)) * AG((p343==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(!(!(EX(!(!(EG(!((p515==1)))))))) U ((p216!=1) * !(EX(!((p250!=1))))))),(EX((p458==1))...195
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t22, t23, t31, t40, t42, t43, t44, t45, t46, t49, t51, t54, t98...305
(forward)formula 0,0,5.55967,165560,1,0,690,789161,571,378,6208,961771,941
FORMULA CO4-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 243 transition count 300
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 243 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 243 transition count 299
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 225 transition count 281
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 225 transition count 279
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 218 transition count 272
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 218 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 218 transition count 271
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 214 transition count 267
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 214 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 214 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 213 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 213 transition count 265
Applied a total of 117 rules in 15 ms. Remains 213 /269 variables (removed 56) and now considering 265/327 (removed 62) transitions.
// Phase 1: matrix 265 rows 213 cols
[2025-05-30 12:09:36] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-30 12:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:36] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-05-30 12:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/478 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:42] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:42] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 218 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16941 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/478 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 264/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:04] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 483 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46977ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 46980ms
Starting structural reductions in LTL mode, iteration 1 : 213/269 places, 265/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47147 ms. Remains : 213/269 places, 265/327 transitions.
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:10:23] [INFO ] Input system was already deterministic with 265 transitions.
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:10:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14078645622340288974.gal : 1 ms
[2025-05-30 12:10:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2931298784490839412.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/CTLFireability14078645622340288974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2931298784490839412.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,399358,0.222798,12060,2,1469,5,28351,6,0,1115,41260,0


Converting to forward existential form...Done !
original formula: A((A(EX(AX(FALSE)) U ((p206!=1) + AF((p530==1)))) + EX(EF((p280==1)))) U A(!(((p482!=1) + !(AF((p410==1))))) U !(AF((p395==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(!(EG(!((p395==1)))))) U (!(!(((p482!=1) + !(!(EG(!((p410==1)))))))) * !(!(!(EG(!((p395...702
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t98, t155, t1...295
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,27.576,739376,1,0,1685,5.51113e+06,582,898,6852,4.07217e+06,2090
FORMULA CO4-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 327/327 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 298
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 241 transition count 297
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 222 transition count 278
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 222 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 222 transition count 277
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 104 place count 214 transition count 269
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 214 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 214 transition count 268
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 209 transition count 263
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 209 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 208 transition count 262
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 208 transition count 262
Applied a total of 125 rules in 20 ms. Remains 208 /269 variables (removed 61) and now considering 262/327 (removed 65) transitions.
// Phase 1: matrix 262 rows 208 cols
[2025-05-30 12:10:51] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 12:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:51] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-05-30 12:10: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/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/470 variables, 208/211 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:57] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:57] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 213 constraints, problems are : Problem set: 0 solved, 261 unsolved in 16346 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/470 variables, 208/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 261/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:15] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 475 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46392ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 46392ms
Starting structural reductions in LTL mode, iteration 1 : 208/269 places, 262/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46575 ms. Remains : 208/269 places, 262/327 transitions.
[2025-05-30 12:11:38] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:11:38] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:11:38] [INFO ] Input system was already deterministic with 262 transitions.
[2025-05-30 12:11:38] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:11:38] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:11:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4215118013302835216.gal : 1 ms
[2025-05-30 12:11:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15763101495848115131.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/CTLFireability4215118013302835216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15763101495848115131.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,430456,0.099981,7780,2,1324,5,13915,6,0,1092,14848,0


Converting to forward existential form...Done !
original formula: EG(EF(AG((A((p507==1) U (p181==1)) * EX((p454==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((!((E(!((p181==1)) U (!((p507==1)) * !((p181==1)))) + EG(!((p181==1))))) * EX((...180
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t47, t49, t51, t54, t98...305
(forward)formula 0,0,5.58381,169600,1,0,705,816223,561,383,6115,1.0337e+06,962
FORMULA CO4-PT-10-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-05-30 12:11:43] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:11:43] [INFO ] Flatten gal took : 5 ms
Total runtime 521420 ms.

BK_STOP 1748607103992

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028500450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-10.tgz
mv CO4-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;