Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 489K May 29 14:33 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 ShieldRVt-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-15
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-00
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-01
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-02
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-03
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-04
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-05
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-06
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-07
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-08
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-09
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-10
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749121198002

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 10:59:59] [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-05 10:59:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 10:59:59] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-05 10:59:59] [INFO ] Transformed 2003 places.
[2025-06-05 10:59:59] [INFO ] Transformed 2003 transitions.
[2025-06-05 10:59:59] [INFO ] Found NUPN structural information;
[2025-06-05 10:59:59] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 147 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 394 places :
Symmetric choice reduction at 0 with 394 rule applications. Total rules 394 place count 1609 transition count 1609
Iterating global reduction 0 with 394 rules applied. Total rules applied 788 place count 1609 transition count 1609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 789 place count 1608 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 790 place count 1608 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 791 place count 1607 transition count 1607
Iterating global reduction 0 with 1 rules applied. Total rules applied 792 place count 1607 transition count 1607
Applied a total of 792 rules in 1009 ms. Remains 1607 /2003 variables (removed 396) and now considering 1607/2003 (removed 396) transitions.
// Phase 1: matrix 1607 rows 1607 cols
[2025-06-05 11:00:00] [INFO ] Computed 161 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:00:01] [INFO ] Implicit Places using invariants in 691 ms returned []
[2025-06-05 11:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:00:02] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-05 11:00:02] [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 1606/3214 variables, and 0 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1607 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1606/3214 variables, and 0 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1607 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Starting structural reductions in LTL mode, iteration 1 : 1607/2003 places, 1607/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63803 ms. Remains : 1607/2003 places, 1607/2003 transitions.
Support contains 147 out of 1607 places after structural reductions.
[2025-06-05 11:01:03] [INFO ] Flatten gal took : 113 ms
[2025-06-05 11:01:03] [INFO ] Flatten gal took : 68 ms
[2025-06-05 11:01:03] [INFO ] Input system was already deterministic with 1607 transitions.
RANDOM walk for 40000 steps (8 resets) in 2036 ms. (19 steps per ms) remains 45/95 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
[2025-06-05 11:01:04] [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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 662/744 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 863/1607 variables, 96/161 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1607 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1607/3214 variables, 1607/1768 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3214 variables, 0/1768 constraints. Problems are: Problem set: 1 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3214/3214 variables, and 1768 constraints, problems are : Problem set: 1 solved, 44 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1607/1607 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 44 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 647/727 variables, 63/63 constraints. Problems are: Problem set: 1 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:10] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:10] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:10] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:10] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/727 variables, 4/67 constraints. Problems are: Problem set: 1 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:11] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:11] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/727 variables, 2/69 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/727 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 880/1607 variables, 98/167 constraints. Problems are: Problem set: 1 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:13] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:13] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:13] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:13] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:13] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:14] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:14] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:14] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:14] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:14] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1607/3214 variables, and 177 constraints, problems are : Problem set: 1 solved, 44 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/1607 constraints, PredecessorRefiner: 0/45 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10053ms problems are : Problem set: 1 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 1607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 1607 transition count 1209
Reduce places removed 398 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 410 rules applied. Total rules applied 808 place count 1209 transition count 1197
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 820 place count 1197 transition count 1197
Performed 268 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 268 Pre rules applied. Total rules applied 820 place count 1197 transition count 929
Deduced a syphon composed of 268 places in 1 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1356 place count 929 transition count 929
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1370 place count 915 transition count 915
Iterating global reduction 3 with 14 rules applied. Total rules applied 1384 place count 915 transition count 915
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1384 place count 915 transition count 902
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1410 place count 902 transition count 902
Performed 365 Post agglomeration using F-continuation condition.Transition count delta: 365
Deduced a syphon composed of 365 places in 1 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 3 with 730 rules applied. Total rules applied 2140 place count 537 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2141 place count 537 transition count 536
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2143 place count 536 transition count 535
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2345 place count 435 transition count 608
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2349 place count 433 transition count 609
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2350 place count 433 transition count 608
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 2357 place count 433 transition count 601
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2364 place count 426 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 2369 place count 426 transition count 596
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2370 place count 426 transition count 596
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2371 place count 425 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2372 place count 424 transition count 595
Applied a total of 2372 rules in 296 ms. Remains 424 /1607 variables (removed 1183) and now considering 595/1607 (removed 1012) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 424/1607 places, 595/1607 transitions.
RANDOM walk for 40000 steps (8 resets) in 511 ms. (78 steps per ms) remains 36/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
// Phase 1: matrix 595 rows 424 cols
[2025-06-05 11:01:15] [INFO ] Computed 160 invariants in 5 ms
[2025-06-05 11:01:15] [INFO ] State equation strengthened by 11 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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 137/207 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 376/583 variables, 207/263 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 334/917 variables, 161/431 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 75/506 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/917 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 7/924 variables, 5/515 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/924 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/924 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 88/1012 variables, 47/566 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1012 variables, 21/587 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1012 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 16 (OVERLAPS) 1/1013 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1013 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1013 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 19 (OVERLAPS) 6/1019 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1019 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1019 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 22 (OVERLAPS) 0/1019 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 595 constraints, problems are : Problem set: 0 solved, 36 unsolved in 3219 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 424/424 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 137/207 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:19] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 376/583 variables, 207/264 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 15/286 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 334/917 variables, 161/447 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 75/522 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/917 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/917 variables, 21/547 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:20] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/917 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:21] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/917 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/917 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 15 (OVERLAPS) 7/924 variables, 5/554 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/924 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/924 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 18 (OVERLAPS) 88/1012 variables, 47/605 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 21/626 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 21 (OVERLAPS) 1/1013 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1013 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1013 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 24 (OVERLAPS) 6/1019 variables, 4/632 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1019 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1019 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 27 (OVERLAPS) 0/1019 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 634 constraints, problems are : Problem set: 0 solved, 36 unsolved in 12988 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 424/424 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16222ms problems are : Problem set: 0 solved, 36 unsolved
Fused 36 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 3175 ms.
Support contains 70 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 595/595 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 424 transition count 593
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 422 transition count 593
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 422 transition count 589
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 418 transition count 589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 417 transition count 588
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 417 transition count 588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 415 transition count 586
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 412 transition count 590
Applied a total of 24 rules in 30 ms. Remains 412 /424 variables (removed 12) and now considering 590/595 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 412/424 places, 590/595 transitions.
RANDOM walk for 40000 steps (9 resets) in 402 ms. (99 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 157702 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :1 out of 36
Probabilistic random walk after 157702 steps, saw 108266 distinct states, run finished after 3005 ms. (steps per millisecond=52 ) properties seen :1
// Phase 1: matrix 590 rows 412 cols
[2025-06-05 11:01:38] [INFO ] Computed 160 invariants in 2 ms
[2025-06-05 11:01:38] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 132/201 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 370/571 variables, 201/256 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 329/900 variables, 156/420 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 77/497 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/900 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 1/901 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 95/996 variables, 50/553 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/996 variables, 25/578 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/996 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 6/1002 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1002 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1002 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (OVERLAPS) 0/1002 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 584 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 412/412 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 132/201 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 370/571 variables, 201/257 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 329/900 variables, 156/435 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/900 variables, 77/512 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/900 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 21/537 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:01:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/900 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 1/901 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/901 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/901 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (OVERLAPS) 95/996 variables, 50/591 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/996 variables, 25/616 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/996 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 6/1002 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1002 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1002 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (OVERLAPS) 0/1002 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 622 constraints, problems are : Problem set: 0 solved, 35 unsolved in 9990 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 412/412 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12728ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 3894 ms.
Support contains 69 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 412 transition count 589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 411 transition count 589
Applied a total of 2 rules in 11 ms. Remains 411 /412 variables (removed 1) and now considering 589/590 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 411/412 places, 589/590 transitions.
RANDOM walk for 40000 steps (13 resets) in 397 ms. (100 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 150303 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 32
Probabilistic random walk after 150303 steps, saw 103258 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 589 rows 411 cols
[2025-06-05 11:01:58] [INFO ] Computed 160 invariants in 6 ms
[2025-06-05 11:01:58] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 122/184 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 340/524 variables, 184/234 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 336/860 variables, 154/392 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/860 variables, 76/468 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/860 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/860 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 126/986 variables, 63/539 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/986 variables, 29/568 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 4/990 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 10/1000 variables, 10/580 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1000 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1000 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (OVERLAPS) 0/1000 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 583 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 411/411 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 122/184 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:00] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 340/524 variables, 184/235 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 13/252 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 336/860 variables, 154/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/860 variables, 76/482 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 19/509 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 126/986 variables, 63/572 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/986 variables, 29/601 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/986 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 4/990 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:04] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/990 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/990 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 10/1000 variables, 10/614 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1000 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1000 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 22 (OVERLAPS) 0/1000 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 617 constraints, problems are : Problem set: 0 solved, 32 unsolved in 8356 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 411/411 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10692ms problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2330 ms.
Support contains 62 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 589/589 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 411 transition count 583
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 405 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 403 transition count 581
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 402 transition count 583
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 402 transition count 583
Applied a total of 19 rules in 27 ms. Remains 402 /411 variables (removed 9) and now considering 583/589 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 402/411 places, 583/589 transitions.
RANDOM walk for 40000 steps (12 resets) in 471 ms. (84 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 180205 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :7 out of 31
Probabilistic random walk after 180205 steps, saw 118063 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :7
// Phase 1: matrix 583 rows 402 cols
[2025-06-05 11:02:14] [INFO ] Computed 160 invariants in 2 ms
[2025-06-05 11:02:14] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 94/141 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 247/388 variables, 141/179 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 275/663 variables, 114/297 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 55/352 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 2/665 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/665 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/665 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 176/841 variables, 74/438 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/841 variables, 34/472 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/841 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 3/844 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/844 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/844 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 90/934 variables, 43/518 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/934 variables, 16/534 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/934 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 3/937 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/937 variables, 3/540 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/937 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (OVERLAPS) 29/966 variables, 13/553 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/966 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/966 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 3/969 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/969 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/969 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (OVERLAPS) 13/982 variables, 8/568 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/982 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/982 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (OVERLAPS) 3/985 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/985 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/985 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 37 (OVERLAPS) 0/985 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 574 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 402/402 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 94/141 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 247/388 variables, 141/180 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 9/193 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 275/663 variables, 114/307 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 55/362 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 15/385 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:19] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:19] [INFO ] Deduced a trap along path composed of 2 places in 12 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 2/665 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 176/841 variables, 74/465 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/841 variables, 34/499 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:20] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/841 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/841 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 3/844 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/844 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/844 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (OVERLAPS) 90/934 variables, 43/546 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/934 variables, 16/562 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/934 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (OVERLAPS) 3/937 variables, 3/565 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/937 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:24] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/937 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/937 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (OVERLAPS) 29/966 variables, 13/582 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/966 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/966 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (OVERLAPS) 3/969 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/969 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/969 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 37 (OVERLAPS) 13/982 variables, 8/597 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/982 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/982 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 40 (OVERLAPS) 3/985 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/985 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/985 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 43 (OVERLAPS) 0/985 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 603 constraints, problems are : Problem set: 0 solved, 24 unsolved in 12748 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 402/402 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 15928ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 1601 ms.
Support contains 47 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 583/583 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 0 with 4 rules applied. Total rules applied 4 place count 402 transition count 579
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 398 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 397 transition count 578
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 10 place count 397 transition count 571
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 24 place count 390 transition count 571
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 389 transition count 570
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 389 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 389 transition count 569
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 388 transition count 569
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 3 with 2 rules applied. Total rules applied 30 place count 387 transition count 568
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 384 transition count 572
Applied a total of 36 rules in 29 ms. Remains 384 /402 variables (removed 18) and now considering 572/583 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 384/402 places, 572/583 transitions.
RANDOM walk for 40000 steps (18 resets) in 424 ms. (94 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 156901 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :1 out of 24
Probabilistic random walk after 156901 steps, saw 107268 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :1
// Phase 1: matrix 572 rows 384 cols
[2025-06-05 11:02:35] [INFO ] Computed 160 invariants in 1 ms
[2025-06-05 11:02:35] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 91/136 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 239/375 variables, 136/173 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 263/638 variables, 110/287 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 55/342 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 7/349 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 176/814 variables, 74/423 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/814 variables, 36/459 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/814 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/814 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 2/816 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/816 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 94/910 variables, 42/503 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/910 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/910 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 29/939 variables, 14/537 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/939 variables, 7/544 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/939 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 14/953 variables, 6/550 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/953 variables, 3/553 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/953 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (OVERLAPS) 3/956 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/956 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/956 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 0/956 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 956/956 variables, and 556 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2276 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 384/384 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 91/136 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:38] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 239/375 variables, 136/174 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 9/187 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 263/638 variables, 110/297 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 55/352 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 7/359 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 14/373 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:02:38] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/638 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 176/814 variables, 74/448 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/814 variables, 36/484 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/814 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/814 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 2/816 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/816 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 94/910 variables, 42/528 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/910 variables, 20/548 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/910 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (OVERLAPS) 29/939 variables, 14/562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/939 variables, 7/569 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/939 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 14/953 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/953 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/953 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (OVERLAPS) 3/956 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/956 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/956 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (OVERLAPS) 0/956 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 956/956 variables, and 581 constraints, problems are : Problem set: 0 solved, 23 unsolved in 7841 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 384/384 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10127ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1010 ms.
Support contains 45 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 384 transition count 571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 383 transition count 571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 382 transition count 571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 381 transition count 570
Applied a total of 5 rules in 25 ms. Remains 381 /384 variables (removed 3) and now considering 570/572 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 381/384 places, 570/572 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-05 11:02:46] [INFO ] Flatten gal took : 49 ms
[2025-06-05 11:02:46] [INFO ] Flatten gal took : 47 ms
[2025-06-05 11:02:46] [INFO ] Input system was already deterministic with 1607 transitions.
Computed a total of 491 stabilizing places and 491 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1565 transition count 1565
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1565 transition count 1565
Applied a total of 84 rules in 137 ms. Remains 1565 /1607 variables (removed 42) and now considering 1565/1607 (removed 42) transitions.
// Phase 1: matrix 1565 rows 1565 cols
[2025-06-05 11:02:47] [INFO ] Computed 161 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:02:47] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-05 11:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:02:48] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2025-06-05 11:02:48] [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 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 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 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in LTL mode, iteration 1 : 1565/1607 places, 1565/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62027 ms. Remains : 1565/1607 places, 1565/1607 transitions.
[2025-06-05 11:03:49] [INFO ] Flatten gal took : 47 ms
[2025-06-05 11:03:49] [INFO ] Flatten gal took : 37 ms
[2025-06-05 11:03:49] [INFO ] Input system was already deterministic with 1565 transitions.
[2025-06-05 11:03:49] [INFO ] Flatten gal took : 33 ms
[2025-06-05 11:03:49] [INFO ] Flatten gal took : 34 ms
[2025-06-05 11:03:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15167893691925775320.gal : 21 ms
[2025-06-05 11:03:49] [INFO ] Time to serialize properties into /tmp/CTLFireability18366416511313485578.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/CTLFireability15167893691925775320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18366416511313485578.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.
Detected timeout of ITS tools.
[2025-06-05 11:04:19] [INFO ] Flatten gal took : 33 ms
[2025-06-05 11:04:19] [INFO ] Applying decomposition
[2025-06-05 11:04:19] [INFO ] Flatten gal took : 34 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/graph9864891815641879125.txt' '-o' '/tmp/graph9864891815641879125.bin' '-w' '/tmp/graph9864891815641879125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9864891815641879125.bin' '-l' '-1' '-v' '-w' '/tmp/graph9864891815641879125.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:04:19] [INFO ] Decomposing Gal with order
[2025-06-05 11:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:04:20] [INFO ] Removed a total of 392 redundant transitions.
[2025-06-05 11:04:20] [INFO ] Flatten gal took : 193 ms
[2025-06-05 11:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-06-05 11:04:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3052538667167647533.gal : 26 ms
[2025-06-05 11:04:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7884890328918690563.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/CTLFireability3052538667167647533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7884890328918690563.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 1606 transition count 1166
Reduce places removed 440 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 443 rules applied. Total rules applied 883 place count 1166 transition count 1163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 886 place count 1163 transition count 1163
Performed 291 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 291 Pre rules applied. Total rules applied 886 place count 1163 transition count 872
Deduced a syphon composed of 291 places in 1 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 3 with 582 rules applied. Total rules applied 1468 place count 872 transition count 872
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1503 place count 837 transition count 837
Iterating global reduction 3 with 35 rules applied. Total rules applied 1538 place count 837 transition count 837
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1538 place count 837 transition count 806
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1600 place count 806 transition count 806
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2226 place count 493 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 493 transition count 492
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2229 place count 492 transition count 491
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2231 place count 490 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2232 place count 489 transition count 489
Applied a total of 2232 rules in 156 ms. Remains 489 /1607 variables (removed 1118) and now considering 489/1607 (removed 1118) transitions.
// Phase 1: matrix 489 rows 489 cols
[2025-06-05 11:04:50] [INFO ] Computed 160 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:04:50] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-06-05 11:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:04:51] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:04:51] [INFO ] Redundant transitions in 34 ms returned []
Running 483 sub problems to find dead transitions.
[2025-06-05 11:04:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 5/489 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 489/978 variables, 489/649 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 649 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 5/489 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 489/978 variables, 489/649 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 483/1132 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:05:43] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:05:43] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1134 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 483 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_CTL mode, iteration 1 : 489/1607 places, 489/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61133 ms. Remains : 489/1607 places, 489/1607 transitions.
[2025-06-05 11:05:51] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:05:51] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:05:51] [INFO ] Input system was already deterministic with 489 transitions.
[2025-06-05 11:05:51] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:05:51] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:05:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11529078370397883778.gal : 2 ms
[2025-06-05 11:05:51] [INFO ] Time to serialize properties into /tmp/CTLFireability10202768865648203274.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/CTLFireability11529078370397883778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10202768865648203274.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,5.11472e+76,0.293249,13944,2,1312,5,38867,6,0,2445,51288,0


