Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 253K Jun 5 20:08 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 MedleyB-PT-B02-CTLFireability-2025-00
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-01
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-02
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-03
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-04
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-05
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-06
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-07
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-08
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-09
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-10
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-11
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-12
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-13
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-14
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749386227034

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-08 12:37:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 12:37:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:37:08] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-08 12:37:08] [INFO ] Transformed 1227 places.
[2025-06-08 12:37:08] [INFO ] Transformed 1472 transitions.
[2025-06-08 12:37:08] [INFO ] Found NUPN structural information;
[2025-06-08 12:37:08] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 124 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 1136 transition count 1381
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 1136 transition count 1381
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 229 place count 1089 transition count 1334
Iterating global reduction 0 with 47 rules applied. Total rules applied 276 place count 1089 transition count 1334
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 301 place count 1064 transition count 1309
Iterating global reduction 0 with 25 rules applied. Total rules applied 326 place count 1064 transition count 1309
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 346 place count 1044 transition count 1289
Iterating global reduction 0 with 20 rules applied. Total rules applied 366 place count 1044 transition count 1289
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 380 place count 1030 transition count 1275
Iterating global reduction 0 with 14 rules applied. Total rules applied 394 place count 1030 transition count 1275
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 407 place count 1017 transition count 1262
Iterating global reduction 0 with 13 rules applied. Total rules applied 420 place count 1017 transition count 1262
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 431 place count 1006 transition count 1251
Iterating global reduction 0 with 11 rules applied. Total rules applied 442 place count 1006 transition count 1251
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 449 place count 999 transition count 1244
Iterating global reduction 0 with 7 rules applied. Total rules applied 456 place count 999 transition count 1244
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 463 place count 992 transition count 1237
Iterating global reduction 0 with 7 rules applied. Total rules applied 470 place count 992 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 475 place count 987 transition count 1232
Iterating global reduction 0 with 5 rules applied. Total rules applied 480 place count 987 transition count 1232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 481 place count 987 transition count 1231
Applied a total of 481 rules in 723 ms. Remains 987 /1227 variables (removed 240) and now considering 1231/1472 (removed 241) transitions.
// Phase 1: matrix 1231 rows 987 cols
[2025-06-08 12:37:09] [INFO ] Computed 5 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:10] [INFO ] Implicit Places using invariants in 656 ms returned []
[2025-06-08 12:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:10] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2025-06-08 12:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/2218 variables, and 0 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/2218 variables, and 0 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 60581ms
Starting structural reductions in LTL mode, iteration 1 : 987/1227 places, 1231/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62966 ms. Remains : 987/1227 places, 1231/1472 transitions.
Support contains 124 out of 987 places after structural reductions.
[2025-06-08 12:38:11] [INFO ] Flatten gal took : 97 ms
[2025-06-08 12:38:11] [INFO ] Flatten gal took : 56 ms
[2025-06-08 12:38:12] [INFO ] Input system was already deterministic with 1231 transitions.
Support contains 122 out of 987 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (511 resets) in 2018 ms. (19 steps per ms) remains 52/77 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (9 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (9 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (12 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (9 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
[2025-06-08 12:38:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 893/987 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:14] [INFO ] Deduced a trap composed of 331 places in 309 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:14] [INFO ] Deduced a trap composed of 326 places in 604 ms of which 192 ms to minimize.
Problem AtomicPropp8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:15] [INFO ] Deduced a trap composed of 332 places in 442 ms of which 201 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:15] [INFO ] Deduced a trap composed of 339 places in 380 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:16] [INFO ] Deduced a trap composed of 327 places in 415 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:16] [INFO ] Deduced a trap composed of 331 places in 446 ms of which 210 ms to minimize.
Problem AtomicPropp14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:18] [INFO ] Deduced a trap composed of 354 places in 530 ms of which 244 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/2218 variables, and 12 constraints, problems are : Problem set: 5 solved, 46 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 46 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 46 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 903/987 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 45 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/987 variables, 7/12 constraints. Problems are: Problem set: 7 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:19] [INFO ] Deduced a trap composed of 339 places in 319 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:19] [INFO ] Deduced a trap composed of 340 places in 249 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:20] [INFO ] Deduced a trap composed of 337 places in 348 ms of which 134 ms to minimize.
Problem AtomicPropp19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:21] [INFO ] Deduced a trap composed of 339 places in 566 ms of which 261 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:21] [INFO ] Deduced a trap composed of 340 places in 445 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:22] [INFO ] Deduced a trap composed of 342 places in 378 ms of which 155 ms to minimize.
Problem AtomicPropp43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:23] [INFO ] Deduced a trap composed of 354 places in 494 ms of which 247 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/2218 variables, and 19 constraints, problems are : Problem set: 9 solved, 42 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 0/51 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10044ms problems are : Problem set: 9 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Graph (trivial) has 822 edges and 987 vertex of which 37 / 987 are part of one of the 8 SCC in 8 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (complete) has 1451 edges and 958 vertex of which 954 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 588 rules applied. Total rules applied 590 place count 954 transition count 602
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 597 rules applied. Total rules applied 1187 place count 369 transition count 590
Reduce places removed 6 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 50 rules applied. Total rules applied 1237 place count 363 transition count 546
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 48 rules applied. Total rules applied 1285 place count 319 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1286 place count 318 transition count 542
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 55 Pre rules applied. Total rules applied 1286 place count 318 transition count 487
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 1396 place count 263 transition count 487
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1401 place count 258 transition count 482
Iterating global reduction 5 with 5 rules applied. Total rules applied 1406 place count 258 transition count 482
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1470 place count 226 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1472 place count 226 transition count 448
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1481 place count 217 transition count 406
Iterating global reduction 6 with 9 rules applied. Total rules applied 1490 place count 217 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1492 place count 217 transition count 404
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1497 place count 212 transition count 399
Iterating global reduction 7 with 5 rules applied. Total rules applied 1502 place count 212 transition count 399
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1506 place count 208 transition count 395
Iterating global reduction 7 with 4 rules applied. Total rules applied 1510 place count 208 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1511 place count 208 transition count 394
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1521 place count 203 transition count 389
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1527 place count 200 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1529 place count 200 transition count 398
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 1546 place count 200 transition count 381
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1563 place count 183 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1564 place count 183 transition count 380
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1567 place count 183 transition count 380
Applied a total of 1567 rules in 212 ms. Remains 183 /987 variables (removed 804) and now considering 380/1231 (removed 851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 183/987 places, 380/1231 transitions.
RANDOM walk for 40000 steps (2876 resets) in 455 ms. (87 steps per ms) remains 35/42 properties
BEST_FIRST walk for 4002 steps (50 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (54 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (52 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (46 resets) in 14 ms. (266 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4002 steps (43 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (52 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (49 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (46 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (50 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (53 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (57 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (49 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (49 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (44 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (46 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (49 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (48 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (48 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (46 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
// Phase 1: matrix 380 rows 183 cols
[2025-06-08 12:38:23] [INFO ] Computed 4 invariants in 5 ms
[2025-06-08 12:38:23] [INFO ] State equation strengthened by 48 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 98/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 370/527 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 13/174 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 33/560 variables, 23/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 35/232 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 3/563 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:24] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:24] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/563 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 240 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2755 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 183/183 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 98/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 370/527 variables, 157/164 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 13/177 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 33/560 variables, 23/218 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 35/253 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 16/269 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 3/563 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:28] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:29] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:29] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:30] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 17 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/563 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/563 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 0/563 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 278 constraints, problems are : Problem set: 0 solved, 34 unsolved in 7366 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 183/183 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10158ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 9 properties in 1363 ms.
Support contains 36 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 380/380 transitions.
Graph (trivial) has 84 edges and 183 vertex of which 4 / 183 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 181 transition count 354
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 159 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 158 transition count 353
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 47 place count 158 transition count 346
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 61 place count 151 transition count 346
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 70 place count 142 transition count 248
Iterating global reduction 3 with 9 rules applied. Total rules applied 79 place count 142 transition count 248
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 85 place count 142 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 141 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 141 transition count 241
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 140 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 140 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 95 place count 140 transition count 234
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 107 place count 134 transition count 226
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 110 place count 134 transition count 223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 111 place count 133 transition count 222
Iterating global reduction 6 with 1 rules applied. Total rules applied 112 place count 133 transition count 222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 132 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 132 transition count 221
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 115 place count 131 transition count 220
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 131 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 117 place count 131 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 119 place count 130 transition count 229
Free-agglomeration rule applied 27 times with reduction of 8 identical transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 146 place count 130 transition count 194
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 176 place count 103 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 188 place count 103 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 189 place count 103 transition count 179
Applied a total of 189 rules in 56 ms. Remains 103 /183 variables (removed 80) and now considering 179/380 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 103/183 places, 179/380 transitions.
RANDOM walk for 40000 steps (1339 resets) in 1067 ms. (37 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40002 steps (332 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
// Phase 1: matrix 179 rows 103 cols
[2025-06-08 12:38:35] [INFO ] Computed 4 invariants in 1 ms
[2025-06-08 12:38:35] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:35] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/238 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/268 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 17/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/277 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/281 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/238 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/268 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 17/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:35] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/277 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/281 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/282 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/282 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 179/179 transitions.
Graph (trivial) has 65 edges and 103 vertex of which 2 / 103 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 102 transition count 141
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 67 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 66 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 75 place count 66 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 64 transition count 136
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 88 place count 55 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 97 place count 55 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 55 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 52 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 52 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 50 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 50 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 49 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 49 transition count 119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 119 place count 45 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 123 place count 45 transition count 111
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 129 place count 39 transition count 105
Iterating global reduction 6 with 6 rules applied. Total rules applied 135 place count 39 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 141 place count 39 transition count 99
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 145 place count 35 transition count 95
Iterating global reduction 7 with 4 rules applied. Total rules applied 149 place count 35 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 151 place count 35 transition count 93
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 152 place count 34 transition count 92
Iterating global reduction 8 with 1 rules applied. Total rules applied 153 place count 34 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 162 place count 34 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 169 place count 34 transition count 76
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 172 place count 34 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 175 place count 31 transition count 73
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 179 place count 27 transition count 69
Iterating global reduction 10 with 4 rules applied. Total rules applied 183 place count 27 transition count 69
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 185 place count 27 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 186 place count 27 transition count 68
Applied a total of 186 rules in 28 ms. Remains 27 /103 variables (removed 76) and now considering 68/179 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 27/103 places, 68/179 transitions.
RANDOM walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Probably explored full state space saw : 600 states, properties seen :0
Probabilistic random walk after 2948 steps, saw 600 distinct states, run finished after 17 ms. (steps per millisecond=173 ) properties seen :0
Explored full state space saw : 600 states, properties seen :0
Exhaustive walk after 2948 steps, saw 600 distinct states, run finished after 5 ms. (steps per millisecond=589 ) properties seen :0
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA MedleyB-PT-B02-CTLFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-08 12:38:36] [INFO ] Flatten gal took : 42 ms
[2025-06-08 12:38:36] [INFO ] Flatten gal took : 39 ms
[2025-06-08 12:38:36] [INFO ] Input system was already deterministic with 1231 transitions.
Support contains 86 out of 987 places (down from 87) after GAL structural reductions.
Computed a total of 175 stabilizing places and 183 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 959 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 959 transition count 1203
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 936 transition count 1180
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 936 transition count 1180
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 123 place count 915 transition count 1159
Iterating global reduction 0 with 21 rules applied. Total rules applied 144 place count 915 transition count 1159
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 895 transition count 1139
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 895 transition count 1139
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 202 place count 877 transition count 1121
Iterating global reduction 0 with 18 rules applied. Total rules applied 220 place count 877 transition count 1121
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 236 place count 861 transition count 1105
Iterating global reduction 0 with 16 rules applied. Total rules applied 252 place count 861 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 253 place count 861 transition count 1104
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 265 place count 849 transition count 1092
Iterating global reduction 1 with 12 rules applied. Total rules applied 277 place count 849 transition count 1092
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 288 place count 838 transition count 1081
Iterating global reduction 1 with 11 rules applied. Total rules applied 299 place count 838 transition count 1081
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 307 place count 830 transition count 1073
Iterating global reduction 1 with 8 rules applied. Total rules applied 315 place count 830 transition count 1073
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 322 place count 823 transition count 1066
Iterating global reduction 1 with 7 rules applied. Total rules applied 329 place count 823 transition count 1066
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 331 place count 823 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 335 place count 819 transition count 1060
Iterating global reduction 2 with 4 rules applied. Total rules applied 339 place count 819 transition count 1060
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 343 place count 815 transition count 1056
Iterating global reduction 2 with 4 rules applied. Total rules applied 347 place count 815 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 351 place count 811 transition count 1052
Iterating global reduction 2 with 4 rules applied. Total rules applied 355 place count 811 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 359 place count 807 transition count 1048
Iterating global reduction 2 with 4 rules applied. Total rules applied 363 place count 807 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 367 place count 803 transition count 1044
Iterating global reduction 2 with 4 rules applied. Total rules applied 371 place count 803 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 372 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 375 place count 800 transition count 1040
Iterating global reduction 3 with 3 rules applied. Total rules applied 378 place count 800 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 380 place count 798 transition count 1038
Iterating global reduction 3 with 2 rules applied. Total rules applied 382 place count 798 transition count 1038
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 798 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 384 place count 797 transition count 1036
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 797 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 386 place count 796 transition count 1035
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 796 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 388 place count 795 transition count 1034
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 390 place count 794 transition count 1033
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 794 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 392 place count 793 transition count 1032
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 394 place count 793 transition count 1031
Applied a total of 394 rules in 500 ms. Remains 793 /987 variables (removed 194) and now considering 1031/1231 (removed 200) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2025-06-08 12:38:36] [INFO ] Computed 5 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:37] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-08 12:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:37] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Running 1030 sub problems to find dead transitions.
[2025-06-08 12:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/792 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
SMT process timed out in 30307ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Starting structural reductions in LTL mode, iteration 1 : 793/987 places, 1031/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31977 ms. Remains : 793/987 places, 1031/1231 transitions.
[2025-06-08 12:39:08] [INFO ] Flatten gal took : 30 ms
[2025-06-08 12:39:08] [INFO ] Flatten gal took : 29 ms
[2025-06-08 12:39:08] [INFO ] Input system was already deterministic with 1031 transitions.
[2025-06-08 12:39:08] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:39:08] [INFO ] Flatten gal took : 25 ms
[2025-06-08 12:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6459250703465158359.gal : 19 ms
[2025-06-08 12:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16129260722096262531.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/CTLFireability6459250703465158359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16129260722096262531.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,9.60995e+09,18.0802,469908,2,25692,5,1.41653e+06,6,0,4205,2.04887e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:39:38] [INFO ] Flatten gal took : 27 ms
[2025-06-08 12:39:38] [INFO ] Applying decomposition
[2025-06-08 12:39:38] [INFO ] Flatten gal took : 29 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/graph3049868446675207424.txt' '-o' '/tmp/graph3049868446675207424.bin' '-w' '/tmp/graph3049868446675207424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3049868446675207424.bin' '-l' '-1' '-v' '-w' '/tmp/graph3049868446675207424.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:39:38] [INFO ] Decomposing Gal with order
[2025-06-08 12:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:39:39] [INFO ] Removed a total of 857 redundant transitions.
[2025-06-08 12:39:39] [INFO ] Flatten gal took : 184 ms
[2025-06-08 12:39:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 25 ms.
[2025-06-08 12:39:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5707671638644984939.gal : 24 ms
[2025-06-08 12:39:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13964514958372076595.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/CTLFireability5707671638644984939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13964514958372076595.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,9.60995e+09,8.63314,300728,2290,13,526546,1032,1263,1.60667e+06,49,3093,0


Converting to forward existential form...Done !
original formula: (!(A(EX(AX((i28.u245.p921!=1))) U ((i1.u211.p742==1) + !(EF((i3.u54.p149==1)))))) + EX(AG(A((i17.u162.p601==1) U EF((i24.u225.p838==1))))...157
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,!(((i1.u211.p742==1) + !(E(TRUE U (i3.u54.p149==1)))))) * !(EX(!(EX(!((i28.u245.p921!=1))))...479
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t248, t334, t390, t424, t506, t595, t680, t736, t756, t757, t760, t763, t766, t767...594
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 961 transition count 1205
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 961 transition count 1205
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 940 transition count 1184
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 940 transition count 1184
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 114 place count 920 transition count 1164
Iterating global reduction 0 with 20 rules applied. Total rules applied 134 place count 920 transition count 1164
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 153 place count 901 transition count 1145
Iterating global reduction 0 with 19 rules applied. Total rules applied 172 place count 901 transition count 1145
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 189 place count 884 transition count 1128
Iterating global reduction 0 with 17 rules applied. Total rules applied 206 place count 884 transition count 1128
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 220 place count 870 transition count 1114
Iterating global reduction 0 with 14 rules applied. Total rules applied 234 place count 870 transition count 1114
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 245 place count 859 transition count 1103
Iterating global reduction 0 with 11 rules applied. Total rules applied 256 place count 859 transition count 1103
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 266 place count 849 transition count 1093
Iterating global reduction 0 with 10 rules applied. Total rules applied 276 place count 849 transition count 1093
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 284 place count 841 transition count 1085
Iterating global reduction 0 with 8 rules applied. Total rules applied 292 place count 841 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 299 place count 834 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 306 place count 834 transition count 1078
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 308 place count 834 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 312 place count 830 transition count 1072
Iterating global reduction 1 with 4 rules applied. Total rules applied 316 place count 830 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 320 place count 826 transition count 1068
Iterating global reduction 1 with 4 rules applied. Total rules applied 324 place count 826 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 328 place count 822 transition count 1064
Iterating global reduction 1 with 4 rules applied. Total rules applied 332 place count 822 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 336 place count 818 transition count 1060
Iterating global reduction 1 with 4 rules applied. Total rules applied 340 place count 818 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 343 place count 815 transition count 1057
Iterating global reduction 1 with 3 rules applied. Total rules applied 346 place count 815 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 349 place count 812 transition count 1054
Iterating global reduction 1 with 3 rules applied. Total rules applied 352 place count 812 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 355 place count 809 transition count 1051
Iterating global reduction 1 with 3 rules applied. Total rules applied 358 place count 809 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 359 place count 809 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 361 place count 807 transition count 1048
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 807 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 365 place count 805 transition count 1046
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 805 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 804 transition count 1044
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 804 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 803 transition count 1043
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 803 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 373 place count 802 transition count 1042
Iterating global reduction 3 with 1 rules applied. Total rules applied 374 place count 802 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 802 transition count 1041
Applied a total of 375 rules in 568 ms. Remains 802 /987 variables (removed 185) and now considering 1041/1231 (removed 190) transitions.
// Phase 1: matrix 1041 rows 802 cols
[2025-06-08 12:40:10] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:10] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-06-08 12:40:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:11] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Running 1040 sub problems to find dead transitions.
[2025-06-08 12:40: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/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
SMT process timed out in 30221ms, After SMT, problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 802/987 places, 1041/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32090 ms. Remains : 802/987 places, 1041/1231 transitions.
[2025-06-08 12:40:41] [INFO ] Flatten gal took : 25 ms
[2025-06-08 12:40:41] [INFO ] Flatten gal took : 25 ms
[2025-06-08 12:40:41] [INFO ] Input system was already deterministic with 1041 transitions.
[2025-06-08 12:40:41] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:40:41] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:40:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4417809938855857114.gal : 6 ms
[2025-06-08 12:40:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2665762910939319527.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/CTLFireability4417809938855857114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2665762910939319527.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.82515e+09,16.9556,438528,2,26112,5,1.33755e+06,6,0,4251,1.90092e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:41:11] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:41:11] [INFO ] Applying decomposition
[2025-06-08 12:41:11] [INFO ] Flatten gal took : 22 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/graph6032728095591586789.txt' '-o' '/tmp/graph6032728095591586789.bin' '-w' '/tmp/graph6032728095591586789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6032728095591586789.bin' '-l' '-1' '-v' '-w' '/tmp/graph6032728095591586789.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:41:11] [INFO ] Decomposing Gal with order
[2025-06-08 12:41:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:41:11] [INFO ] Removed a total of 860 redundant transitions.
[2025-06-08 12:41:11] [INFO ] Flatten gal took : 47 ms
[2025-06-08 12:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2025-06-08 12:41:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14179037344489920019.gal : 9 ms
[2025-06-08 12:41:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8147633031056342545.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/CTLFireability14179037344489920019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8147633031056342545.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,9.82515e+09,8.89112,311840,2463,15,503769,871,1316,1.83482e+06,49,2782,0


Converting to forward existential form...Done !
original formula: E(!(EG(AF((AF((i21.u185.p657==1)) + AX((i20.i0.i1.u177.p638==1)))))) U (EF(AX((i34.i1.i1.u317.p1148==1))) * ((i6.u66.p206!=1)||((i2.u17.p...262
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!(EG(!(EG(!((!(EG(!((i21.u185.p657==1)))) + !(EX(!((i20.i0.i1.u177.p638==1))))))))))) * ((i6.u...339
Reverse transition relation is NOT exact ! Due to transitions t76, t110, t167, t168, t222, t224, t258, t399, t433, t515, t604, t688, t741, t744, t764, t765...633
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Graph (trivial) has 949 edges and 987 vertex of which 66 / 987 are part of one of the 12 SCC in 2 ms
Free SCC test removed 54 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 681 transitions
Trivial Post-agglo rules discarded 681 transitions
Performed 681 trivial Post agglomeration. Transition count delta: 681
Iterating post reduction 0 with 681 rules applied. Total rules applied 682 place count 932 transition count 487
Reduce places removed 681 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 692 rules applied. Total rules applied 1374 place count 251 transition count 476
Reduce places removed 4 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 18 rules applied. Total rules applied 1392 place count 247 transition count 462
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1406 place count 233 transition count 462
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1406 place count 233 transition count 407
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1516 place count 178 transition count 407
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1537 place count 157 transition count 386
Iterating global reduction 4 with 21 rules applied. Total rules applied 1558 place count 157 transition count 386
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1571 place count 144 transition count 347
Iterating global reduction 4 with 13 rules applied. Total rules applied 1584 place count 144 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1586 place count 144 transition count 345
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1590 place count 140 transition count 341
Iterating global reduction 5 with 4 rules applied. Total rules applied 1594 place count 140 transition count 341
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1598 place count 136 transition count 337
Iterating global reduction 5 with 4 rules applied. Total rules applied 1602 place count 136 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1604 place count 136 transition count 335
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1644 place count 116 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1647 place count 116 transition count 312
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1665 place count 98 transition count 195
Iterating global reduction 7 with 18 rules applied. Total rules applied 1683 place count 98 transition count 195
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1693 place count 98 transition count 185
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1704 place count 87 transition count 171
Iterating global reduction 8 with 11 rules applied. Total rules applied 1715 place count 87 transition count 171
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1726 place count 76 transition count 157
Iterating global reduction 8 with 11 rules applied. Total rules applied 1737 place count 76 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1742 place count 76 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1744 place count 75 transition count 151
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1745 place count 74 transition count 146
Iterating global reduction 9 with 1 rules applied. Total rules applied 1746 place count 74 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1747 place count 74 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1751 place count 74 transition count 141
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1759 place count 70 transition count 137
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1762 place count 70 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1763 place count 69 transition count 136
Applied a total of 1763 rules in 72 ms. Remains 69 /987 variables (removed 918) and now considering 136/1231 (removed 1095) transitions.
[2025-06-08 12:41:42] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 69 cols
[2025-06-08 12:41:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:41:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 12:41:42] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:41:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-08 12:41:42] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:41:42] [INFO ] Redundant transitions in 4 ms returned []
Running 127 sub problems to find dead transitions.
[2025-06-08 12:41:42] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:41:42] [INFO ] Invariant cache hit.
[2025-06-08 12:41:42] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:42] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:42] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:43] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 130/199 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:45] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:45] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:45] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:45] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 1/200 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:48] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 101 constraints, problems are : Problem set: 0 solved, 127 unsolved in 8877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 130/199 variables, 69/88 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 127/227 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:52] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 1/200 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:00] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:02] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 232 constraints, problems are : Problem set: 0 solved, 127 unsolved in 18240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27143ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 27143ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/987 places, 136/1231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27347 ms. Remains : 69/987 places, 136/1231 transitions.
[2025-06-08 12:42:09] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:42:09] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:42:09] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-08 12:42:09] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:42:09] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:42:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13296318660308755888.gal : 1 ms
[2025-06-08 12:42:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16130645188252077738.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/CTLFireability13296318660308755888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16130645188252077738.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,82160,0.188547,12168,2,3319,5,30347,6,0,403,27597,0


Converting to forward existential form...Done !
original formula: EF(EG(((AG((p170==0)) * (p308==0)) * ((((p251==0)||(p552==0))||((p855==0)||(p1156==0)))||(p1107==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(E(TRUE U !((p170==0)))) * (p308==0)) * ((((p251==0)||(p552==0))||((p855==0)||(p1156==0...183
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t10, t11, t12, t16, t17, t18, t25, t29, t61, t62, t64, t65, t66, t80, t81, t82, t...354
(forward)formula 0,1,3.5962,126084,1,0,308,621804,296,135,3653,457032,326
FORMULA MedleyB-PT-B02-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 958 transition count 1202
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 958 transition count 1202
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 934 transition count 1178
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 934 transition count 1178
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 128 place count 912 transition count 1156
Iterating global reduction 0 with 22 rules applied. Total rules applied 150 place count 912 transition count 1156
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 171 place count 891 transition count 1135
Iterating global reduction 0 with 21 rules applied. Total rules applied 192 place count 891 transition count 1135
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 210 place count 873 transition count 1117
Iterating global reduction 0 with 18 rules applied. Total rules applied 228 place count 873 transition count 1117
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 244 place count 857 transition count 1101
Iterating global reduction 0 with 16 rules applied. Total rules applied 260 place count 857 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 261 place count 857 transition count 1100
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 273 place count 845 transition count 1088
Iterating global reduction 1 with 12 rules applied. Total rules applied 285 place count 845 transition count 1088
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 295 place count 835 transition count 1078
Iterating global reduction 1 with 10 rules applied. Total rules applied 305 place count 835 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 312 place count 828 transition count 1071
Iterating global reduction 1 with 7 rules applied. Total rules applied 319 place count 828 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 325 place count 822 transition count 1065
Iterating global reduction 1 with 6 rules applied. Total rules applied 331 place count 822 transition count 1065
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 333 place count 822 transition count 1063
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 336 place count 819 transition count 1060
Iterating global reduction 2 with 3 rules applied. Total rules applied 339 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 342 place count 816 transition count 1057
Iterating global reduction 2 with 3 rules applied. Total rules applied 345 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 348 place count 813 transition count 1054
Iterating global reduction 2 with 3 rules applied. Total rules applied 351 place count 813 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 354 place count 810 transition count 1051
Iterating global reduction 2 with 3 rules applied. Total rules applied 357 place count 810 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 360 place count 807 transition count 1048
Iterating global reduction 2 with 3 rules applied. Total rules applied 363 place count 807 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 366 place count 804 transition count 1045
Iterating global reduction 2 with 3 rules applied. Total rules applied 369 place count 804 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 372 place count 801 transition count 1042
Iterating global reduction 2 with 3 rules applied. Total rules applied 375 place count 801 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 801 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 378 place count 799 transition count 1039
Iterating global reduction 3 with 2 rules applied. Total rules applied 380 place count 799 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 382 place count 797 transition count 1037
Iterating global reduction 3 with 2 rules applied. Total rules applied 384 place count 797 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 797 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 386 place count 796 transition count 1035
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 796 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 388 place count 795 transition count 1034
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 390 place count 794 transition count 1033
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 794 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 392 place count 794 transition count 1032
Applied a total of 392 rules in 559 ms. Remains 794 /987 variables (removed 193) and now considering 1032/1231 (removed 199) transitions.
// Phase 1: matrix 1032 rows 794 cols
[2025-06-08 12:42:13] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:42:14] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-06-08 12:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:42:14] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 1031 sub problems to find dead transitions.
[2025-06-08 12:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/793 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
SMT process timed out in 30264ms, After SMT, problems are : Problem set: 0 solved, 1031 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Starting structural reductions in LTL mode, iteration 1 : 794/987 places, 1032/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31984 ms. Remains : 794/987 places, 1032/1231 transitions.
[2025-06-08 12:42:45] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:42:45] [INFO ] Flatten gal took : 23 ms
[2025-06-08 12:42:45] [INFO ] Input system was already deterministic with 1032 transitions.
[2025-06-08 12:42:45] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:42:45] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17939166090145684837.gal : 6 ms
[2025-06-08 12:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3915442003131355214.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/CTLFireability17939166090145684837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3915442003131355214.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,9.6372e+09,23.6776,485080,2,31495,5,1.56065e+06,6,0,4210,2.07804e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:43:15] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:43:15] [INFO ] Applying decomposition
[2025-06-08 12:43:15] [INFO ] Flatten gal took : 20 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/graph635016497929194005.txt' '-o' '/tmp/graph635016497929194005.bin' '-w' '/tmp/graph635016497929194005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph635016497929194005.bin' '-l' '-1' '-v' '-w' '/tmp/graph635016497929194005.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:43:15] [INFO ] Decomposing Gal with order
[2025-06-08 12:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:43:15] [INFO ] Removed a total of 858 redundant transitions.
[2025-06-08 12:43:15] [INFO ] Flatten gal took : 44 ms
[2025-06-08 12:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-08 12:43:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9105389767424089713.gal : 6 ms
[2025-06-08 12:43:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15883393750197747275.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/CTLFireability9105389767424089713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15883393750197747275.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,9.6372e+09,8.05033,283496,2462,16,516553,875,1280,1.39317e+06,51,2659,0


Converting to forward existential form...Done !
original formula: AG((AG(EX(((i8.i1.i0.u59.p199==0)&&(i21.u199.p711==0)))) + (i4.i0.i0.u42.p123==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((i4.i0.i0.u42.p123==1))),TRUE) * !(EX(((i8.i1.i0.u59.p199==0)&&(i21.u199.p711==0))))...165
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t330, t383, t386, t420, t502, t558, t591, t680, t736, t756, t757, t760...603
(forward)formula 0,0,10.7329,283496,1,0,516553,875,10175,1.39317e+06,223,2659,1391909
FORMULA MedleyB-PT-B02-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 959 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 959 transition count 1203
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 936 transition count 1180
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 936 transition count 1180
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 123 place count 915 transition count 1159
Iterating global reduction 0 with 21 rules applied. Total rules applied 144 place count 915 transition count 1159
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 895 transition count 1139
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 895 transition count 1139
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 201 place count 878 transition count 1122
Iterating global reduction 0 with 17 rules applied. Total rules applied 218 place count 878 transition count 1122
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 233 place count 863 transition count 1107
Iterating global reduction 0 with 15 rules applied. Total rules applied 248 place count 863 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 249 place count 863 transition count 1106
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 260 place count 852 transition count 1095
Iterating global reduction 1 with 11 rules applied. Total rules applied 271 place count 852 transition count 1095
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 282 place count 841 transition count 1084
Iterating global reduction 1 with 11 rules applied. Total rules applied 293 place count 841 transition count 1084
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 301 place count 833 transition count 1076
Iterating global reduction 1 with 8 rules applied. Total rules applied 309 place count 833 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 316 place count 826 transition count 1069
Iterating global reduction 1 with 7 rules applied. Total rules applied 323 place count 826 transition count 1069
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 325 place count 826 transition count 1067
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 329 place count 822 transition count 1063
Iterating global reduction 2 with 4 rules applied. Total rules applied 333 place count 822 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 818 transition count 1059
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 814 transition count 1055
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 353 place count 810 transition count 1051
Iterating global reduction 2 with 4 rules applied. Total rules applied 357 place count 810 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 361 place count 806 transition count 1047
Iterating global reduction 2 with 4 rules applied. Total rules applied 365 place count 806 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 369 place count 803 transition count 1043
Iterating global reduction 3 with 3 rules applied. Total rules applied 372 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 375 place count 800 transition count 1040
Iterating global reduction 3 with 3 rules applied. Total rules applied 378 place count 800 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 379 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 381 place count 798 transition count 1037
Iterating global reduction 4 with 2 rules applied. Total rules applied 383 place count 798 transition count 1037
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 385 place count 796 transition count 1035
Iterating global reduction 4 with 2 rules applied. Total rules applied 387 place count 796 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 388 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 389 place count 795 transition count 1033
Iterating global reduction 5 with 1 rules applied. Total rules applied 390 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 391 place count 794 transition count 1032
Iterating global reduction 5 with 1 rules applied. Total rules applied 392 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 393 place count 793 transition count 1031
Iterating global reduction 5 with 1 rules applied. Total rules applied 394 place count 793 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 395 place count 793 transition count 1030
Applied a total of 395 rules in 529 ms. Remains 793 /987 variables (removed 194) and now considering 1030/1231 (removed 201) transitions.
// Phase 1: matrix 1030 rows 793 cols
[2025-06-08 12:43:26] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:27] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-08 12:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:27] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 1029 sub problems to find dead transitions.
[2025-06-08 12:43:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/792 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
SMT process timed out in 30216ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 793/987 places, 1030/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31901 ms. Remains : 793/987 places, 1030/1231 transitions.
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 21 ms
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:43:58] [INFO ] Input system was already deterministic with 1030 transitions.
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:43:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8368985462181017079.gal : 4 ms
[2025-06-08 12:43:58] [INFO ] Time to serialize properties into /tmp/CTLFireability402805722486588758.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/CTLFireability8368985462181017079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability402805722486588758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.60715e+09,26.6837,516896,2,31652,5,1.64763e+06,6,0,4204,2.24192e+06,0


Converting to forward existential form...Done !
original formula: (AF(AX(((AX((p748==1)) + (p295==0)) + (p895==0)))) * AG(AX(AG((p700==0)))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(((!(EX(!((p748==1)))) + (p295==0)) + (p895==0)))))))] = FALSE * [(FwdU(EY(FwdU(Init,TRUE)),...186
(forward)formula 0,0,29.2119,516896,1,0,9,1.64763e+06,10,2,8883,2.24192e+06,4
FORMULA MedleyB-PT-B02-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 958 transition count 1202
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 958 transition count 1202
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 934 transition count 1178
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 934 transition count 1178
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 127 place count 913 transition count 1157
Iterating global reduction 0 with 21 rules applied. Total rules applied 148 place count 913 transition count 1157
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 168 place count 893 transition count 1137
Iterating global reduction 0 with 20 rules applied. Total rules applied 188 place count 893 transition count 1137
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 204 place count 877 transition count 1121
Iterating global reduction 0 with 16 rules applied. Total rules applied 220 place count 877 transition count 1121
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 235 place count 862 transition count 1106
Iterating global reduction 0 with 15 rules applied. Total rules applied 250 place count 862 transition count 1106
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 262 place count 850 transition count 1094
Iterating global reduction 0 with 12 rules applied. Total rules applied 274 place count 850 transition count 1094
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 285 place count 839 transition count 1083
Iterating global reduction 0 with 11 rules applied. Total rules applied 296 place count 839 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 304 place count 831 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 312 place count 831 transition count 1075
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 319 place count 824 transition count 1068
Iterating global reduction 0 with 7 rules applied. Total rules applied 326 place count 824 transition count 1068
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 328 place count 824 transition count 1066
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 332 place count 820 transition count 1062
Iterating global reduction 1 with 4 rules applied. Total rules applied 336 place count 820 transition count 1062
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 340 place count 816 transition count 1058
Iterating global reduction 1 with 4 rules applied. Total rules applied 344 place count 816 transition count 1058
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 348 place count 812 transition count 1054
Iterating global reduction 1 with 4 rules applied. Total rules applied 352 place count 812 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 356 place count 808 transition count 1050
Iterating global reduction 1 with 4 rules applied. Total rules applied 360 place count 808 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 364 place count 804 transition count 1046
Iterating global reduction 1 with 4 rules applied. Total rules applied 368 place count 804 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 369 place count 804 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 372 place count 801 transition count 1042
Iterating global reduction 2 with 3 rules applied. Total rules applied 375 place count 801 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 378 place count 798 transition count 1039
Iterating global reduction 2 with 3 rules applied. Total rules applied 381 place count 798 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 382 place count 798 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 384 place count 796 transition count 1036
Iterating global reduction 3 with 2 rules applied. Total rules applied 386 place count 796 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 388 place count 794 transition count 1034
Iterating global reduction 3 with 2 rules applied. Total rules applied 390 place count 794 transition count 1034
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 794 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 392 place count 793 transition count 1032
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 793 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 394 place count 792 transition count 1031
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 792 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 396 place count 791 transition count 1030
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 398 place count 791 transition count 1029
Applied a total of 398 rules in 573 ms. Remains 791 /987 variables (removed 196) and now considering 1029/1231 (removed 202) transitions.
// Phase 1: matrix 1029 rows 791 cols
[2025-06-08 12:44:28] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:28] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-08 12:44:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:29] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2025-06-08 12:44:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Starting structural reductions in LTL mode, iteration 1 : 791/987 places, 1029/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31917 ms. Remains : 791/987 places, 1029/1231 transitions.
[2025-06-08 12:44:59] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:44:59] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:44:59] [INFO ] Input system was already deterministic with 1029 transitions.
[2025-06-08 12:44:59] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:44:59] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:44:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12150141146158888953.gal : 4 ms
[2025-06-08 12:44:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2214190824330379730.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/CTLFireability12150141146158888953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2214190824330379730.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,9.54844e+09,20.1393,470504,2,27394,5,1.42848e+06,6,0,4195,2.0345e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:45:29] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:45:29] [INFO ] Applying decomposition
[2025-06-08 12:45:29] [INFO ] Flatten gal took : 18 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/graph14386992831307602540.txt' '-o' '/tmp/graph14386992831307602540.bin' '-w' '/tmp/graph14386992831307602540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14386992831307602540.bin' '-l' '-1' '-v' '-w' '/tmp/graph14386992831307602540.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:45:30] [INFO ] Decomposing Gal with order
[2025-06-08 12:45:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:45:30] [INFO ] Removed a total of 862 redundant transitions.
[2025-06-08 12:45:30] [INFO ] Flatten gal took : 41 ms
[2025-06-08 12:45:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2025-06-08 12:45:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6425511905871590566.gal : 7 ms
[2025-06-08 12:45:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10863933555388928072.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/CTLFireability6425511905871590566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10863933555388928072.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,9.54844e+09,4.69005,164776,2136,15,296148,923,1295,807176,44,2874,0


Converting to forward existential form...Done !
original formula: EG((!(E((((i0.u34.p94==1)&&(i0.u85.p440==1))&&((i0.u189.p741==1)&&(i0.u259.p1019==1))) U (i4.u42.p112==1))) * (AX(((i33.u307.p1150==0)&&(...248
=> equivalent forward existential formula: [FwdG(Init,(!(E((((i0.u34.p94==1)&&(i0.u85.p440==1))&&((i0.u189.p741==1)&&(i0.u259.p1019==1))) U (i4.u42.p112==1...297
Reverse transition relation is NOT exact ! Due to transitions t76, t160, t161, t217, t251, t389, t423, t506, t562, t595, t677, t730, t733, t753, t754, t757...617
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 959 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 959 transition count 1203
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 936 transition count 1180
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 936 transition count 1180
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 123 place count 915 transition count 1159
Iterating global reduction 0 with 21 rules applied. Total rules applied 144 place count 915 transition count 1159
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 895 transition count 1139
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 895 transition count 1139
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 201 place count 878 transition count 1122
Iterating global reduction 0 with 17 rules applied. Total rules applied 218 place count 878 transition count 1122
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 233 place count 863 transition count 1107
Iterating global reduction 0 with 15 rules applied. Total rules applied 248 place count 863 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 249 place count 863 transition count 1106
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 260 place count 852 transition count 1095
Iterating global reduction 1 with 11 rules applied. Total rules applied 271 place count 852 transition count 1095
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 281 place count 842 transition count 1085
Iterating global reduction 1 with 10 rules applied. Total rules applied 291 place count 842 transition count 1085
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 299 place count 834 transition count 1077
Iterating global reduction 1 with 8 rules applied. Total rules applied 307 place count 834 transition count 1077
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 313 place count 828 transition count 1071
Iterating global reduction 1 with 6 rules applied. Total rules applied 319 place count 828 transition count 1071
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 321 place count 828 transition count 1069
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 324 place count 825 transition count 1066
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 825 transition count 1066
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 330 place count 822 transition count 1063
Iterating global reduction 2 with 3 rules applied. Total rules applied 333 place count 822 transition count 1063
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 336 place count 819 transition count 1060
Iterating global reduction 2 with 3 rules applied. Total rules applied 339 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 342 place count 816 transition count 1057
Iterating global reduction 2 with 3 rules applied. Total rules applied 345 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 348 place count 813 transition count 1054
Iterating global reduction 2 with 3 rules applied. Total rules applied 351 place count 813 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 352 place count 813 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 354 place count 811 transition count 1051
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 809 transition count 1049
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 809 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 362 place count 808 transition count 1047
Iterating global reduction 4 with 1 rules applied. Total rules applied 363 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 364 place count 807 transition count 1046
Iterating global reduction 4 with 1 rules applied. Total rules applied 365 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 366 place count 806 transition count 1045
Iterating global reduction 4 with 1 rules applied. Total rules applied 367 place count 806 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 368 place count 805 transition count 1044
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 805 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 370 place count 804 transition count 1043
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 804 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 804 transition count 1042
Applied a total of 372 rules in 574 ms. Remains 804 /987 variables (removed 183) and now considering 1042/1231 (removed 189) transitions.
// Phase 1: matrix 1042 rows 804 cols
[2025-06-08 12:46:00] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:01] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-08 12:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:01] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2025-06-08 12:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 30223ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 804/987 places, 1042/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31975 ms. Remains : 804/987 places, 1042/1231 transitions.
[2025-06-08 12:46:32] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:46:32] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:46:32] [INFO ] Input system was already deterministic with 1042 transitions.
[2025-06-08 12:46:32] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:46:32] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:46:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17742040436734932114.gal : 4 ms
[2025-06-08 12:46:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2277107585772272591.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/CTLFireability17742040436734932114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2277107585772272591.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,9.93774e+09,18.931,458932,2,25422,5,1.37107e+06,6,0,4260,1.98947e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:47:02] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:47:02] [INFO ] Applying decomposition
[2025-06-08 12:47:02] [INFO ] Flatten gal took : 17 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/graph14452105023387703814.txt' '-o' '/tmp/graph14452105023387703814.bin' '-w' '/tmp/graph14452105023387703814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14452105023387703814.bin' '-l' '-1' '-v' '-w' '/tmp/graph14452105023387703814.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:47:02] [INFO ] Decomposing Gal with order
[2025-06-08 12:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:47:02] [INFO ] Removed a total of 863 redundant transitions.
[2025-06-08 12:47:02] [INFO ] Flatten gal took : 38 ms
[2025-06-08 12:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2025-06-08 12:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6201965458768647370.gal : 6 ms
[2025-06-08 12:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17509202403932991307.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/CTLFireability6201965458768647370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17509202403932991307.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,9.93774e+09,3.76904,147292,2157,15,269081,937,1264,710662,49,2801,0


Converting to forward existential form...Done !
original formula: AX(AF(EG((i23.u226.p791==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((i23.u226.p791==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t214, t248, t343, t399, t433, t571, t604, t686, t762, t763, t766, t769, t772, t773, t776...604
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 960 transition count 1204
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 960 transition count 1204
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 76 place count 938 transition count 1182
Iterating global reduction 0 with 22 rules applied. Total rules applied 98 place count 938 transition count 1182
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 118 place count 918 transition count 1162
Iterating global reduction 0 with 20 rules applied. Total rules applied 138 place count 918 transition count 1162
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 157 place count 899 transition count 1143
Iterating global reduction 0 with 19 rules applied. Total rules applied 176 place count 899 transition count 1143
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 192 place count 883 transition count 1127
Iterating global reduction 0 with 16 rules applied. Total rules applied 208 place count 883 transition count 1127
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 223 place count 868 transition count 1112
Iterating global reduction 0 with 15 rules applied. Total rules applied 238 place count 868 transition count 1112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 239 place count 868 transition count 1111
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 250 place count 857 transition count 1100
Iterating global reduction 1 with 11 rules applied. Total rules applied 261 place count 857 transition count 1100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 269 place count 849 transition count 1092
Iterating global reduction 1 with 8 rules applied. Total rules applied 277 place count 849 transition count 1092
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 283 place count 843 transition count 1086
Iterating global reduction 1 with 6 rules applied. Total rules applied 289 place count 843 transition count 1086
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 294 place count 838 transition count 1081
Iterating global reduction 1 with 5 rules applied. Total rules applied 299 place count 838 transition count 1081
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 300 place count 838 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 302 place count 836 transition count 1078
Iterating global reduction 2 with 2 rules applied. Total rules applied 304 place count 836 transition count 1078
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 306 place count 834 transition count 1076
Iterating global reduction 2 with 2 rules applied. Total rules applied 308 place count 834 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 310 place count 832 transition count 1074
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 832 transition count 1074
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 314 place count 830 transition count 1072
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 830 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 318 place count 828 transition count 1070
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 828 transition count 1070
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 321 place count 828 transition count 1069
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 827 transition count 1068
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 827 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 324 place count 826 transition count 1067
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 826 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 826 transition count 1066
Applied a total of 326 rules in 442 ms. Remains 826 /987 variables (removed 161) and now considering 1066/1231 (removed 165) transitions.
// Phase 1: matrix 1066 rows 826 cols
[2025-06-08 12:47:33] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:47:33] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-08 12:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:47:34] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Running 1065 sub problems to find dead transitions.
[2025-06-08 12:47:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 30224ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 30227ms
Starting structural reductions in LTL mode, iteration 1 : 826/987 places, 1066/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31839 ms. Remains : 826/987 places, 1066/1231 transitions.
[2025-06-08 12:48:04] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:48:04] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:48:04] [INFO ] Input system was already deterministic with 1066 transitions.
[2025-06-08 12:48:04] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:48:04] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14220623812402844385.gal : 4 ms
[2025-06-08 12:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10419447776285297097.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/CTLFireability14220623812402844385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10419447776285297097.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.06972e+10,19.1205,466536,2,25773,5,1.43088e+06,6,0,4372,2.02579e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:48:34] [INFO ] Flatten gal took : 29 ms
[2025-06-08 12:48:34] [INFO ] Applying decomposition
[2025-06-08 12:48:34] [INFO ] Flatten gal took : 18 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/graph6634565750776051430.txt' '-o' '/tmp/graph6634565750776051430.bin' '-w' '/tmp/graph6634565750776051430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6634565750776051430.bin' '-l' '-1' '-v' '-w' '/tmp/graph6634565750776051430.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:48:34] [INFO ] Decomposing Gal with order
[2025-06-08 12:48:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:48:34] [INFO ] Removed a total of 865 redundant transitions.
[2025-06-08 12:48:34] [INFO ] Flatten gal took : 39 ms
[2025-06-08 12:48:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-06-08 12:48:34] [INFO ] Time to serialize gal into /tmp/CTLFireability224732235029176626.gal : 6 ms
[2025-06-08 12:48:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4057326588690584284.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/CTLFireability224732235029176626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4057326588690584284.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 -...261
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.06972e+10,4.12804,157100,2246,19,282994,1020,1282,784514,54,2992,0


Converting to forward existential form...Done !
original formula: EX(A(((EG((i30.u318.p1127==1)) + (((i3.u3.p17!=1) * EX(((i17.u151.p568==1)&&(i37.u347.p1225==1)))) * ((i20.u184.p658==1) + EF((i6.u64.p21...382
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((E(!(E(TRUE U ((i18.u156.p589==1)||(i29.i1.i0.u273.p964==1)))) U (!(!(E(TRUE U !((i32.i0....1189
Reverse transition relation is NOT exact ! Due to transitions t76, t171, t261, t413, t447, t529, t585, t618, t702, t778, t782, t786, t789, t792, t793, t796...661
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 959 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 959 transition count 1203
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 936 transition count 1180
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 936 transition count 1180
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 123 place count 915 transition count 1159
Iterating global reduction 0 with 21 rules applied. Total rules applied 144 place count 915 transition count 1159
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 895 transition count 1139
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 895 transition count 1139
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 201 place count 878 transition count 1122
Iterating global reduction 0 with 17 rules applied. Total rules applied 218 place count 878 transition count 1122
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 233 place count 863 transition count 1107
Iterating global reduction 0 with 15 rules applied. Total rules applied 248 place count 863 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 249 place count 863 transition count 1106
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 260 place count 852 transition count 1095
Iterating global reduction 1 with 11 rules applied. Total rules applied 271 place count 852 transition count 1095
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 281 place count 842 transition count 1085
Iterating global reduction 1 with 10 rules applied. Total rules applied 291 place count 842 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 298 place count 835 transition count 1078
Iterating global reduction 1 with 7 rules applied. Total rules applied 305 place count 835 transition count 1078
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 311 place count 829 transition count 1072
Iterating global reduction 1 with 6 rules applied. Total rules applied 317 place count 829 transition count 1072
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 319 place count 829 transition count 1070
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 322 place count 826 transition count 1067
Iterating global reduction 2 with 3 rules applied. Total rules applied 325 place count 826 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 328 place count 823 transition count 1064
Iterating global reduction 2 with 3 rules applied. Total rules applied 331 place count 823 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 820 transition count 1061
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 820 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 340 place count 817 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 343 place count 817 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 346 place count 814 transition count 1055
Iterating global reduction 2 with 3 rules applied. Total rules applied 349 place count 814 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 352 place count 811 transition count 1052
Iterating global reduction 2 with 3 rules applied. Total rules applied 355 place count 811 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 358 place count 808 transition count 1049
Iterating global reduction 2 with 3 rules applied. Total rules applied 361 place count 808 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 362 place count 808 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 364 place count 806 transition count 1046
Iterating global reduction 3 with 2 rules applied. Total rules applied 366 place count 806 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 368 place count 804 transition count 1044
Iterating global reduction 3 with 2 rules applied. Total rules applied 370 place count 804 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 372 place count 803 transition count 1042
Iterating global reduction 4 with 1 rules applied. Total rules applied 373 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 374 place count 802 transition count 1041
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 376 place count 801 transition count 1040
Iterating global reduction 4 with 1 rules applied. Total rules applied 377 place count 801 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 378 place count 801 transition count 1039
Applied a total of 378 rules in 536 ms. Remains 801 /987 variables (removed 186) and now considering 1039/1231 (removed 192) transitions.
// Phase 1: matrix 1039 rows 801 cols
[2025-06-08 12:49:05] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:05] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-06-08 12:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:06] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2025-06-08 12:49:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
SMT process timed out in 30207ms, After SMT, problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 30209ms
Starting structural reductions in LTL mode, iteration 1 : 801/987 places, 1039/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31878 ms. Remains : 801/987 places, 1039/1231 transitions.
[2025-06-08 12:49:36] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:49:36] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:49:36] [INFO ] Input system was already deterministic with 1039 transitions.
[2025-06-08 12:49:36] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:49:36] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:49:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10341089859256579047.gal : 4 ms
[2025-06-08 12:49:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6378719420411590891.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/CTLFireability10341089859256579047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6378719420411590891.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,9.84758e+09,20.7124,507592,2,30350,5,1.61217e+06,6,0,4245,2.21423e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:50:07] [INFO ] Flatten gal took : 23 ms
[2025-06-08 12:50:07] [INFO ] Applying decomposition
[2025-06-08 12:50:07] [INFO ] Flatten gal took : 18 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/graph14443895696776828552.txt' '-o' '/tmp/graph14443895696776828552.bin' '-w' '/tmp/graph14443895696776828552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14443895696776828552.bin' '-l' '-1' '-v' '-w' '/tmp/graph14443895696776828552.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:50:07] [INFO ] Decomposing Gal with order
[2025-06-08 12:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:50:07] [INFO ] Removed a total of 861 redundant transitions.
[2025-06-08 12:50:07] [INFO ] Flatten gal took : 42 ms
[2025-06-08 12:50:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-08 12:50:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14980455804937209011.gal : 6 ms
[2025-06-08 12:50:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9253807737184292442.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/CTLFireability14980455804937209011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9253807737184292442.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,9.84758e+09,5.85781,213988,2305,15,378641,984,1216,1.12414e+06,44,3067,0


Converting to forward existential form...Done !
original formula: EX(AG(!(A((i6.u62.p192==1) U (((i0.u33.p94==1)&&(i0.u114.p440==1))&&((i0.u172.p718==1)&&(i0.u269.p1019==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(!((E(!((((i0.u33.p94==1)&&(i0.u114.p440==1))&&((i0.u172.p718==1)&&(i0.u269.p1019==1)...374
Reverse transition relation is NOT exact ! Due to transitions t76, t157, t158, t214, t248, t330, t383, t386, t420, t502, t558, t591, t628, t683, t759, t760...608
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 a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Graph (trivial) has 969 edges and 987 vertex of which 66 / 987 are part of one of the 12 SCC in 5 ms
Free SCC test removed 54 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 693 rules applied. Total rules applied 694 place count 932 transition count 475
Reduce places removed 693 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 704 rules applied. Total rules applied 1398 place count 239 transition count 464
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1405 place count 235 transition count 461
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1408 place count 232 transition count 461
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 1408 place count 232 transition count 407
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1516 place count 178 transition count 407
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1535 place count 159 transition count 388
Iterating global reduction 4 with 19 rules applied. Total rules applied 1554 place count 159 transition count 388
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1566 place count 147 transition count 350
Iterating global reduction 4 with 12 rules applied. Total rules applied 1578 place count 147 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1580 place count 147 transition count 348
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1584 place count 143 transition count 344
Iterating global reduction 5 with 4 rules applied. Total rules applied 1588 place count 143 transition count 344
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1592 place count 139 transition count 340
Iterating global reduction 5 with 4 rules applied. Total rules applied 1596 place count 139 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1597 place count 139 transition count 339
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1639 place count 118 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1642 place count 118 transition count 315
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1661 place count 99 transition count 196
Iterating global reduction 7 with 19 rules applied. Total rules applied 1680 place count 99 transition count 196
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1688 place count 99 transition count 188
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1700 place count 87 transition count 172
Iterating global reduction 8 with 12 rules applied. Total rules applied 1712 place count 87 transition count 172
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1724 place count 75 transition count 156
Iterating global reduction 8 with 12 rules applied. Total rules applied 1736 place count 75 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1742 place count 75 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1744 place count 74 transition count 149
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1745 place count 73 transition count 145
Iterating global reduction 9 with 1 rules applied. Total rules applied 1746 place count 73 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1747 place count 73 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1751 place count 73 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1759 place count 69 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1760 place count 68 transition count 135
Applied a total of 1760 rules in 54 ms. Remains 68 /987 variables (removed 919) and now considering 135/1231 (removed 1096) transitions.
[2025-06-08 12:50:37] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
// Phase 1: matrix 130 rows 68 cols
[2025-06-08 12:50:37] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-08 12:50:37] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2025-06-08 12:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:50:37] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:50:37] [INFO ] Redundant transitions in 2 ms returned []
Running 126 sub problems to find dead transitions.
[2025-06-08 12:50:37] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2025-06-08 12:50:37] [INFO ] Invariant cache hit.
[2025-06-08 12:50:37] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:38] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:39] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:39] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 129/197 variables, 68/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 1/198 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 100 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 129/197 variables, 68/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 126/225 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 226 constraints, problems are : Problem set: 0 solved, 126 unsolved in 9234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15988ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 15989ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/987 places, 135/1231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16184 ms. Remains : 68/987 places, 135/1231 transitions.
[2025-06-08 12:50:53] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:50:53] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:50:53] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-08 12:50:53] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:50:53] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:50:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14207511810888112120.gal : 1 ms
[2025-06-08 12:50:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7433755621120456824.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/CTLFireability14207511810888112120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7433755621120456824.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,95386,0.157738,10280,2,2615,5,24031,6,0,399,20755,0


Converting to forward existential form...Done !
original formula: E((EG((p212==1)) + (p118!=1)) U ((p503==1)||(p1048==1)))
=> equivalent forward existential formula: [(FwdU(Init,(EG((p212==1)) + (p118!=1))) * ((p503==1)||(p1048==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t13, t14, t15, t18, t21, t22, t27, t31, t32, t33, t51, t52, t53, t60, t62, t7...340
(forward)formula 0,1,2.12026,73548,1,0,433,302301,292,206,3425,343310,484
FORMULA MedleyB-PT-B02-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 959 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 959 transition count 1203
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 80 place count 935 transition count 1179
Iterating global reduction 0 with 24 rules applied. Total rules applied 104 place count 935 transition count 1179
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 126 place count 913 transition count 1157
Iterating global reduction 0 with 22 rules applied. Total rules applied 148 place count 913 transition count 1157
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 168 place count 893 transition count 1137
Iterating global reduction 0 with 20 rules applied. Total rules applied 188 place count 893 transition count 1137
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 205 place count 876 transition count 1120
Iterating global reduction 0 with 17 rules applied. Total rules applied 222 place count 876 transition count 1120
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 237 place count 861 transition count 1105
Iterating global reduction 0 with 15 rules applied. Total rules applied 252 place count 861 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 253 place count 861 transition count 1104
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 264 place count 850 transition count 1093
Iterating global reduction 1 with 11 rules applied. Total rules applied 275 place count 850 transition count 1093
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 285 place count 840 transition count 1083
Iterating global reduction 1 with 10 rules applied. Total rules applied 295 place count 840 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 303 place count 832 transition count 1075
Iterating global reduction 1 with 8 rules applied. Total rules applied 311 place count 832 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 317 place count 826 transition count 1069
Iterating global reduction 1 with 6 rules applied. Total rules applied 323 place count 826 transition count 1069
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 325 place count 826 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 328 place count 823 transition count 1064
Iterating global reduction 2 with 3 rules applied. Total rules applied 331 place count 823 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 820 transition count 1061
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 820 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 340 place count 817 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 343 place count 817 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 346 place count 814 transition count 1055
Iterating global reduction 2 with 3 rules applied. Total rules applied 349 place count 814 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 352 place count 811 transition count 1052
Iterating global reduction 2 with 3 rules applied. Total rules applied 355 place count 811 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 356 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 809 transition count 1049
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 807 transition count 1047
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 366 place count 806 transition count 1045
Iterating global reduction 4 with 1 rules applied. Total rules applied 367 place count 806 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 368 place count 805 transition count 1044
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 805 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 370 place count 804 transition count 1043
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 372 place count 803 transition count 1042
Iterating global reduction 4 with 1 rules applied. Total rules applied 373 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 374 place count 802 transition count 1041
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 802 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 376 place count 802 transition count 1040
Applied a total of 376 rules in 543 ms. Remains 802 /987 variables (removed 185) and now considering 1040/1231 (removed 191) transitions.
// Phase 1: matrix 1040 rows 802 cols
[2025-06-08 12:50:56] [INFO ] Computed 5 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:56] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-06-08 12:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:57] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Running 1039 sub problems to find dead transitions.
[2025-06-08 12:50:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Starting structural reductions in LTL mode, iteration 1 : 802/987 places, 1040/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31814 ms. Remains : 802/987 places, 1040/1231 transitions.
[2025-06-08 12:51:27] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:51:27] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:51:27] [INFO ] Input system was already deterministic with 1040 transitions.
[2025-06-08 12:51:27] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:51:27] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:51:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8854501183599722106.gal : 4 ms
[2025-06-08 12:51:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5862938309978611732.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/CTLFireability8854501183599722106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5862938309978611732.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86522e+09,20.8739,486096,2,30583,5,1.55752e+06,6,0,4250,2.07107e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:51:57] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:51:57] [INFO ] Applying decomposition
[2025-06-08 12:51:57] [INFO ] Flatten gal took : 17 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/graph7022784834026666941.txt' '-o' '/tmp/graph7022784834026666941.bin' '-w' '/tmp/graph7022784834026666941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7022784834026666941.bin' '-l' '-1' '-v' '-w' '/tmp/graph7022784834026666941.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:51:57] [INFO ] Decomposing Gal with order
[2025-06-08 12:51:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:51:57] [INFO ] Removed a total of 857 redundant transitions.
[2025-06-08 12:51:57] [INFO ] Flatten gal took : 32 ms
[2025-06-08 12:51:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-06-08 12:51:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13204022737388621552.gal : 6 ms
[2025-06-08 12:51:57] [INFO ] Time to serialize properties into /tmp/CTLFireability889492151325558749.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/CTLFireability13204022737388621552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability889492151325558749.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,9.86522e+09,4.18376,162656,2173,15,295472,906,1278,793831,49,2772,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(((E((i21.u218.p794==1) U (i32.u301.p1152==1)) * ((i7.u2.p304==1)||(i9.u86.p316==1))) * ((i13.i1.i0.u127.p431==1)||(((i0.u4.p139=...225
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(((E((i21.u218.p794==1) U (i32.u301.p1152==1)) * ((i7.u2.p304==1)||(i9.u86.p316==1)...282
Reverse transition relation is NOT exact ! Due to transitions t76, t103, t158, t248, t340, t430, t568, t601, t683, t759, t760, t763, t766, t769, t770, t773...590
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 960 transition count 1204
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 960 transition count 1204
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 77 place count 937 transition count 1181
Iterating global reduction 0 with 23 rules applied. Total rules applied 100 place count 937 transition count 1181
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 121 place count 916 transition count 1160
Iterating global reduction 0 with 21 rules applied. Total rules applied 142 place count 916 transition count 1160
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 162 place count 896 transition count 1140
Iterating global reduction 0 with 20 rules applied. Total rules applied 182 place count 896 transition count 1140
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 199 place count 879 transition count 1123
Iterating global reduction 0 with 17 rules applied. Total rules applied 216 place count 879 transition count 1123
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 231 place count 864 transition count 1108
Iterating global reduction 0 with 15 rules applied. Total rules applied 246 place count 864 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 247 place count 864 transition count 1107
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 258 place count 853 transition count 1096
Iterating global reduction 1 with 11 rules applied. Total rules applied 269 place count 853 transition count 1096
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 279 place count 843 transition count 1086
Iterating global reduction 1 with 10 rules applied. Total rules applied 289 place count 843 transition count 1086
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 296 place count 836 transition count 1079
Iterating global reduction 1 with 7 rules applied. Total rules applied 303 place count 836 transition count 1079
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 309 place count 830 transition count 1073
Iterating global reduction 1 with 6 rules applied. Total rules applied 315 place count 830 transition count 1073
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 317 place count 830 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 320 place count 827 transition count 1068
Iterating global reduction 2 with 3 rules applied. Total rules applied 323 place count 827 transition count 1068
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 326 place count 824 transition count 1065
Iterating global reduction 2 with 3 rules applied. Total rules applied 329 place count 824 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 332 place count 821 transition count 1062
Iterating global reduction 2 with 3 rules applied. Total rules applied 335 place count 821 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 338 place count 818 transition count 1059
Iterating global reduction 2 with 3 rules applied. Total rules applied 341 place count 818 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 344 place count 815 transition count 1056
Iterating global reduction 2 with 3 rules applied. Total rules applied 347 place count 815 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 348 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 350 place count 813 transition count 1053
Iterating global reduction 3 with 2 rules applied. Total rules applied 352 place count 813 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 354 place count 811 transition count 1051
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 809 transition count 1049
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 807 transition count 1047
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 366 place count 806 transition count 1045
Iterating global reduction 4 with 1 rules applied. Total rules applied 367 place count 806 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 368 place count 805 transition count 1044
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 805 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 370 place count 804 transition count 1043
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 804 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 804 transition count 1042
Applied a total of 372 rules in 547 ms. Remains 804 /987 variables (removed 183) and now considering 1042/1231 (removed 189) transitions.
// Phase 1: matrix 1042 rows 804 cols
[2025-06-08 12:52:28] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:52:28] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-08 12:52:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:52:29] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2025-06-08 12:52:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Starting structural reductions in LTL mode, iteration 1 : 804/987 places, 1042/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31971 ms. Remains : 804/987 places, 1042/1231 transitions.
[2025-06-08 12:52:59] [INFO ] Flatten gal took : 16 ms
[2025-06-08 12:52:59] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:52:59] [INFO ] Input system was already deterministic with 1042 transitions.
[2025-06-08 12:52:59] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:52:59] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16706214331771365466.gal : 3 ms
[2025-06-08 12:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1996305722070960584.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/CTLFireability16706214331771365466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1996305722070960584.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,9.92436e+09,21.2953,529712,2,31280,5,1.6692e+06,6,0,4260,2.32007e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:53:30] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:53:30] [INFO ] Applying decomposition
[2025-06-08 12:53:30] [INFO ] Flatten gal took : 17 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/graph9009434044411342709.txt' '-o' '/tmp/graph9009434044411342709.bin' '-w' '/tmp/graph9009434044411342709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9009434044411342709.bin' '-l' '-1' '-v' '-w' '/tmp/graph9009434044411342709.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:53:30] [INFO ] Decomposing Gal with order
[2025-06-08 12:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:53:30] [INFO ] Removed a total of 863 redundant transitions.
[2025-06-08 12:53:30] [INFO ] Flatten gal took : 33 ms
[2025-06-08 12:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-08 12:53:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7321746442577827589.gal : 6 ms
[2025-06-08 12:53:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9371556625927509680.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/CTLFireability7321746442577827589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9371556625927509680.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,9.92436e+09,9.77935,326720,2348,15,521830,1097,1323,1.95145e+06,47,3314,0


Converting to forward existential form...Done !
original formula: AG((EX(AF(!(A((i13.i1.i2.u144.p523==1) U (i1.i0.i0.u10.p32==1))))) * EX(EF((i13.i1.i0.u111.p391==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(EG(!(!(!((E(!((i1.i0.i0.u10.p32==1)) U (!((i13.i1.i2.u144.p523==1)) * !((i1.i0.i0.u1...291
Reverse transition relation is NOT exact ! Due to transitions t76, t157, t158, t214, t248, t330, t386, t420, t571, t604, t686, t739, t742, t762, t763, t766...619
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 960 transition count 1204
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 960 transition count 1204
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 76 place count 938 transition count 1182
Iterating global reduction 0 with 22 rules applied. Total rules applied 98 place count 938 transition count 1182
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 118 place count 918 transition count 1162
Iterating global reduction 0 with 20 rules applied. Total rules applied 138 place count 918 transition count 1162
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 157 place count 899 transition count 1143
Iterating global reduction 0 with 19 rules applied. Total rules applied 176 place count 899 transition count 1143
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 192 place count 883 transition count 1127
Iterating global reduction 0 with 16 rules applied. Total rules applied 208 place count 883 transition count 1127
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 222 place count 869 transition count 1113
Iterating global reduction 0 with 14 rules applied. Total rules applied 236 place count 869 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 237 place count 869 transition count 1112
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 247 place count 859 transition count 1102
Iterating global reduction 1 with 10 rules applied. Total rules applied 257 place count 859 transition count 1102
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 266 place count 850 transition count 1093
Iterating global reduction 1 with 9 rules applied. Total rules applied 275 place count 850 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 281 place count 844 transition count 1087
Iterating global reduction 1 with 6 rules applied. Total rules applied 287 place count 844 transition count 1087
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 292 place count 839 transition count 1082
Iterating global reduction 1 with 5 rules applied. Total rules applied 297 place count 839 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 298 place count 839 transition count 1081
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 302 place count 835 transition count 1077
Iterating global reduction 2 with 4 rules applied. Total rules applied 306 place count 835 transition count 1077
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 310 place count 831 transition count 1073
Iterating global reduction 2 with 4 rules applied. Total rules applied 314 place count 831 transition count 1073
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 318 place count 827 transition count 1069
Iterating global reduction 2 with 4 rules applied. Total rules applied 322 place count 827 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 823 transition count 1065
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 823 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 334 place count 819 transition count 1061
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 819 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 342 place count 816 transition count 1057
Iterating global reduction 3 with 3 rules applied. Total rules applied 345 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 348 place count 813 transition count 1054
Iterating global reduction 3 with 3 rules applied. Total rules applied 351 place count 813 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 813 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 354 place count 811 transition count 1051
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 358 place count 809 transition count 1049
Iterating global reduction 4 with 2 rules applied. Total rules applied 360 place count 809 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 362 place count 808 transition count 1047
Iterating global reduction 5 with 1 rules applied. Total rules applied 363 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 364 place count 807 transition count 1046
Iterating global reduction 5 with 1 rules applied. Total rules applied 365 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 366 place count 806 transition count 1045
Iterating global reduction 5 with 1 rules applied. Total rules applied 367 place count 806 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 368 place count 806 transition count 1044
Applied a total of 368 rules in 552 ms. Remains 806 /987 variables (removed 181) and now considering 1044/1231 (removed 187) transitions.
// Phase 1: matrix 1044 rows 806 cols
[2025-06-08 12:54:00] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:54:01] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-08 12:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:54:01] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2025-06-08 12:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Starting structural reductions in LTL mode, iteration 1 : 806/987 places, 1044/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31899 ms. Remains : 806/987 places, 1044/1231 transitions.
[2025-06-08 12:54:32] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:54:32] [INFO ] Flatten gal took : 21 ms
[2025-06-08 12:54:32] [INFO ] Input system was already deterministic with 1044 transitions.
[2025-06-08 12:54:32] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:54:32] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:54:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17157312222024783949.gal : 3 ms
[2025-06-08 12:54:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12592059868490658546.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/CTLFireability17157312222024783949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12592059868490658546.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.00211e+10,18.4761,450256,2,25805,5,1.34718e+06,6,0,4270,1.95466e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:55:02] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:55:02] [INFO ] Applying decomposition
[2025-06-08 12:55:02] [INFO ] Flatten gal took : 17 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/graph8254605529900064015.txt' '-o' '/tmp/graph8254605529900064015.bin' '-w' '/tmp/graph8254605529900064015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8254605529900064015.bin' '-l' '-1' '-v' '-w' '/tmp/graph8254605529900064015.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:55:02] [INFO ] Decomposing Gal with order
[2025-06-08 12:55:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:55:02] [INFO ] Removed a total of 852 redundant transitions.
[2025-06-08 12:55:02] [INFO ] Flatten gal took : 32 ms
[2025-06-08 12:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-08 12:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11786604183351310255.gal : 6 ms
[2025-06-08 12:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9590257408728219479.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/CTLFireability11786604183351310255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9590257408728219479.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.00211e+10,16.6988,544840,2372,13,818352,987,1334,3.6538e+06,47,3083,0


Converting to forward existential form...Done !
original formula: AX(EF((((EF(AX((i26.u168.p855==1))) * AG((i13.i0.i0.u126.p418==1))) * (AX(((i14.i0.i0.u142.p459==1)||(i5.i1.i0.u65.p239==1))) * ((i36.u23...302
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((E(TRUE U !(EX(!((i26.u168.p855==1))))) * !(E(TRUE U !((i13.i0.i0.u126.p418==1))))) * ...385
Reverse transition relation is NOT exact ! Due to transitions t78, t160, t250, t277, t332, t388, t422, t448, t456, t511, t567, t600, t610, t690, t746, t766...598
(forward)formula 0,0,22.6195,544840,1,0,818352,1213,11011,3.6538e+06,225,5903,2002360
FORMULA MedleyB-PT-B02-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 959 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 959 transition count 1203
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 936 transition count 1180
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 936 transition count 1180
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 123 place count 915 transition count 1159
Iterating global reduction 0 with 21 rules applied. Total rules applied 144 place count 915 transition count 1159
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 895 transition count 1139
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 895 transition count 1139
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 201 place count 878 transition count 1122
Iterating global reduction 0 with 17 rules applied. Total rules applied 218 place count 878 transition count 1122
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 233 place count 863 transition count 1107
Iterating global reduction 0 with 15 rules applied. Total rules applied 248 place count 863 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 249 place count 863 transition count 1106
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 260 place count 852 transition count 1095
Iterating global reduction 1 with 11 rules applied. Total rules applied 271 place count 852 transition count 1095
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 281 place count 842 transition count 1085
Iterating global reduction 1 with 10 rules applied. Total rules applied 291 place count 842 transition count 1085
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 299 place count 834 transition count 1077
Iterating global reduction 1 with 8 rules applied. Total rules applied 307 place count 834 transition count 1077
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 314 place count 827 transition count 1070
Iterating global reduction 1 with 7 rules applied. Total rules applied 321 place count 827 transition count 1070
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 322 place count 827 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 823 transition count 1065
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 823 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 334 place count 819 transition count 1061
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 819 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 341 place count 816 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 344 place count 816 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 347 place count 813 transition count 1055
Iterating global reduction 2 with 3 rules applied. Total rules applied 350 place count 813 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 353 place count 810 transition count 1052
Iterating global reduction 2 with 3 rules applied. Total rules applied 356 place count 810 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 810 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 359 place count 808 transition count 1049
Iterating global reduction 3 with 2 rules applied. Total rules applied 361 place count 808 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 363 place count 806 transition count 1047
Iterating global reduction 3 with 2 rules applied. Total rules applied 365 place count 806 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 367 place count 804 transition count 1045
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 804 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 371 place count 802 transition count 1043
Iterating global reduction 3 with 2 rules applied. Total rules applied 373 place count 802 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 802 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 375 place count 801 transition count 1041
Iterating global reduction 4 with 1 rules applied. Total rules applied 376 place count 801 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 377 place count 800 transition count 1040
Iterating global reduction 4 with 1 rules applied. Total rules applied 378 place count 800 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 379 place count 799 transition count 1039
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 799 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 381 place count 799 transition count 1038
Applied a total of 381 rules in 540 ms. Remains 799 /987 variables (removed 188) and now considering 1038/1231 (removed 193) transitions.
// Phase 1: matrix 1038 rows 799 cols
[2025-06-08 12:55:25] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:55:26] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-08 12:55:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:55:26] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Running 1037 sub problems to find dead transitions.
[2025-06-08 12:55:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30198ms
Starting structural reductions in LTL mode, iteration 1 : 799/987 places, 1038/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31881 ms. Remains : 799/987 places, 1038/1231 transitions.
[2025-06-08 12:55:57] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:55:57] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:55:57] [INFO ] Input system was already deterministic with 1038 transitions.
[2025-06-08 12:55:57] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:55:57] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4428783809552729934.gal : 3 ms
[2025-06-08 12:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability978958376904521316.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/CTLFireability4428783809552729934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability978958376904521316.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.79679e+09,19.0948,471156,2,27248,5,1.43158e+06,6,0,4236,2.0305e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:56:27] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:56:27] [INFO ] Applying decomposition
[2025-06-08 12:56:27] [INFO ] Flatten gal took : 17 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/graph14087017052724521549.txt' '-o' '/tmp/graph14087017052724521549.bin' '-w' '/tmp/graph14087017052724521549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14087017052724521549.bin' '-l' '-1' '-v' '-w' '/tmp/graph14087017052724521549.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:56:27] [INFO ] Decomposing Gal with order
[2025-06-08 12:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:56:27] [INFO ] Removed a total of 861 redundant transitions.
[2025-06-08 12:56:27] [INFO ] Flatten gal took : 31 ms
[2025-06-08 12:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-08 12:56:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7309532031264122130.gal : 5 ms
[2025-06-08 12:56:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3969589415362266176.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/CTLFireability7309532031264122130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3969589415362266176.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,9.79679e+09,14.1376,474856,2476,15,696647,770,1293,3.23124e+06,47,2049,0


Converting to forward existential form...Done !
original formula: !(E((i14.u148.p535!=1) U ((AF(!(E((i5.i1.i0.u65.p209==1) U ((i16.u157.p583==1)&&(i7.i1.i0.u328.p1225==1))))) * (i10.i0.i0.u94.p330==1)) *...184
=> equivalent forward existential formula: [((FwdU(Init,(i14.u148.p535!=1)) * (!(EG(!(!(E((i5.i1.i0.u65.p209==1) U ((i16.u157.p583==1)&&(i7.i1.i0.u328.p122...232
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t329, t330, t386, t420, t508, t564, t597, t631, t686, t742, t762, t763...608
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1231/1231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 960 transition count 1204
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 960 transition count 1204
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 76 place count 938 transition count 1182
Iterating global reduction 0 with 22 rules applied. Total rules applied 98 place count 938 transition count 1182
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 116 place count 920 transition count 1164
Iterating global reduction 0 with 18 rules applied. Total rules applied 134 place count 920 transition count 1164
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 151 place count 903 transition count 1147
Iterating global reduction 0 with 17 rules applied. Total rules applied 168 place count 903 transition count 1147
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 183 place count 888 transition count 1132
Iterating global reduction 0 with 15 rules applied. Total rules applied 198 place count 888 transition count 1132
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 212 place count 874 transition count 1118
Iterating global reduction 0 with 14 rules applied. Total rules applied 226 place count 874 transition count 1118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 227 place count 874 transition count 1117
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 238 place count 863 transition count 1106
Iterating global reduction 1 with 11 rules applied. Total rules applied 249 place count 863 transition count 1106
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 259 place count 853 transition count 1096
Iterating global reduction 1 with 10 rules applied. Total rules applied 269 place count 853 transition count 1096
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 275 place count 847 transition count 1090
Iterating global reduction 1 with 6 rules applied. Total rules applied 281 place count 847 transition count 1090
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 286 place count 842 transition count 1085
Iterating global reduction 1 with 5 rules applied. Total rules applied 291 place count 842 transition count 1085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 293 place count 842 transition count 1083
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 296 place count 839 transition count 1080
Iterating global reduction 2 with 3 rules applied. Total rules applied 299 place count 839 transition count 1080
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 302 place count 836 transition count 1077
Iterating global reduction 2 with 3 rules applied. Total rules applied 305 place count 836 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 308 place count 833 transition count 1074
Iterating global reduction 2 with 3 rules applied. Total rules applied 311 place count 833 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 314 place count 830 transition count 1071
Iterating global reduction 2 with 3 rules applied. Total rules applied 317 place count 830 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 320 place count 827 transition count 1068
Iterating global reduction 2 with 3 rules applied. Total rules applied 323 place count 827 transition count 1068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 827 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 326 place count 825 transition count 1065
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 825 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 823 transition count 1063
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 823 transition count 1063
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 334 place count 821 transition count 1061
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 821 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 338 place count 819 transition count 1059
Iterating global reduction 3 with 2 rules applied. Total rules applied 340 place count 819 transition count 1059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 341 place count 819 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 342 place count 818 transition count 1057
Iterating global reduction 4 with 1 rules applied. Total rules applied 343 place count 818 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 344 place count 817 transition count 1056
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 817 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 346 place count 816 transition count 1055
Iterating global reduction 4 with 1 rules applied. Total rules applied 347 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 348 place count 816 transition count 1054
Applied a total of 348 rules in 558 ms. Remains 816 /987 variables (removed 171) and now considering 1054/1231 (removed 177) transitions.
// Phase 1: matrix 1054 rows 816 cols
[2025-06-08 12:56:58] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:56:58] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-06-08 12:56:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:56:59] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 1053 sub problems to find dead transitions.
[2025-06-08 12:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1053 unsolved
SMT process timed out in 30221ms, After SMT, problems are : Problem set: 0 solved, 1053 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Starting structural reductions in LTL mode, iteration 1 : 816/987 places, 1054/1231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31892 ms. Remains : 816/987 places, 1054/1231 transitions.
[2025-06-08 12:57:29] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:57:29] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:57:29] [INFO ] Input system was already deterministic with 1054 transitions.
[2025-06-08 12:57:29] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:57:29] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:57:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3806040681296506519.gal : 3 ms
[2025-06-08 12:57:29] [INFO ] Time to serialize properties into /tmp/CTLFireability18332619786426864670.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/CTLFireability3806040681296506519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18332619786426864670.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.01567e+10,20.1989,500680,2,31224,5,1.59096e+06,6,0,4320,2.1363e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:57:59] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:57:59] [INFO ] Applying decomposition
[2025-06-08 12:57:59] [INFO ] Flatten gal took : 18 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/graph4057132569063505251.txt' '-o' '/tmp/graph4057132569063505251.bin' '-w' '/tmp/graph4057132569063505251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4057132569063505251.bin' '-l' '-1' '-v' '-w' '/tmp/graph4057132569063505251.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:57:59] [INFO ] Decomposing Gal with order
[2025-06-08 12:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:57:59] [INFO ] Removed a total of 865 redundant transitions.
[2025-06-08 12:57:59] [INFO ] Flatten gal took : 33 ms
[2025-06-08 12:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-08 12:57:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14556173954048871277.gal : 5 ms
[2025-06-08 12:57:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5564419816556883691.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/CTLFireability14556173954048871277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5564419816556883691.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.01567e+10,5.71279,210616,2337,13,369577,989,1232,1.10434e+06,49,3146,0


Converting to forward existential form...Done !
original formula: A((AG((i1.u18.p47==1)) + EF(EX(((i14.u147.p525==1)||((i16.u159.p576==1)&&(i31.u280.p981==1)))))) U AG(!(((EX((i18.u172.p305==1)) * (i14.u...220
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(((EX((i18.u172.p305==1)) * (i14.u138.p468==1)) * ((i27.u248.p897==1) + E(TRUE U ...573
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t160, t214, t216, t250, t388, t428, t469, t524, t580, t613, t751, t771, t772, t775...538
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
Detected timeout of ITS tools.
[2025-06-08 12:58:29] [INFO ] Flatten gal took : 21 ms
[2025-06-08 12:58:29] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:58:29] [INFO ] Applying decomposition
[2025-06-08 12:58:29] [INFO ] Flatten gal took : 20 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/graph9574579417643983239.txt' '-o' '/tmp/graph9574579417643983239.bin' '-w' '/tmp/graph9574579417643983239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9574579417643983239.bin' '-l' '-1' '-v' '-w' '/tmp/graph9574579417643983239.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:58:29] [INFO ] Decomposing Gal with order
[2025-06-08 12:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:58:30] [INFO ] Removed a total of 888 redundant transitions.
[2025-06-08 12:58:30] [INFO ] Flatten gal took : 37 ms
[2025-06-08 12:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-08 12:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability18210535529153085553.gal : 7 ms
[2025-06-08 12:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14656520354145158741.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/CTLFireability18210535529153085553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14656520354145158741.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 10 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.84046e+10,10.1618,353788,2953,18,610271,1345,1475,1.87257e+06,53,5246,0


Converting to forward existential form...Done !
original formula: (!(A(EX(AX((i33.u309.p921!=1))) U ((i2.u257.p742==1) + !(EF((i0.u51.p149==1)))))) + EX(AG(A((i22.u204.p601==1) U EF((i28.u285.p838==1))))...157
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,!(((i2.u257.p742==1) + !(E(TRUE U (i0.u51.p149==1)))))) * !(EX(!(EX(!((i33.u309.p921!=1))))...479
Reverse transition relation is NOT exact ! Due to transitions t18, t28, t83, t106, t130, t140, t197, t198, t254, t256, t290, t398, t455, t495, t505, t553, ...678
Detected timeout of ITS tools.
[2025-06-08 13:25:37] [INFO ] Applying decomposition
[2025-06-08 13:25:37] [INFO ] Flatten gal took : 21 ms
[2025-06-08 13:25:37] [INFO ] Decomposing Gal with order
[2025-06-08 13:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:25:37] [INFO ] Removed a total of 757 redundant transitions.
[2025-06-08 13:25:37] [INFO ] Flatten gal took : 42 ms
[2025-06-08 13:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 5 ms.
[2025-06-08 13:25:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11452525398447653569.gal : 3 ms
[2025-06-08 13:25:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17748590639785776164.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/CTLFireability11452525398447653569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17748590639785776164.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 10 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.84046e+10,3.27634,109720,121,7024,9680,244722,140,35879,1982,1.52927e+06,0


Converting to forward existential form...Done !
original formula: (!(A(EX(AX((i0.u7.p921!=1))) U ((i0.i0.u6.p742==1) + !(EF((i0.i0.i0.u4.p149==1)))))) + EX(AG(A((i0.i0.i0.u5.p601==1) U EF((i0.i0.u6.p838=...163
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,!(((i0.i0.u6.p742==1) + !(E(TRUE U (i0.i0.i0.u4.p149==1)))))) * !(EX(!(EX(!((i0.u7.p921!=1)...497
Reverse transition relation is NOT exact ! Due to transitions t950, i0.u7.t83, i0.u7.t91, i0.u7.t106, i0.u7.t107, i0.u7.t121, i0.u7.t125, i0.u7.t130, i0.u7...1014

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B02"
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 MedleyB-PT-B02, 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 r254-tall-174931339900434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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