Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 255K 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-15-CTLFireability-2024-12
FORMULA_NAME CO4-PT-15-CTLFireability-2024-13
FORMULA_NAME CO4-PT-15-CTLFireability-2024-14
FORMULA_NAME CO4-PT-15-CTLFireability-2024-15
FORMULA_NAME CO4-PT-15-CTLFireability-2025-00
FORMULA_NAME CO4-PT-15-CTLFireability-2025-01
FORMULA_NAME CO4-PT-15-CTLFireability-2025-02
FORMULA_NAME CO4-PT-15-CTLFireability-2025-03
FORMULA_NAME CO4-PT-15-CTLFireability-2025-04
FORMULA_NAME CO4-PT-15-CTLFireability-2025-05
FORMULA_NAME CO4-PT-15-CTLFireability-2025-06
FORMULA_NAME CO4-PT-15-CTLFireability-2025-07
FORMULA_NAME CO4-PT-15-CTLFireability-2025-08
FORMULA_NAME CO4-PT-15-CTLFireability-2025-09
FORMULA_NAME CO4-PT-15-CTLFireability-2025-10
FORMULA_NAME CO4-PT-15-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748607591202

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 12:19:52] [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:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:19:52] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-05-30 12:19:52] [INFO ] Transformed 833 places.
[2025-05-30 12:19:52] [INFO ] Transformed 1106 transitions.
[2025-05-30 12:19:52] [INFO ] Found NUPN structural information;
[2025-05-30 12:19:52] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 124 places in 11 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 153 places :
Symmetric choice reduction at 1 with 153 rule applications. Total rules 176 place count 536 transition count 751
Iterating global reduction 1 with 153 rules applied. Total rules applied 329 place count 536 transition count 751
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 335 place count 536 transition count 745
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 410 place count 461 transition count 662
Iterating global reduction 2 with 75 rules applied. Total rules applied 485 place count 461 transition count 662
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 487 place count 461 transition count 660
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 502 place count 446 transition count 638
Iterating global reduction 3 with 15 rules applied. Total rules applied 517 place count 446 transition count 638
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 519 place count 446 transition count 636
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 526 place count 439 transition count 629
Iterating global reduction 4 with 7 rules applied. Total rules applied 533 place count 439 transition count 629
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 538 place count 434 transition count 624
Iterating global reduction 4 with 5 rules applied. Total rules applied 543 place count 434 transition count 624
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 548 place count 434 transition count 619
Applied a total of 548 rules in 163 ms. Remains 434 /709 variables (removed 275) and now considering 619/909 (removed 290) transitions.
// Phase 1: matrix 619 rows 434 cols
[2025-05-30 12:19:52] [INFO ] Computed 7 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:53] [INFO ] Implicit Places using invariants in 325 ms returned [5, 369]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 358 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 432/709 places, 619/909 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 619/619 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 549 ms. Remains : 432/709 places, 619/909 transitions.
Support contains 54 out of 432 places after structural reductions.
[2025-05-30 12:19:53] [INFO ] Flatten gal took : 74 ms
[2025-05-30 12:19:53] [INFO ] Flatten gal took : 33 ms
[2025-05-30 12:19:53] [INFO ] Input system was already deterministic with 619 transitions.
Support contains 45 out of 432 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (495 resets) in 2325 ms. (17 steps per ms) remains 21/31 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 50 ms. (78 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (15 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (14 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
// Phase 1: matrix 619 rows 432 cols
[2025-05-30 12:19:54] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 14/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 201/262 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 428/690 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 300/990 variables, 167/394 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/990 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 51/1041 variables, 37/431 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1041 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 13 (OVERLAPS) 10/1051 variables, 6/437 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1051 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/1051 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1051/1051 variables, and 437 constraints, problems are : Problem set: 1 solved, 19 unsolved in 2384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 15/44 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 14/58 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 194/252 variables, 58/63 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 428/680 variables, 157/221 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/680 variables, 18/239 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/680 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 309/989 variables, 173/412 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/989 variables, 0/412 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 52/1041 variables, 38/450 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1041 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 15 (OVERLAPS) 10/1051 variables, 6/456 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1051 variables, 0/456 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1051 variables, 0/456 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1051/1051 variables, and 456 constraints, problems are : Problem set: 2 solved, 18 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7449ms problems are : Problem set: 2 solved, 18 unsolved
Fused 18 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 54 ms.
Support contains 21 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 619/619 transitions.
Graph (trivial) has 427 edges and 432 vertex of which 2 / 432 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 901 edges and 431 vertex of which 429 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 429 transition count 456
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 155 rules applied. Total rules applied 311 place count 280 transition count 450
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 279 transition count 448
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 317 place count 278 transition count 446
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 10 rules applied. Total rules applied 327 place count 277 transition count 437
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 336 place count 268 transition count 437
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 336 place count 268 transition count 398
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 414 place count 229 transition count 398
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 423 place count 220 transition count 387
Iterating global reduction 6 with 9 rules applied. Total rules applied 432 place count 220 transition count 387
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 435 place count 220 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 435 place count 220 transition count 382
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 439 place count 218 transition count 382
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 441 place count 216 transition count 378
Iterating global reduction 7 with 2 rules applied. Total rules applied 443 place count 216 transition count 378
Performed 56 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 555 place count 160 transition count 310
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
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 7 with 14 rules applied. Total rules applied 569 place count 160 transition count 296
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 573 place count 158 transition count 294
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 576 place count 155 transition count 288
Iterating global reduction 9 with 3 rules applied. Total rules applied 579 place count 155 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 580 place count 155 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 586 place count 152 transition count 284
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 10 with 76 rules applied. Total rules applied 662 place count 114 transition count 324
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 677 place count 114 transition count 309
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 699 place count 92 transition count 221
Iterating global reduction 11 with 22 rules applied. Total rules applied 721 place count 92 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 732 place count 92 transition count 210
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 735 place count 89 transition count 192
Iterating global reduction 12 with 3 rules applied. Total rules applied 738 place count 89 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 740 place count 89 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 750 place count 89 transition count 180
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 758 place count 89 transition count 172
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 766 place count 81 transition count 172
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 767 place count 81 transition count 172
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 771 place count 81 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 774 place count 81 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 775 place count 80 transition count 168
Applied a total of 775 rules in 129 ms. Remains 80 /432 variables (removed 352) and now considering 168/619 (removed 451) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 80/432 places, 168/619 transitions.
RANDOM walk for 40000 steps (8 resets) in 945 ms. (42 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/4 properties
[2025-05-30 12:20:02] [INFO ] Flow matrix only has 158 transitions (discarded 10 similar events)
// Phase 1: matrix 158 rows 80 cols
[2025-05-30 12:20:02] [INFO ] Computed 6 invariants in 2 ms
[2025-05-30 12:20:02] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/116 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/146 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/154 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 77/231 variables, 55/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/236 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/238 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/238 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 101 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/116 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/146 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/154 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 77/231 variables, 55/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/236 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/238 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/238 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/238 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 18 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2025-05-30 12:20:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:20:03] [INFO ] Flatten gal took : 29 ms
FORMULA CO4-PT-15-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:20:03] [INFO ] Flatten gal took : 28 ms
[2025-05-30 12:20:03] [INFO ] Input system was already deterministic with 619 transitions.
Support contains 39 out of 432 places (down from 40) after GAL structural reductions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 903 edges and 432 vertex of which 428 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 412 transition count 596
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 412 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 412 transition count 595
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 406 transition count 587
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 406 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 406 transition count 586
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 404 transition count 584
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 404 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 404 transition count 583
Applied a total of 59 rules in 45 ms. Remains 404 /432 variables (removed 28) and now considering 583/619 (removed 36) transitions.
// Phase 1: matrix 583 rows 404 cols
[2025-05-30 12:20:03] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:03] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 12:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:03] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2025-05-30 12:20: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/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/987 variables, 404/410 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:27] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:27] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:28] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 413 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/987 variables, 404/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 582/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 404/432 places, 583/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 404/432 places, 583/619 transitions.
[2025-05-30 12:21:03] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:21:03] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:21:03] [INFO ] Input system was already deterministic with 583 transitions.
[2025-05-30 12:21:03] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:21:03] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:21:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4717678340999551824.gal : 12 ms
[2025-05-30 12:21:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14015694273392043533.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4717678340999551824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14015694273392043533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27366e+11,5.1402,156160,2,19099,5,486680,6,0,2192,716793,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:21:34] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:21:34] [INFO ] Applying decomposition
[2025-05-30 12:21:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16893058643774757520.txt' '-o' '/tmp/graph16893058643774757520.bin' '-w' '/tmp/graph16893058643774757520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16893058643774757520.bin' '-l' '-1' '-v' '-w' '/tmp/graph16893058643774757520.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:21:34] [INFO ] Decomposing Gal with order
[2025-05-30 12:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:21:34] [INFO ] Removed a total of 377 redundant transitions.
[2025-05-30 12:21:34] [INFO ] Flatten gal took : 73 ms
[2025-05-30 12:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 13 ms.
[2025-05-30 12:21:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15895804667917058347.gal : 10 ms
[2025-05-30 12:21:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12817878469404335848.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/CTLFireability15895804667917058347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12817878469404335848.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27366e+11,0.384363,19832,966,81,29296,1258,1054,71542,79,4978,0


Converting to forward existential form...Done !
original formula: AF(EX((E(AX(((i2.i4.u36.p239==1)&&(i6.u53.p371==1))) U (i2.i4.u35.p238==1)) * ((AF(AX((i2.i2.u14.p140==1))) + (i6.u53.p344==0)) + (i4.i1....171
=> equivalent forward existential formula: [FwdG(Init,!(EX((E(!(EX(!(((i2.i4.u36.p239==1)&&(i6.u53.p371==1))))) U (i2.i4.u35.p238==1)) * ((!(EG(!(!(EX(!((i...234
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t46, t74, t132, t142, t158, t189, t211, t278, t307, t437, t472, t526, t556, t55...1037
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Graph (trivial) has 447 edges and 432 vertex of which 2 / 432 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 902 edges and 431 vertex of which 429 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 428 transition count 458
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 159 rules applied. Total rules applied 318 place count 275 transition count 452
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 321 place count 274 transition count 450
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 324 place count 273 transition count 448
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 4 with 7 rules applied. Total rules applied 331 place count 272 transition count 442
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 337 place count 266 transition count 442
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 337 place count 266 transition count 402
Deduced a syphon composed of 40 places in 32 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 417 place count 226 transition count 402
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 425 place count 218 transition count 392
Iterating global reduction 6 with 8 rules applied. Total rules applied 433 place count 218 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 434 place count 218 transition count 391
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 434 place count 218 transition count 388
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 440 place count 215 transition count 388
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 443 place count 212 transition count 383
Iterating global reduction 7 with 3 rules applied. Total rules applied 446 place count 212 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 447 place count 212 transition count 382
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 491 place count 190 transition count 359
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 8 with 7 rules applied. Total rules applied 498 place count 190 transition count 352
Reduce places removed 2 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 9 with 5 rules applied. Total rules applied 503 place count 188 transition count 349
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 505 place count 187 transition count 348
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 508 place count 184 transition count 342
Iterating global reduction 11 with 3 rules applied. Total rules applied 511 place count 184 transition count 342
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 512 place count 183 transition count 340
Iterating global reduction 11 with 1 rules applied. Total rules applied 513 place count 183 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 514 place count 183 transition count 339
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 520 place count 180 transition count 336
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 12 with 3 rules applied. Total rules applied 523 place count 180 transition count 333
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 13 with 3 rules applied. Total rules applied 526 place count 179 transition count 331
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 528 place count 178 transition count 330
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 15 with 2 rules applied. Total rules applied 530 place count 177 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 543 place count 177 transition count 316
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 15 with 7 rules applied. Total rules applied 550 place count 177 transition count 309
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 557 place count 170 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 559 place count 169 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 561 place count 167 transition count 306
Applied a total of 561 rules in 159 ms. Remains 167 /432 variables (removed 265) and now considering 306/619 (removed 313) transitions.
// Phase 1: matrix 306 rows 167 cols
[2025-05-30 12:22:04] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 12:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:04] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-30 12:22:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:22:04] [INFO ] Redundant transitions in 15 ms returned []
Running 297 sub problems to find dead transitions.
[2025-05-30 12:22:04] [INFO ] Invariant cache hit.
[2025-05-30 12:22:04] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 2/166 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 305/471 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 27/198 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/472 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/473 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/473 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 200 constraints, problems are : Problem set: 0 solved, 297 unsolved in 26399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 167/167 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 2/166 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 305/471 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 27/198 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 209/407 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 1/472 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 88/496 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/473 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 497 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 167/167 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56500ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 56502ms
Starting structural reductions in SI_CTL mode, iteration 1 : 167/432 places, 306/619 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56897 ms. Remains : 167/432 places, 306/619 transitions.
[2025-05-30 12:23:01] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:23:01] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:23:01] [INFO ] Input system was already deterministic with 306 transitions.
[2025-05-30 12:23:01] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:23:01] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2288735268984529188.gal : 2 ms
[2025-05-30 12:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10787958142897287276.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/CTLFireability2288735268984529188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10787958142897287276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65592e+08,0.279455,14288,2,2219,5,46201,6,0,963,38544,0


Converting to forward existential form...Done !
original formula: AF((AG((p187==0)) + (((AG(((p300==0)||(p547==0))) * (p501==1)) * ((p670==1)&&(p821==1))) * ((p133==0)||(p371==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p187==0)))) + (((!(E(TRUE U !(((p300==0)||(p547==0))))) * (p501==1)) * ((p670==1)&&(...203
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t48, t57, t82, t84, t93, t98, t136, t151, t207, t212, t216, t219, t221, Intersection...242
(forward)formula 0,0,29.7032,816268,1,0,545,3.94624e+06,644,325,6906,4.84617e+06,736
FORMULA CO4-PT-15-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 410 transition count 595
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 410 transition count 595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 410 transition count 594
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 403 transition count 585
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 403 transition count 585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 403 transition count 583
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 401 transition count 581
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 401 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 401 transition count 580
Applied a total of 66 rules in 22 ms. Remains 401 /432 variables (removed 31) and now considering 580/619 (removed 39) transitions.
// Phase 1: matrix 580 rows 401 cols
[2025-05-30 12:23:31] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:23:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-30 12:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:23:31] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2025-05-30 12:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:45] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:56] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:56] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 409 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 579/988 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 988 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 401/432 places, 580/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60502 ms. Remains : 401/432 places, 580/619 transitions.
[2025-05-30 12:24:31] [INFO ] Flatten gal took : 15 ms
[2025-05-30 12:24:31] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:24:31] [INFO ] Input system was already deterministic with 580 transitions.
[2025-05-30 12:24:31] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:24:31] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:24:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9941074753062624043.gal : 3 ms
[2025-05-30 12:24:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15264831795865890229.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/CTLFireability9941074753062624043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15264831795865890229.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17418e+11,5.16793,122636,2,15294,5,380801,6,0,2177,548160,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:25:01] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:25:01] [INFO ] Applying decomposition
[2025-05-30 12:25:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2699250056728674694.txt' '-o' '/tmp/graph2699250056728674694.bin' '-w' '/tmp/graph2699250056728674694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2699250056728674694.bin' '-l' '-1' '-v' '-w' '/tmp/graph2699250056728674694.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:25:02] [INFO ] Decomposing Gal with order
[2025-05-30 12:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:25:02] [INFO ] Removed a total of 387 redundant transitions.
[2025-05-30 12:25:02] [INFO ] Flatten gal took : 58 ms
[2025-05-30 12:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 4 ms.
[2025-05-30 12:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3020869807852879844.gal : 17 ms
[2025-05-30 12:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6512293308525986456.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/CTLFireability3020869807852879844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6512293308525986456.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17418e+11,0.522996,17756,1104,65,22762,840,945,72354,79,2890,0


Converting to forward existential form...Done !
original formula: EF(EG(EX((((i12.u116.p628==1)&&(i14.u127.p670==1))&&(i14.u136.p750==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX((((i12.u116.p628==1)&&(i14.u127.p670==1))&&(i14.u136.p750==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t46, t74, t132, t142, t189, t194, t216, t229, t263, t278, t306, t414, t439, t46...855
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,1.6099,64092,1,0,91434,840,5663,414815,345,3410,223210
FORMULA CO4-PT-15-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 410 transition count 594
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 410 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 410 transition count 593
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 403 transition count 584
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 403 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 403 transition count 582
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 401 transition count 580
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 401 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 401 transition count 579
Applied a total of 66 rules in 22 ms. Remains 401 /432 variables (removed 31) and now considering 579/619 (removed 40) transitions.
// Phase 1: matrix 579 rows 401 cols
[2025-05-30 12:25:03] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:04] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-30 12:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:04] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-05-30 12:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:27] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:27] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 409 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 578/987 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 987 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 401/432 places, 579/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 401/432 places, 579/619 transitions.
[2025-05-30 12:26:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:26:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:26:04] [INFO ] Input system was already deterministic with 579 transitions.
[2025-05-30 12:26:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:26:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:26:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8774542129500931888.gal : 4 ms
[2025-05-30 12:26:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5347386761289866388.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/CTLFireability8774542129500931888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5347386761289866388.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21553e+11,3.74182,107828,2,14144,5,344584,6,0,2176,457549,0


Converting to forward existential form...Done !
original formula: AG((AF(EX(TRUE)) * (AX((p228!=1)) + (p777==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EX(TRUE)))] = FALSE * [(EY((FwdU(Init,TRUE) * !((p777==1)))) * !((p228!=1)))] = FALSE)
(forward)formula 0,0,4.38843,107828,1,0,11,344584,11,4,3636,457549,3
FORMULA CO4-PT-15-CTLFireability-2025-04 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 : 432/432 places, 619/619 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 412 transition count 596
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 412 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 412 transition count 595
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 405 transition count 586
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 405 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 405 transition count 584
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 403 transition count 582
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 403 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 403 transition count 581
Applied a total of 62 rules in 21 ms. Remains 403 /432 variables (removed 29) and now considering 581/619 (removed 38) transitions.
// Phase 1: matrix 581 rows 403 cols
[2025-05-30 12:26:08] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:26:09] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-30 12:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:26:09] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-05-30 12:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (OVERLAPS) 581/984 variables, 403/408 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:26:33] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:26:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 410 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:26:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (OVERLAPS) 581/984 variables, 403/411 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 580/991 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 991 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 403/432 places, 581/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 403/432 places, 581/619 transitions.
[2025-05-30 12:27:09] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:27:09] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:27:09] [INFO ] Input system was already deterministic with 581 transitions.
[2025-05-30 12:27:09] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:27:09] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:27:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15741242516703266352.gal : 2 ms
[2025-05-30 12:27:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13949127278745407130.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/CTLFireability15741242516703266352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13949127278745407130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22901e+11,3.93163,114164,2,14652,5,365428,6,0,2186,504934,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:27:39] [INFO ] Flatten gal took : 15 ms
[2025-05-30 12:27:39] [INFO ] Applying decomposition
[2025-05-30 12:27:39] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9157232258209197867.txt' '-o' '/tmp/graph9157232258209197867.bin' '-w' '/tmp/graph9157232258209197867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9157232258209197867.bin' '-l' '-1' '-v' '-w' '/tmp/graph9157232258209197867.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:27:39] [INFO ] Decomposing Gal with order
[2025-05-30 12:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:27:39] [INFO ] Removed a total of 378 redundant transitions.
[2025-05-30 12:27:39] [INFO ] Flatten gal took : 25 ms
[2025-05-30 12:27:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 11 ms.
[2025-05-30 12:27:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5952134086013971107.gal : 20 ms
[2025-05-30 12:27:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4265456281380990185.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/CTLFireability5952134086013971107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4265456281380990185.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22901e+11,0.404401,17836,1137,79,25463,916,1046,59874,75,4174,0


Converting to forward existential form...Done !
original formula: A(!(EG((i16.u132.p707==1))) U AG(!(((i15.i1.i1.u122.p647==1) * !(EX((i7.i0.i0.u61.p379==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(((i15.i1.i1.u122.p647==1) * !(EX((i7.i0.i0.u61.p379==1)))))))))))) * !(E(!(!(E(T...357
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t46, t75, t134, t144, t160, t191, t196, t213, t239, t281, t309, t378, t417, t437, t4...966
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 410 transition count 594
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 410 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 410 transition count 593
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 403 transition count 584
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 403 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 403 transition count 582
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 401 transition count 580
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 401 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 401 transition count 579
Applied a total of 66 rules in 37 ms. Remains 401 /432 variables (removed 31) and now considering 579/619 (removed 40) transitions.
// Phase 1: matrix 579 rows 401 cols
[2025-05-30 12:28:09] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:10] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-05-30 12:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:10] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-05-30 12:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:23] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:33] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:33] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:34] [INFO ] Deduced a trap composed of 152 places in 84 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 410 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/410 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 578/988 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 988 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 401/432 places, 579/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60824 ms. Remains : 401/432 places, 579/619 transitions.
[2025-05-30 12:29:10] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:29:10] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:29:10] [INFO ] Input system was already deterministic with 579 transitions.
[2025-05-30 12:29:10] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:29:10] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:29:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11069084667294325424.gal : 2 ms
[2025-05-30 12:29:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9787639660046719867.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/CTLFireability11069084667294325424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9787639660046719867.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21553e+11,4.8721,119432,2,15303,5,386291,6,0,2176,531143,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:29:40] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:29:40] [INFO ] Applying decomposition
[2025-05-30 12:29:40] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13966289672161807877.txt' '-o' '/tmp/graph13966289672161807877.bin' '-w' '/tmp/graph13966289672161807877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13966289672161807877.bin' '-l' '-1' '-v' '-w' '/tmp/graph13966289672161807877.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:29:40] [INFO ] Decomposing Gal with order
[2025-05-30 12:29:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:29:40] [INFO ] Removed a total of 377 redundant transitions.
[2025-05-30 12:29:40] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:29:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 6 ms.
[2025-05-30 12:29:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8675154226595063199.gal : 4 ms
[2025-05-30 12:29:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14140108745945937165.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/CTLFireability8675154226595063199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14140108745945937165.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21553e+11,0.317557,16708,810,75,21231,854,932,63896,77,2802,0


Converting to forward existential form...Done !
original formula: E(!((AX(A((i16.u136.p752==1) U (i12.u111.p596==1))) * !(((((i11.u108.p586==1)||(((i13.u99.p535==1)&&(i15.u127.p670==1))&&(i15.u131.p750==...251
=> equivalent forward existential formula: [(FwdU(Init,!((!(EX(!(!((E(!((i12.u111.p596==1)) U (!((i16.u136.p752==1)) * !((i12.u111.p596==1)))) + EG(!((i12....380
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t46, t74, t106, t132, t142, t194, t211, t246, t278, t306, t414, t434, t468, t55...834
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 412 transition count 597
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 412 transition count 597
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 412 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 407 transition count 590
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 407 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 407 transition count 588
Applied a total of 53 rules in 27 ms. Remains 407 /432 variables (removed 25) and now considering 588/619 (removed 31) transitions.
// Phase 1: matrix 588 rows 407 cols
[2025-05-30 12:30:11] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:30:11] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-30 12:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:30:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2025-05-30 12:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (OVERLAPS) 588/995 variables, 407/412 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:30:35] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:30:35] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 995/995 variables, and 414 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 588/995 variables, 407/414 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/995 variables, 587/1001 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 995/995 variables, and 1001 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 407/432 places, 588/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60501 ms. Remains : 407/432 places, 588/619 transitions.
[2025-05-30 12:31:11] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:31:11] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:31:11] [INFO ] Input system was already deterministic with 588 transitions.
[2025-05-30 12:31:11] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:31:11] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:31:11] [INFO ] Time to serialize gal into /tmp/CTLFireability18079059900762500209.gal : 2 ms
[2025-05-30 12:31:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17866178024867275434.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/CTLFireability18079059900762500209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17866178024867275434.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46648e+11,4.04799,117484,2,14943,5,371269,6,0,2209,508976,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:31:41] [INFO ] Applying decomposition
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7513924747475245773.txt' '-o' '/tmp/graph7513924747475245773.bin' '-w' '/tmp/graph7513924747475245773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7513924747475245773.bin' '-l' '-1' '-v' '-w' '/tmp/graph7513924747475245773.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:31:41] [INFO ] Decomposing Gal with order
[2025-05-30 12:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:31:41] [INFO ] Removed a total of 384 redundant transitions.
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2025-05-30 12:31:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7079743318448214624.gal : 3 ms
[2025-05-30 12:31:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6150614918409488339.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/CTLFireability7079743318448214624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6150614918409488339.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46648e+11,0.374997,20492,1229,66,31102,736,971,78238,74,2507,0


Converting to forward existential form...Done !
original formula: E(!(A((i3.i1.i1.u25.p204==1) U (((i14.u135.p756==1)||(i16.u142.p797==1)) * EX(AX((i14.u138.p782==1)))))) U (i8.u89.p497==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!((((i14.u135.p756==1)||(i16.u142.p797==1)) * EX(!(EX(!((i14.u138.p782==1))))))) U (!((i3.i1....377
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t55, t83, t96, t141, t151, t167, t208, t220, t287, t315, t444, t478, t532, t562...916
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 410 transition count 594
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 410 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 410 transition count 593
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 404 transition count 586
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 404 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 404 transition count 584
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 402 transition count 582
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 402 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 402 transition count 581
Applied a total of 64 rules in 28 ms. Remains 402 /432 variables (removed 30) and now considering 581/619 (removed 38) transitions.
// Phase 1: matrix 581 rows 402 cols
[2025-05-30 12:32:11] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:32:12] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 12:32:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:32:12] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-05-30 12:32:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (OVERLAPS) 581/983 variables, 402/407 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:32:35] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:32:35] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 983/983 variables, and 409 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/983 variables, 402/409 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/983 variables, 580/989 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)timeout

(s77 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/983 variables, and 989 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 402/432 places, 581/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 402/432 places, 581/619 transitions.
[2025-05-30 12:33:12] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:33:12] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:33:12] [INFO ] Input system was already deterministic with 581 transitions.
[2025-05-30 12:33:12] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:33:12] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:33:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1209638585133717148.gal : 2 ms
[2025-05-30 12:33:12] [INFO ] Time to serialize properties into /tmp/CTLFireability49374301987029138.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/CTLFireability1209638585133717148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability49374301987029138.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18065e+11,4.88192,114392,2,14866,5,367861,6,0,2182,498303,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:33:42] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:33:42] [INFO ] Applying decomposition
[2025-05-30 12:33:42] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16728190714883166413.txt' '-o' '/tmp/graph16728190714883166413.bin' '-w' '/tmp/graph16728190714883166413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16728190714883166413.bin' '-l' '-1' '-v' '-w' '/tmp/graph16728190714883166413.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:33:42] [INFO ] Decomposing Gal with order
[2025-05-30 12:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:33:42] [INFO ] Removed a total of 388 redundant transitions.
[2025-05-30 12:33:42] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2025-05-30 12:33:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12160499615704006627.gal : 4 ms
[2025-05-30 12:33:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3050854092122636606.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/CTLFireability12160499615704006627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3050854092122636606.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18065e+11,1.98531,69524,2521,66,105802,798,1027,486097,75,4109,0


Converting to forward existential form...Done !
original formula: EX(!(E((i14.u87.p500==1) U (i14.u87.p504!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E((i14.u87.p500==1) U (i14.u87.p504!=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t74, t106, t132, t142, t212, t247, t279, t307, t389, t415, t469, t524, t555, i0.t4, ...883
(forward)formula 0,0,5.06025,164756,1,0,213492,798,6606,1.31741e+06,335,4109,483993
FORMULA CO4-PT-15-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 410 transition count 594
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 410 transition count 594
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 403 transition count 585
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 403 transition count 585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 403 transition count 583
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 401 transition count 581
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 401 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 401 transition count 580
Applied a total of 65 rules in 23 ms. Remains 401 /432 variables (removed 31) and now considering 580/619 (removed 39) transitions.
// Phase 1: matrix 580 rows 401 cols
[2025-05-30 12:33:47] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:47] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 12:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:48] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2025-05-30 12:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:34:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:34:12] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:34:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 409 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 579/988 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 988 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 401/432 places, 580/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 401/432 places, 580/619 transitions.
[2025-05-30 12:34:48] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:34:48] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:34:48] [INFO ] Input system was already deterministic with 580 transitions.
[2025-05-30 12:34:48] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:34:48] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:34:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14202178441304464967.gal : 2 ms
[2025-05-30 12:34:48] [INFO ] Time to serialize properties into /tmp/CTLFireability4667481247296478410.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/CTLFireability14202178441304464967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4667481247296478410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17709e+11,4.70052,121492,2,15587,5,388985,6,0,2176,546673,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:35:18] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:35:18] [INFO ] Applying decomposition
[2025-05-30 12:35:18] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6311249920125652983.txt' '-o' '/tmp/graph6311249920125652983.bin' '-w' '/tmp/graph6311249920125652983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6311249920125652983.bin' '-l' '-1' '-v' '-w' '/tmp/graph6311249920125652983.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:35:18] [INFO ] Decomposing Gal with order
[2025-05-30 12:35:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:35:18] [INFO ] Removed a total of 388 redundant transitions.
[2025-05-30 12:35:18] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:35:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2025-05-30 12:35:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10208232664982850377.gal : 3 ms
[2025-05-30 12:35:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17273450191051057024.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/CTLFireability10208232664982850377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17273450191051057024.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17709e+11,0.480225,23384,991,66,37251,1020,1023,96356,79,5174,0


Converting to forward existential form...Done !
original formula: EF(AG((AX(AF((i1.i0.i2.u22.p177==1))) * AG(((EG((i7.u83.p472==1)) + (i16.u146.p788==1)) + (i1.i1.i0.u24.p190==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!(!(EG(!((i1.i0.i2.u22.p177==1))))))) * !(E(TRUE U !(((EG((i7.u83.p472==1...223
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t46, t74, t97, t132, t142, t181, t211, t229, t263, t278, t306, t436, t470, i0.t433, ...924
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,28.6408,800356,1,0,706130,1339,6984,7.99634e+06,397,6543,585184
FORMULA CO4-PT-15-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 432/432 places, 619/619 transitions.
Graph (trivial) has 462 edges and 432 vertex of which 2 / 432 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 902 edges and 431 vertex of which 427 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 426 transition count 451
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 164 rules applied. Total rules applied 327 place count 268 transition count 445
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 330 place count 267 transition count 443
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 333 place count 266 transition count 441
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 337 place count 265 transition count 438
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 340 place count 262 transition count 438
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 42 Pre rules applied. Total rules applied 340 place count 262 transition count 396
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 424 place count 220 transition count 396
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 434 place count 210 transition count 383
Iterating global reduction 6 with 10 rules applied. Total rules applied 444 place count 210 transition count 383
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 6 with 3 rules applied. Total rules applied 447 place count 210 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 448 place count 209 transition count 380
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 448 place count 209 transition count 377
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 454 place count 206 transition count 377
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 458 place count 202 transition count 370
Iterating global reduction 8 with 4 rules applied. Total rules applied 462 place count 202 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 463 place count 202 transition count 369
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 511 place count 178 transition count 344
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 9 with 7 rules applied. Total rules applied 518 place count 178 transition count 337
Reduce places removed 2 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 10 with 5 rules applied. Total rules applied 523 place count 176 transition count 334
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 525 place count 175 transition count 333
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 528 place count 172 transition count 327
Iterating global reduction 12 with 3 rules applied. Total rules applied 531 place count 172 transition count 327
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 532 place count 171 transition count 325
Iterating global reduction 12 with 1 rules applied. Total rules applied 533 place count 171 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 534 place count 171 transition count 324
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 540 place count 168 transition count 321
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 13 with 3 rules applied. Total rules applied 543 place count 168 transition count 318
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 14 with 3 rules applied. Total rules applied 546 place count 167 transition count 316
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 548 place count 166 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 550 place count 165 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 563 place count 165 transition count 301
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 16 with 7 rules applied. Total rules applied 570 place count 165 transition count 294
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 577 place count 158 transition count 294
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 18 with 2 rules applied. Total rules applied 579 place count 157 transition count 293
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 581 place count 155 transition count 291
Applied a total of 581 rules in 90 ms. Remains 155 /432 variables (removed 277) and now considering 291/619 (removed 328) transitions.
[2025-05-30 12:35:47] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 155 cols
[2025-05-30 12:35:47] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-30 12:35:47] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2025-05-30 12:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:35:47] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:35:47] [INFO ] Redundant transitions in 4 ms returned []
Running 274 sub problems to find dead transitions.
[2025-05-30 12:35:47] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2025-05-30 12:35:47] [INFO ] Invariant cache hit.
[2025-05-30 12:35:47] [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/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 264/418 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 1/420 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 161 constraints, problems are : Problem set: 0 solved, 274 unsolved in 19777 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 264/418 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 194/353 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/419 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 80/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/420 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 435 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49824ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 49825ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/432 places, 291/619 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50110 ms. Remains : 155/432 places, 291/619 transitions.
[2025-05-30 12:36:37] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:36:37] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:36:37] [INFO ] Input system was already deterministic with 291 transitions.
[2025-05-30 12:36:37] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:36:37] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3850880330290437259.gal : 1 ms
[2025-05-30 12:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14075887623303257232.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/CTLFireability3850880330290437259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14075887623303257232.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,5.39827e+07,0.144315,9600,2,1805,5,25385,6,0,901,20800,0


Converting to forward existential form...Done !
original formula: EG(((p239==0)||(p371==0)))
=> equivalent forward existential formula: [FwdG(Init,((p239==0)||(p371==0)))] != FALSE
Hit Full ! (commute/partial/dont) 264/0/27
(forward)formula 0,1,0.932588,38740,1,0,8,201944,19,4,4464,78776,8
FORMULA CO4-PT-15-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 12:36:38] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:36:38] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:36:38] [INFO ] Applying decomposition
[2025-05-30 12:36:38] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7366072021372539471.txt' '-o' '/tmp/graph7366072021372539471.bin' '-w' '/tmp/graph7366072021372539471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7366072021372539471.bin' '-l' '-1' '-v' '-w' '/tmp/graph7366072021372539471.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:36:38] [INFO ] Decomposing Gal with order
[2025-05-30 12:36:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:36:38] [INFO ] Removed a total of 426 redundant transitions.
[2025-05-30 12:36:38] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2025-05-30 12:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9974362810312818714.gal : 5 ms
[2025-05-30 12:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9000477290310965812.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/CTLFireability9974362810312818714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9000477290310965812.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.39171e+11,0.371429,17524,995,64,24275,1067,1140,51335,91,3655,0


Converting to forward existential form...Done !
original formula: AF(EX((E(AX(((i1.i2.u36.p239==1)&&(i6.i1.u61.p371==1))) U (i1.i2.u37.p238==1)) * ((AF(AX((i1.i0.u34.p140==1))) + (i6.i1.u61.p344==0)) + (...177
=> equivalent forward existential formula: [FwdG(Init,!(EX((E(!(EX(!(((i1.i2.u36.p239==1)&&(i6.i1.u61.p371==1))))) U (i1.i2.u37.p238==1)) * ((!(EG(!(!(EX(!...240
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t12, t16, t55, t84, t177, t192, t226, t269, t276, t297, t326, t460, t472, t497, t591,...1305
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,161.671,2203104,1,0,3.05191e+06,1311,2378,1.04053e+07,164,7179,422544
FORMULA CO4-PT-15-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(!(EG((i17.i0.u145.p707==1))) U AG(!(((i15.i0.u136.p647==1) * !(EX((i12.i0.u63.p379==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(((i15.i0.u136.p647==1) * !(EX((i12.i0.u63.p379==1)))))))))))) * !(E(!(!(E(TRUE U...345
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 1,0,191.79,2203104,1,0,3.05191e+06,1367,4258,1.04053e+07,242,7179,1256117
FORMULA CO4-PT-15-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!((AX(A((i16.i0.u156.p752==1) U (i9.i1.u121.p596==1))) * !(((((i9.i2.u118.p586==1)||(((i11.i0.u107.p535==1)&&(i17.i0.u141.p670==1))&&(i...274
=> equivalent forward existential formula: [(FwdU(Init,!((!(EX(!(!((E(!((i9.i1.u121.p596==1)) U (!((i16.i0.u156.p752==1)) * !((i9.i1.u121.p596==1)))) + EG(...407
(forward)formula 2,1,293.071,2423520,1,0,3.42262e+06,1452,2896,1.16033e+07,176,7820,969893
FORMULA CO4-PT-15-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(A((i3.i2.u27.p204==1) U (((i16.i0.u152.p756==1)||(i16.i1.u158.p797==1)) * EX(AX((i16.i0.u156.p782==1)))))) U (i8.i1.u91.p497==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!((((i16.i0.u152.p756==1)||(i16.i1.u158.p797==1)) * EX(!(EX(!((i16.i0.u156.p782==1))))))) U (...404
(forward)formula 3,1,358.558,2423520,1,0,3.42262e+06,2004,5305,1.16033e+07,307,9849,1796112
FORMULA CO4-PT-15-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1365343 ms.

BK_STOP 1748608957830

--------------------
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-15"
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-15, 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-174854028500490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-15.tgz
mv CO4-PT-15 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 ;