Converting to forward existential form...Done !
original formula: EF((((p291==0) * EG((EG((((p1766==1)&&(p1820==1))&&(p1854==1))) * (p1857==0)))) * ((p1648==1) + AF((p456==0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p291==0) * EG((EG((((p1766==1)&&(p1820==1))&&(p1854==1))) * (p1857==0))))) * (p1648==1))...299
Reverse transition relation is NOT exact ! Due to transitions t14, t16, t18, t20, t23, t26, t29, t31, t33, t36, t39, t41, t44, t46, t48, t50, t53, t57, t60...1043
Detected timeout of ITS tools.
[2025-06-05 11:06:21] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:06:21] [INFO ] Applying decomposition
[2025-06-05 11:06:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10395323148952998265.txt' '-o' '/tmp/graph10395323148952998265.bin' '-w' '/tmp/graph10395323148952998265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10395323148952998265.bin' '-l' '-1' '-v' '-w' '/tmp/graph10395323148952998265.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:06:21] [INFO ] Decomposing Gal with order
[2025-06-05 11:06:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:06:21] [INFO ] Removed a total of 119 redundant transitions.
[2025-06-05 11:06:21] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:06:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 11:06:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1780475653724040030.gal : 4 ms
[2025-06-05 11:06:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13087192273267292483.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/CTLFireability1780475653724040030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13087192273267292483.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,5.11472e+76,0.141234,8840,169,15,8385,113,547,16641,40,245,0


Converting to forward existential form...Done !
original formula: EF((((i3.u21.p291==0) * EG((EG((((i20.i0.u144.p1766==1)&&(i20.i2.u148.p1820==1))&&(i20.i2.u151.p1854==1))) * (i21.u152.p1857==0)))) * ((i...201
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((i3.u21.p291==0) * EG((EG((((i20.i0.u144.p1766==1)&&(i20.i2.u148.p1820==1))&&(i20.i2.u151...422
Reverse transition relation is NOT exact ! Due to transitions t349, i0.u1.t18, i0.u2.t20, i0.u3.t23, i0.u4.t26, i1.i0.u5.t29, i1.i0.u6.t31, i1.i0.u7.t33, i...2598
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 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1564 transition count 1564
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1564 transition count 1564
Applied a total of 86 rules in 143 ms. Remains 1564 /1607 variables (removed 43) and now considering 1564/1607 (removed 43) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2025-06-05 11:06:51] [INFO ] Computed 161 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:06:52] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-05 11:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:06:53] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2025-06-05 11:06:53] [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 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 1564/1607 places, 1564/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61906 ms. Remains : 1564/1607 places, 1564/1607 transitions.
[2025-06-05 11:07:53] [INFO ] Flatten gal took : 25 ms
[2025-06-05 11:07:53] [INFO ] Flatten gal took : 25 ms
[2025-06-05 11:07:53] [INFO ] Input system was already deterministic with 1564 transitions.
[2025-06-05 11:07:53] [INFO ] Flatten gal took : 26 ms
[2025-06-05 11:07:53] [INFO ] Flatten gal took : 25 ms
[2025-06-05 11:07:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13713664115237252810.gal : 5 ms
[2025-06-05 11:07:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9265885673876065187.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/CTLFireability13713664115237252810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9265885673876065187.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.
Detected timeout of ITS tools.
[2025-06-05 11:08:24] [INFO ] Flatten gal took : 33 ms
[2025-06-05 11:08:24] [INFO ] Applying decomposition
[2025-06-05 11:08:24] [INFO ] Flatten gal took : 26 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/graph512098759594398498.txt' '-o' '/tmp/graph512098759594398498.bin' '-w' '/tmp/graph512098759594398498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph512098759594398498.bin' '-l' '-1' '-v' '-w' '/tmp/graph512098759594398498.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:08:24] [INFO ] Decomposing Gal with order
[2025-06-05 11:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:08:24] [INFO ] Removed a total of 400 redundant transitions.
[2025-06-05 11:08:24] [INFO ] Flatten gal took : 58 ms
[2025-06-05 11:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-05 11:08:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9636149349652065501.gal : 19 ms
[2025-06-05 11:08:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16980591011494229569.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/CTLFireability9636149349652065501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16980591011494229569.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 1606 transition count 1166
Reduce places removed 440 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 442 rules applied. Total rules applied 882 place count 1166 transition count 1164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 884 place count 1164 transition count 1164
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 290 Pre rules applied. Total rules applied 884 place count 1164 transition count 874
Deduced a syphon composed of 290 places in 1 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 3 with 580 rules applied. Total rules applied 1464 place count 874 transition count 874
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1496 place count 842 transition count 842
Iterating global reduction 3 with 32 rules applied. Total rules applied 1528 place count 842 transition count 842
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1528 place count 842 transition count 813
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1586 place count 813 transition count 813
Performed 317 Post agglomeration using F-continuation condition.Transition count delta: 317
Deduced a syphon composed of 317 places in 1 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 2220 place count 496 transition count 496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2221 place count 496 transition count 495
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2223 place count 495 transition count 494
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2225 place count 493 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2226 place count 492 transition count 492
Applied a total of 2226 rules in 211 ms. Remains 492 /1607 variables (removed 1115) and now considering 492/1607 (removed 1115) transitions.
// Phase 1: matrix 492 rows 492 cols
[2025-06-05 11:08:54] [INFO ] Computed 160 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:08:54] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-06-05 11:08:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:08:55] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:08:55] [INFO ] Redundant transitions in 3 ms returned []
Running 487 sub problems to find dead transitions.
[2025-06-05 11:08:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 4/492 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (OVERLAPS) 492/984 variables, 492/652 constraints. Problems are: Problem set: 0 solved, 487 unsolved
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 984/984 variables, and 652 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 4/492 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (OVERLAPS) 492/984 variables, 492/652 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 487/1139 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:09:46] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:09:46] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1141 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in SI_CTL mode, iteration 1 : 492/1607 places, 492/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60868 ms. Remains : 492/1607 places, 492/1607 transitions.
[2025-06-05 11:09:55] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:09:55] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:09:55] [INFO ] Input system was already deterministic with 492 transitions.
[2025-06-05 11:09:55] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:09:55] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:09:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12769050667984984663.gal : 3 ms
[2025-06-05 11:09:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2024740984096961787.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/CTLFireability12769050667984984663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2024740984096961787.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,3.03095e+77,0.288693,13404,2,1308,5,37236,6,0,2461,47753,0


Converting to forward existential form...Done !
original formula: (EG(AG(AF((((((p568==1)&&(p580==1))&&(p612==1))||(p464==1))&&(p523==1))))) * E((E((AF((p1068==1)) + (p1263==1)) U (p166==1)) + (p1098!=1)...171
=> equivalent forward existential formula: [(FwdU((Init * EG(!(E(TRUE U !(!(EG(!((((((p568==1)&&(p580==1))&&(p612==1))||(p464==1))&&(p523==1)))))))))),(E((...241
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t10, t12, t22, t25, t27, t30, t33, t36, t38, t41, t43, t46, t48, t51, t53, t55, t57, ...679
Detected timeout of ITS tools.
[2025-06-05 11:10:25] [INFO ] Flatten gal took : 16 ms
[2025-06-05 11:10:25] [INFO ] Applying decomposition
[2025-06-05 11:10:25] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10305174266270521479.txt' '-o' '/tmp/graph10305174266270521479.bin' '-w' '/tmp/graph10305174266270521479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10305174266270521479.bin' '-l' '-1' '-v' '-w' '/tmp/graph10305174266270521479.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:10:25] [INFO ] Decomposing Gal with order
[2025-06-05 11:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:10:25] [INFO ] Removed a total of 119 redundant transitions.
[2025-06-05 11:10:25] [INFO ] Flatten gal took : 16 ms
[2025-06-05 11:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 11:10:25] [INFO ] Time to serialize gal into /tmp/CTLFireability196336300068096447.gal : 3 ms
[2025-06-05 11:10:25] [INFO ] Time to serialize properties into /tmp/CTLFireability1037684852093426931.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/CTLFireability196336300068096447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1037684852093426931.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,3.03095e+77,0.180207,10756,246,23,13537,160,519,21346,49,382,0


Converting to forward existential form...Done !
original formula: (EG(AG(AF((((((i6.u44.p568==1)&&(i6.u45.p580==1))&&(i7.u49.p612==1))||(i5.u36.p464==1))&&(i5.u41.p523==1))))) * E((E((AF((i12.i0.u87.p106...253
=> equivalent forward existential formula: [(FwdU((Init * EG(!(E(TRUE U !(!(EG(!((((((i6.u44.p568==1)&&(i6.u45.p580==1))&&(i7.u49.p612==1))||(i5.u36.p464==...323
Reverse transition relation is NOT exact ! Due to transitions t244, i0.u1.t25, i0.u2.t27, i0.u3.t30, i0.u4.t33, i0.u5.t36, i0.u6.t38, i0.u7.t41, i0.u8.t43,...1351
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 1606 transition count 1166
Reduce places removed 440 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 442 rules applied. Total rules applied 882 place count 1166 transition count 1164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 884 place count 1164 transition count 1164
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 884 place count 1164 transition count 870
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1472 place count 870 transition count 870
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1504 place count 838 transition count 838
Iterating global reduction 3 with 32 rules applied. Total rules applied 1536 place count 838 transition count 838
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1536 place count 838 transition count 810
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1592 place count 810 transition count 810
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2218 place count 497 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2219 place count 497 transition count 496
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2221 place count 496 transition count 495
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2224 place count 496 transition count 495
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2226 place count 494 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2227 place count 493 transition count 493
Applied a total of 2227 rules in 157 ms. Remains 493 /1607 variables (removed 1114) and now considering 493/1607 (removed 1114) transitions.
// Phase 1: matrix 493 rows 493 cols
[2025-06-05 11:10:55] [INFO ] Computed 160 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:10:56] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-05 11:10:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:10:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 11:10:56] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:10:56] [INFO ] Redundant transitions in 2 ms returned []
Running 489 sub problems to find dead transitions.
[2025-06-05 11:10:56] [INFO ] Invariant cache hit.
[2025-06-05 11:10:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 3/493 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (OVERLAPS) 493/986 variables, 493/654 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 655 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 493/493 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 3/493 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (OVERLAPS) 493/986 variables, 493/654 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 489/1144 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:44] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:44] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:45] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:45] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 4/1148 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1148 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 493/493 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 493/1607 places, 493/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60929 ms. Remains : 493/1607 places, 493/1607 transitions.
[2025-06-05 11:11:56] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:11:56] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:11:56] [INFO ] Input system was already deterministic with 493 transitions.
[2025-06-05 11:11:56] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:11:56] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:11:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4647104496556789782.gal : 2 ms
[2025-06-05 11:11:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17809505938053193037.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/CTLFireability4647104496556789782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17809505938053193037.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,2.29005e+77,0.306725,14980,2,1201,5,42750,6,0,2465,58447,0


Converting to forward existential form...Done !
original formula: E(EF(((p905==1) + A((p1418==1) U ((p1253!=1)&&((p452==1)||(p554==1)))))) U !(((p718!=1) * ((p643==1) + AF(((((p256==1)||(p1729==1))&&(p48...179
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U ((p905==1) + !((E(!(((p1253!=1)&&((p452==1)||(p554==1)))) U (!((p1418==1)) * !(((p1253!=1)...540
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t7, t9, t10, t21, t23, t26, t29, t32, t34, t37, t39, t42, t44, t47, t49, t51, t53...825
Detected timeout of ITS tools.
[2025-06-05 11:12:26] [INFO ] Flatten gal took : 15 ms
[2025-06-05 11:12:26] [INFO ] Applying decomposition
[2025-06-05 11:12:26] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13126657128239478986.txt' '-o' '/tmp/graph13126657128239478986.bin' '-w' '/tmp/graph13126657128239478986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13126657128239478986.bin' '-l' '-1' '-v' '-w' '/tmp/graph13126657128239478986.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:12:26] [INFO ] Decomposing Gal with order
[2025-06-05 11:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:12:26] [INFO ] Removed a total of 119 redundant transitions.
[2025-06-05 11:12:26] [INFO ] Flatten gal took : 19 ms
[2025-06-05 11:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-05 11:12:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15600456819066820247.gal : 3 ms
[2025-06-05 11:12:26] [INFO ] Time to serialize properties into /tmp/CTLFireability570649631840391415.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/CTLFireability15600456819066820247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability570649631840391415.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,2.29005e+77,0.173635,10260,180,26,11271,185,581,23580,61,569,0


Converting to forward existential form...Done !
original formula: E(EF(((i9.i0.u71.p905==1) + A((i15.i1.u113.p1418==1) U ((i13.u99.p1253!=1)&&((i4.i0.u34.p452==1)||(i5.i0.u42.p554==1)))))) U !(((i6.i1.u5...287
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U ((i9.i0.u71.p905==1) + !((E(!(((i13.u99.p1253!=1)&&((i4.i0.u34.p452==1)||(i5.i0.u42.p554==...810
Reverse transition relation is NOT exact ! Due to transitions t443, i0.i0.u1.t21, i0.i0.u2.t23, i0.i0.u3.t26, i0.i0.u4.t29, i0.i1.u5.t32, i0.i1.u6.t34, i0....1988
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 444 rules applied. Total rules applied 444 place count 1606 transition count 1162
Reduce places removed 444 places and 0 transitions.
Iterating post reduction 1 with 444 rules applied. Total rules applied 888 place count 1162 transition count 1162
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 888 place count 1162 transition count 868
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1476 place count 868 transition count 868
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1512 place count 832 transition count 832
Iterating global reduction 2 with 36 rules applied. Total rules applied 1548 place count 832 transition count 832
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 1548 place count 832 transition count 800
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 1612 place count 800 transition count 800
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 2242 place count 485 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2243 place count 485 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2245 place count 484 transition count 483
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2246 place count 484 transition count 483
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2248 place count 482 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2249 place count 481 transition count 481
Applied a total of 2249 rules in 192 ms. Remains 481 /1607 variables (removed 1126) and now considering 481/1607 (removed 1126) transitions.
// Phase 1: matrix 481 rows 481 cols
[2025-06-05 11:12:57] [INFO ] Computed 160 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:57] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-05 11:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:57] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:12:57] [INFO ] Redundant transitions in 2 ms returned []
Running 480 sub problems to find dead transitions.
[2025-06-05 11:12: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/481 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 481/962 variables, 481/641 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/962 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/962 variables, and 641 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 481/962 variables, 481/641 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/962 variables, 480/1121 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/962 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/962 variables, and 1121 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_CTL mode, iteration 1 : 481/1607 places, 481/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60909 ms. Remains : 481/1607 places, 481/1607 transitions.
[2025-06-05 11:13:57] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:13:57] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:13:57] [INFO ] Input system was already deterministic with 481 transitions.
[2025-06-05 11:13:57] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:13:57] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability18284178041638741660.gal : 2 ms
[2025-06-05 11:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10341728521927514136.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/CTLFireability18284178041638741660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10341728521927514136.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58933e+76,0.262411,12228,2,803,5,32597,6,0,2408,40350,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((p893==1)&&(p1602==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((p893==1)&&(p1602==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 477/0/4
Detected timeout of ITS tools.
[2025-06-05 11:14:27] [INFO ] Flatten gal took : 16 ms
[2025-06-05 11:14:27] [INFO ] Applying decomposition
[2025-06-05 11:14:27] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7885054164555307481.txt' '-o' '/tmp/graph7885054164555307481.bin' '-w' '/tmp/graph7885054164555307481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7885054164555307481.bin' '-l' '-1' '-v' '-w' '/tmp/graph7885054164555307481.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:14:28] [INFO ] Decomposing Gal with order
[2025-06-05 11:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:14:28] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 11:14:28] [INFO ] Flatten gal took : 18 ms
[2025-06-05 11:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-06-05 11:14:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17593830066394853440.gal : 3 ms
[2025-06-05 11:14:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1863850263505783057.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/CTLFireability17593830066394853440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1863850263505783057.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58933e+76,0.128901,8004,45,8,5997,89,437,10667,38,162,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((i9.i0.u70.p893==1)&&(i17.u128.p1602==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((i9.i0.u70.p893==1)&&(i17.u128.p1602==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 444 rules applied. Total rules applied 444 place count 1606 transition count 1162
Reduce places removed 444 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 445 rules applied. Total rules applied 889 place count 1162 transition count 1161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 890 place count 1161 transition count 1161
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 890 place count 1161 transition count 868
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1476 place count 868 transition count 868
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1508 place count 836 transition count 836
Iterating global reduction 3 with 32 rules applied. Total rules applied 1540 place count 836 transition count 836
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1540 place count 836 transition count 807
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1598 place count 807 transition count 807
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Deduced a syphon composed of 319 places in 0 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 2236 place count 488 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2237 place count 488 transition count 487
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2239 place count 487 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2241 place count 485 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2242 place count 484 transition count 484
Applied a total of 2242 rules in 140 ms. Remains 484 /1607 variables (removed 1123) and now considering 484/1607 (removed 1123) transitions.
// Phase 1: matrix 484 rows 484 cols
[2025-06-05 11:14:58] [INFO ] Computed 160 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:58] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-05 11:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:58] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:14:58] [INFO ] Redundant transitions in 2 ms returned []
Running 482 sub problems to find dead transitions.
[2025-06-05 11:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (OVERLAPS) 484/968 variables, 484/644 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/968 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 968/968 variables, and 644 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (OVERLAPS) 484/968 variables, 484/644 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/968 variables, 482/1126 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:49] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 1/1127 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 968/968 variables, and 1127 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_CTL mode, iteration 1 : 484/1607 places, 484/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60765 ms. Remains : 484/1607 places, 484/1607 transitions.
[2025-06-05 11:15:58] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:15:58] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:15:58] [INFO ] Input system was already deterministic with 484 transitions.
[2025-06-05 11:15:58] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:15:58] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:15:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8182785105363794095.gal : 2 ms
[2025-06-05 11:15:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8479653035716504692.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/CTLFireability8182785105363794095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8479653035716504692.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,5.75406e+76,0.262768,12744,2,809,5,34150,6,0,2422,43003,0


Converting to forward existential form...Done !
original formula: AG(EF(((AG((p1106==0)) * EF((p1427==0))) * ((p1518==1)&&(p1293==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E(TRUE U !((p1106==0)))) * E(TRUE U (p1427==0))) * ((p1518==1)&&(p1293==1))))...166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.87026,100808,1,0,14,516459,17,6,11393,491470,11
FORMULA ShieldRVt-PT-040B-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 432 place count 1606 transition count 1174
Reduce places removed 432 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 436 rules applied. Total rules applied 868 place count 1174 transition count 1170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 872 place count 1170 transition count 1170
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 872 place count 1170 transition count 876
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1460 place count 876 transition count 876
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1492 place count 844 transition count 844
Iterating global reduction 3 with 32 rules applied. Total rules applied 1524 place count 844 transition count 844
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1524 place count 844 transition count 815
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1582 place count 815 transition count 815
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 0 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 2202 place count 505 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2203 place count 505 transition count 504
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2205 place count 504 transition count 503
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2207 place count 502 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2208 place count 501 transition count 501
Applied a total of 2208 rules in 133 ms. Remains 501 /1607 variables (removed 1106) and now considering 501/1607 (removed 1106) transitions.
// Phase 1: matrix 501 rows 501 cols
[2025-06-05 11:16:01] [INFO ] Computed 160 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:02] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-05 11:16:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:02] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:16:02] [INFO ] Redundant transitions in 2 ms returned []
Running 497 sub problems to find dead transitions.
[2025-06-05 11:16:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 3/501 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 501/1002 variables, 501/661 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 661 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 497 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 3/501 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 501/1002 variables, 501/661 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 497/1158 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:52] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 1/1159 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1159 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in SI_CTL mode, iteration 1 : 501/1607 places, 501/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60801 ms. Remains : 501/1607 places, 501/1607 transitions.
[2025-06-05 11:17:02] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:17:02] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:17:02] [INFO ] Input system was already deterministic with 501 transitions.
[2025-06-05 11:17:02] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:17:02] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:17:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2960535652148539020.gal : 2 ms
[2025-06-05 11:17:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15118155291039709078.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/CTLFireability2960535652148539020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15118155291039709078.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.83738e+77,0.43761,18160,2,2525,5,53196,6,0,2505,78446,0


Converting to forward existential form...Done !
original formula: A(A(!(EG((AF((p804==1)) * (p1127!=1)))) U (E(!(E((p1087==1) U (p518==1))) U E((p75==1) U (((p813==1)&&(p825==1))&&(p857==1)))) + (p1696==...258
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(E(!(E(TRUE U !((p6==1)))) U (p1811!=1)))) U (!(!(EG(!(((EG((p768==1)) + (p1942==1)) + ...1149
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t10, t11, t12, t13, t24, t27, t29, t34, t37, t39, t42, t43, t47, t49, t53, t54, t...1104
Detected timeout of ITS tools.
[2025-06-05 11:17:32] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:17:32] [INFO ] Applying decomposition
[2025-06-05 11:17:32] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9253974224480031921.txt' '-o' '/tmp/graph9253974224480031921.bin' '-w' '/tmp/graph9253974224480031921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9253974224480031921.bin' '-l' '-1' '-v' '-w' '/tmp/graph9253974224480031921.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:17:32] [INFO ] Decomposing Gal with order
[2025-06-05 11:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:17:32] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-05 11:17:32] [INFO ] Flatten gal took : 17 ms
[2025-06-05 11:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 11:17:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5536683378534090189.gal : 4 ms
[2025-06-05 11:17:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3547100165083137469.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/CTLFireability5536683378534090189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3547100165083137469.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,5.83738e+77,0.191856,11272,349,31,12802,210,710,27730,59,507,0


Converting to forward existential form...Done !
original formula: A(A(!(EG((AF((i8.i1.u64.p804==1)) * (i13.i0.u93.p1127!=1)))) U (E(!(E((i12.i0.u88.p1087==1) U (i5.u40.p518==1))) U E((i0.u4.p75==1) U (((...410
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(E(!(E(TRUE U !((i19.i0.u0.p6==1)))) U (i20.i0.u150.p1811!=1)))) U (!(!(EG(!(((EG((i8.i...1695
Reverse transition relation is NOT exact ! Due to transitions t189, t373, i0.u2.t27, i0.u3.t29, i0.u4.t13, i0.u5.t34, i1.i0.u6.t37, i1.i0.u7.t39, i1.i0.u8....2817
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1566 transition count 1566
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1566 transition count 1566
Applied a total of 82 rules in 131 ms. Remains 1566 /1607 variables (removed 41) and now considering 1566/1607 (removed 41) transitions.
// Phase 1: matrix 1566 rows 1566 cols
[2025-06-05 11:18:03] [INFO ] Computed 161 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:03] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-05 11:18:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:04] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
Running 1565 sub problems to find dead transitions.
[2025-06-05 11:18:04] [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 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1565/3132 variables, and 0 constraints, problems are : Problem set: 0 solved, 1565 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1566 constraints, PredecessorRefiner: 1565/1565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1565 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 1565/3132 variables, and 0 constraints, problems are : Problem set: 0 solved, 1565 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1566 constraints, PredecessorRefiner: 0/1565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 1565 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 1566/1607 places, 1566/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61962 ms. Remains : 1566/1607 places, 1566/1607 transitions.
[2025-06-05 11:19:05] [INFO ] Flatten gal took : 24 ms
[2025-06-05 11:19:05] [INFO ] Flatten gal took : 24 ms
[2025-06-05 11:19:05] [INFO ] Input system was already deterministic with 1566 transitions.
[2025-06-05 11:19:05] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:19:05] [INFO ] Flatten gal took : 24 ms
[2025-06-05 11:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14555137011642264783.gal : 5 ms
[2025-06-05 11:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12305142260994083416.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/CTLFireability14555137011642264783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12305142260994083416.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.
Detected timeout of ITS tools.
[2025-06-05 11:19:35] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:19:35] [INFO ] Applying decomposition
[2025-06-05 11:19:35] [INFO ] Flatten gal took : 23 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/graph12579964970351024424.txt' '-o' '/tmp/graph12579964970351024424.bin' '-w' '/tmp/graph12579964970351024424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12579964970351024424.bin' '-l' '-1' '-v' '-w' '/tmp/graph12579964970351024424.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:19:35] [INFO ] Decomposing Gal with order
[2025-06-05 11:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:19:35] [INFO ] Removed a total of 396 redundant transitions.
[2025-06-05 11:19:35] [INFO ] Flatten gal took : 66 ms
[2025-06-05 11:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 11:19:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2378153463922288989.gal : 12 ms
[2025-06-05 11:19:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3044284321992465526.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/CTLFireability2378153463922288989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3044284321992465526.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 443 rules applied. Total rules applied 443 place count 1606 transition count 1163
Reduce places removed 443 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 444 rules applied. Total rules applied 887 place count 1163 transition count 1162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 888 place count 1162 transition count 1162
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 888 place count 1162 transition count 868
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1476 place count 868 transition count 868
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1512 place count 832 transition count 832
Iterating global reduction 3 with 36 rules applied. Total rules applied 1548 place count 832 transition count 832
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 1548 place count 832 transition count 800
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1612 place count 800 transition count 800
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2238 place count 487 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2239 place count 487 transition count 486
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2241 place count 486 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2243 place count 484 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2244 place count 483 transition count 483
Applied a total of 2244 rules in 132 ms. Remains 483 /1607 variables (removed 1124) and now considering 483/1607 (removed 1124) transitions.
// Phase 1: matrix 483 rows 483 cols
[2025-06-05 11:20:05] [INFO ] Computed 160 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:20:05] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-05 11:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:20:06] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:20:06] [INFO ] Redundant transitions in 2 ms returned []
Running 481 sub problems to find dead transitions.
[2025-06-05 11:20: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/482 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 13/160 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 483/966 variables, 483/643 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/966 variables, and 643 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 13/160 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 483/966 variables, 483/643 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/966 variables, 481/1124 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:20:57] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/966 variables, and 1125 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in SI_CTL mode, iteration 1 : 483/1607 places, 483/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60771 ms. Remains : 483/1607 places, 483/1607 transitions.
[2025-06-05 11:21:06] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:21:06] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:21:06] [INFO ] Input system was already deterministic with 483 transitions.
[2025-06-05 11:21:06] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:21:06] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability539323964633765622.gal : 1 ms
[2025-06-05 11:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17868811157158326843.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/CTLFireability539323964633765622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17868811157158326843.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,2.58948e+76,0.278224,13776,2,867,5,38138,6,0,2417,50194,0


Converting to forward existential form...Done !
original formula: EG(AG(E(EF((p38==1)) U ((p1704==1)&&(p135==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(E(TRUE U (p38==1)) U ((p1704==1)&&(p135==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.04695,36852,1,0,12,229406,24,4,12264,50194,13
FORMULA ShieldRVt-PT-040B-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1565 transition count 1565
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1565 transition count 1565
Applied a total of 84 rules in 134 ms. Remains 1565 /1607 variables (removed 42) and now considering 1565/1607 (removed 42) transitions.
// Phase 1: matrix 1565 rows 1565 cols
[2025-06-05 11:21:07] [INFO ] Computed 161 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:08] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-06-05 11:21:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:09] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2025-06-05 11:21:09] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 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 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Starting structural reductions in LTL mode, iteration 1 : 1565/1607 places, 1565/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61878 ms. Remains : 1565/1607 places, 1565/1607 transitions.
[2025-06-05 11:22:09] [INFO ] Flatten gal took : 28 ms
[2025-06-05 11:22:09] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:22:09] [INFO ] Input system was already deterministic with 1565 transitions.
[2025-06-05 11:22:09] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:22:09] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:22:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8571190434414185228.gal : 4 ms
[2025-06-05 11:22:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7164834742622577592.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/CTLFireability8571190434414185228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7164834742622577592.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.
Detected timeout of ITS tools.
[2025-06-05 11:22:39] [INFO ] Flatten gal took : 28 ms
[2025-06-05 11:22:39] [INFO ] Applying decomposition
[2025-06-05 11:22:39] [INFO ] Flatten gal took : 23 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/graph8125151358795099764.txt' '-o' '/tmp/graph8125151358795099764.bin' '-w' '/tmp/graph8125151358795099764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8125151358795099764.bin' '-l' '-1' '-v' '-w' '/tmp/graph8125151358795099764.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:22:39] [INFO ] Decomposing Gal with order
[2025-06-05 11:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:22:39] [INFO ] Removed a total of 395 redundant transitions.
[2025-06-05 11:22:39] [INFO ] Flatten gal took : 49 ms
[2025-06-05 11:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 11:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3639325643820153929.gal : 11 ms
[2025-06-05 11:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability756056286184911185.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/CTLFireability3639325643820153929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability756056286184911185.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1562 transition count 1562
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1562 transition count 1562
Applied a total of 90 rules in 152 ms. Remains 1562 /1607 variables (removed 45) and now considering 1562/1607 (removed 45) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2025-06-05 11:23:10] [INFO ] Computed 161 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:10] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 11:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:11] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2025-06-05 11:23:11] [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 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 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 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1607 places, 1562/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61889 ms. Remains : 1562/1607 places, 1562/1607 transitions.
[2025-06-05 11:24:11] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:24:11] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:24:11] [INFO ] Input system was already deterministic with 1562 transitions.
[2025-06-05 11:24:11] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:24:12] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:24:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6451053443855017123.gal : 4 ms
[2025-06-05 11:24:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9921300650291359452.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/CTLFireability6451053443855017123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9921300650291359452.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.
Detected timeout of ITS tools.
[2025-06-05 11:24:42] [INFO ] Flatten gal took : 25 ms
[2025-06-05 11:24:42] [INFO ] Applying decomposition
[2025-06-05 11:24:42] [INFO ] Flatten gal took : 35 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/graph8847805309354743471.txt' '-o' '/tmp/graph8847805309354743471.bin' '-w' '/tmp/graph8847805309354743471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8847805309354743471.bin' '-l' '-1' '-v' '-w' '/tmp/graph8847805309354743471.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:24:42] [INFO ] Decomposing Gal with order
[2025-06-05 11:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:24:42] [INFO ] Removed a total of 401 redundant transitions.
[2025-06-05 11:24:42] [INFO ] Flatten gal took : 44 ms
[2025-06-05 11:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 11:24:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4615499411839800908.gal : 10 ms
[2025-06-05 11:24:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2699643592890290363.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/CTLFireability4615499411839800908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2699643592890290363.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 444 rules applied. Total rules applied 444 place count 1606 transition count 1162
Reduce places removed 444 places and 0 transitions.
Iterating post reduction 1 with 444 rules applied. Total rules applied 888 place count 1162 transition count 1162
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 295 Pre rules applied. Total rules applied 888 place count 1162 transition count 867
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1478 place count 867 transition count 867
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1514 place count 831 transition count 831
Iterating global reduction 2 with 36 rules applied. Total rules applied 1550 place count 831 transition count 831
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 1550 place count 831 transition count 799
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 1614 place count 799 transition count 799
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 2238 place count 487 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2239 place count 487 transition count 486
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 2241 place count 486 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2243 place count 484 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2244 place count 483 transition count 483
Applied a total of 2244 rules in 133 ms. Remains 483 /1607 variables (removed 1124) and now considering 483/1607 (removed 1124) transitions.
// Phase 1: matrix 483 rows 483 cols
[2025-06-05 11:25:12] [INFO ] Computed 160 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:25:12] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 11:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:25:13] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:25:13] [INFO ] Redundant transitions in 2 ms returned []
Running 480 sub problems to find dead transitions.
[2025-06-05 11:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 2/483 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 483/966 variables, 483/644 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/966 variables, and 644 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 2/483 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 483/966 variables, 483/644 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/966 variables, 480/1124 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:59] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/966 variables, 1/1125 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/966 variables, and 1125 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_CTL mode, iteration 1 : 483/1607 places, 483/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60741 ms. Remains : 483/1607 places, 483/1607 transitions.
[2025-06-05 11:26:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:26:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:26:13] [INFO ] Input system was already deterministic with 483 transitions.
[2025-06-05 11:26:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:26:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:26:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16370021090526633360.gal : 2 ms
[2025-06-05 11:26:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4639661431219464359.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/CTLFireability16370021090526633360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4639661431219464359.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,2.42749e+76,0.269508,13140,2,953,5,36027,6,0,2416,45972,0


Converting to forward existential form...Done !
original formula: EF((EF(AG((p215==0))) * (p571==0)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p571==0)),TRUE) * !(E(TRUE U !((p215==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t13, t16, t19, t22, t24, t27, t29, t32, t34, t37, t39, t41, t43, t45, t51, t53, t55,...397
(forward)formula 0,1,2.00403,72852,1,0,907,471635,990,373,15734,279610,979
FORMULA ShieldRVt-PT-040B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1563 transition count 1563
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1563 transition count 1563
Applied a total of 88 rules in 141 ms. Remains 1563 /1607 variables (removed 44) and now considering 1563/1607 (removed 44) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2025-06-05 11:26:15] [INFO ] Computed 161 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:26:15] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 11:26:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:26:16] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 1562 sub problems to find dead transitions.
[2025-06-05 11:26:16] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 1562/1562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 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 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 0/1562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 1563/1607 places, 1563/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61898 ms. Remains : 1563/1607 places, 1563/1607 transitions.
[2025-06-05 11:27:17] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:27:17] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:27:17] [INFO ] Input system was already deterministic with 1563 transitions.
[2025-06-05 11:27:17] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:27:17] [INFO ] Flatten gal took : 36 ms
[2025-06-05 11:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8260137976430977273.gal : 4 ms
[2025-06-05 11:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8700781405230709594.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/CTLFireability8260137976430977273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8700781405230709594.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.
Detected timeout of ITS tools.
[2025-06-05 11:27:47] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:27:47] [INFO ] Applying decomposition
[2025-06-05 11:27:47] [INFO ] Flatten gal took : 23 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/graph11794359597007505773.txt' '-o' '/tmp/graph11794359597007505773.bin' '-w' '/tmp/graph11794359597007505773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11794359597007505773.bin' '-l' '-1' '-v' '-w' '/tmp/graph11794359597007505773.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:27:47] [INFO ] Decomposing Gal with order
[2025-06-05 11:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:27:47] [INFO ] Removed a total of 398 redundant transitions.
[2025-06-05 11:27:47] [INFO ] Flatten gal took : 43 ms
[2025-06-05 11:27:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 11:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7033219217350241416.gal : 10 ms
[2025-06-05 11:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11657850737704850272.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/CTLFireability7033219217350241416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11657850737704850272.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1566 transition count 1566
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1566 transition count 1566
Applied a total of 82 rules in 153 ms. Remains 1566 /1607 variables (removed 41) and now considering 1566/1607 (removed 41) transitions.
// Phase 1: matrix 1566 rows 1566 cols
[2025-06-05 11:28:17] [INFO ] Computed 161 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:28:18] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-05 11:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:28:19] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Running 1565 sub problems to find dead transitions.
[2025-06-05 11:28:19] [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 1565/3132 variables, and 0 constraints, problems are : Problem set: 0 solved, 1565 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1566 constraints, PredecessorRefiner: 1565/1565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1565 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 1565/3132 variables, and 0 constraints, problems are : Problem set: 0 solved, 1565 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1566 constraints, PredecessorRefiner: 0/1565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 1565 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 1566/1607 places, 1566/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61908 ms. Remains : 1566/1607 places, 1566/1607 transitions.
[2025-06-05 11:29:19] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:29:19] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:29:19] [INFO ] Input system was already deterministic with 1566 transitions.
[2025-06-05 11:29:19] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:29:19] [INFO ] Flatten gal took : 42 ms
[2025-06-05 11:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11867805861319255817.gal : 5 ms
[2025-06-05 11:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3637520004920385413.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/CTLFireability11867805861319255817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3637520004920385413.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.
Detected timeout of ITS tools.
[2025-06-05 11:29:49] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:29:49] [INFO ] Applying decomposition
[2025-06-05 11:29:49] [INFO ] Flatten gal took : 23 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/graph8065513056612307918.txt' '-o' '/tmp/graph8065513056612307918.bin' '-w' '/tmp/graph8065513056612307918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8065513056612307918.bin' '-l' '-1' '-v' '-w' '/tmp/graph8065513056612307918.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:29:49] [INFO ] Decomposing Gal with order
[2025-06-05 11:29:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:29:50] [INFO ] Removed a total of 395 redundant transitions.
[2025-06-05 11:29:50] [INFO ] Flatten gal took : 45 ms
[2025-06-05 11:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 11:29:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8679509842286427967.gal : 10 ms
[2025-06-05 11:29:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6557994403738828594.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/CTLFireability8679509842286427967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6557994403738828594.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1607/1607 places, 1607/1607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1606 transition count 1169
Reduce places removed 437 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 439 rules applied. Total rules applied 876 place count 1169 transition count 1167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 878 place count 1167 transition count 1167
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 289 Pre rules applied. Total rules applied 878 place count 1167 transition count 878
Deduced a syphon composed of 289 places in 1 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 3 with 578 rules applied. Total rules applied 1456 place count 878 transition count 878
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1488 place count 846 transition count 846
Iterating global reduction 3 with 32 rules applied. Total rules applied 1520 place count 846 transition count 846
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1520 place count 846 transition count 819
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1574 place count 819 transition count 819
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 2204 place count 504 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2205 place count 504 transition count 503
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2207 place count 503 transition count 502
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2209 place count 501 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2210 place count 500 transition count 500
Applied a total of 2210 rules in 144 ms. Remains 500 /1607 variables (removed 1107) and now considering 500/1607 (removed 1107) transitions.
// Phase 1: matrix 500 rows 500 cols
[2025-06-05 11:30:20] [INFO ] Computed 160 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:30:20] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-05 11:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:30:20] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:30:20] [INFO ] Redundant transitions in 2 ms returned []
Running 495 sub problems to find dead transitions.
[2025-06-05 11:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 4/500 variables, 112/160 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/660 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 660 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 495 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 4/500 variables, 112/160 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/660 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 495/1155 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:31:15] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:31:15] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:31:15] [INFO ] Deduced a trap along path composed of 4 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:31:15] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:31:15] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1160 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 495 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 500/1607 places, 500/1607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60776 ms. Remains : 500/1607 places, 500/1607 transitions.
[2025-06-05 11:31:20] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:31:20] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:31:20] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-05 11:31:20] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:31:20] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:31:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10823365775818662478.gal : 2 ms
[2025-06-05 11:31:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15015633632439147518.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/CTLFireability10823365775818662478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15015633632439147518.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.02179e+78,0.334607,15228,2,1575,5,42791,6,0,2501,57233,0


Converting to forward existential form...Done !
original formula: E(((p1317==1) + (!(EF(((AF((p1351==1)) + (p236==1)) + (p1721==1)))) * A(EG(((((p982==1)&&(p1036==1))&&(p1070==1))||(p1083==1))) U (EF((((...284
=> equivalent forward existential formula: [FwdG(FwdU(Init,((p1317==1) + (!(E(TRUE U ((!(EG(!((p1351==1)))) + (p236==1)) + (p1721==1)))) * !((E(!((E(TRUE U...597
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t31, t33, t36, t39, t41, t44, t47, t49, t52, t54, t57, t59, t61, t63, t66, t69, ...845
Detected timeout of ITS tools.
[2025-06-05 11:31:51] [INFO ] Flatten gal took : 17 ms
[2025-06-05 11:31:51] [INFO ] Applying decomposition
[2025-06-05 11:31:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13402843137060786839.txt' '-o' '/tmp/graph13402843137060786839.bin' '-w' '/tmp/graph13402843137060786839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13402843137060786839.bin' '-l' '-1' '-v' '-w' '/tmp/graph13402843137060786839.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:31:51] [INFO ] Decomposing Gal with order
[2025-06-05 11:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:31:51] [INFO ] Removed a total of 119 redundant transitions.
[2025-06-05 11:31:51] [INFO ] Flatten gal took : 20 ms
[2025-06-05 11:31:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 11:31:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16482827347055060970.gal : 3 ms
[2025-06-05 11:31:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5043456197265432744.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/CTLFireability16482827347055060970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5043456197265432744.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.02179e+78,0.170907,10456,225,19,11748,233,688,21814,43,712,0


Converting to forward existential form...Done !
original formula: E(((i15.u110.p1317==1) + (!(EF(((AF((i15.u111.p1351==1)) + (i1.i2.u17.p236==1)) + (i20.i0.u143.p1721==1)))) * A(EG(((((i11.i1.u80.p982==1...459
=> equivalent forward existential formula: [FwdG(FwdU(Init,((i15.u110.p1317==1) + (!(E(TRUE U ((!(EG(!((i15.u111.p1351==1)))) + (i1.i2.u17.p236==1)) + (i20...900
Reverse transition relation is NOT exact ! Due to transitions t321, i0.i0.u1.t31, i0.i0.u2.t33, i0.i0.u3.t36, i0.i0.u4.t39, i0.i1.u5.t41, i0.i1.u6.t44, i0....2016
Detected timeout of ITS tools.
[2025-06-05 11:32:21] [INFO ] Flatten gal took : 26 ms
[2025-06-05 11:32:21] [INFO ] Flatten gal took : 24 ms
[2025-06-05 11:32:21] [INFO ] Applying decomposition
[2025-06-05 11:32:21] [INFO ] Flatten gal took : 25 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/graph9916020866112144811.txt' '-o' '/tmp/graph9916020866112144811.bin' '-w' '/tmp/graph9916020866112144811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9916020866112144811.bin' '-l' '-1' '-v' '-w' '/tmp/graph9916020866112144811.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:32:21] [INFO ] Decomposing Gal with order
[2025-06-05 11:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:32:21] [INFO ] Removed a total of 363 redundant transitions.
[2025-06-05 11:32:21] [INFO ] Flatten gal took : 44 ms
[2025-06-05 11:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 11:32:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17691253304336555625.gal : 11 ms
[2025-06-05 11:32:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15693155792228785396.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/CTLFireability17691253304336555625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15693155792228785396.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 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.69763e+143,576.65,4672636,3895,41,7.51429e+06,1504,1459,2.9773e+07,57,5397,0


Converting to forward existential form...Done !
original formula: EX((EX((AG((i26.i2.u419.p1292==0)) * AF((i20.i2.u278.p844==0)))) + (((!(A(EG((i19.i1.u258.p790==1)) U AF((i16.i1.u196.p594==1)))) * AG((i...253
=> equivalent forward existential formula: ([((EY(EY(Init)) * !(E(TRUE U !((i26.i2.u419.p1292==0))))) * !(EG(!((i20.i2.u278.p844==0)))))] != FALSE + [((((E...449
Reverse transition relation is NOT exact ! Due to transitions t1448, t1450, t1454, t1460, t1462, t1464, t1468, t1476, t1480, t1482, t1484, t1487, t1493, t1...6191
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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

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="ShieldRVt-PT-040B"
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 ShieldRVt-PT-040B, 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 r212-tall-174901994100314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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