fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r212-tall-174901994100330
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldRVt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ?????????TF?T??? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 614K 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-050B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2023-15
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-00
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-01
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-02
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-03
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-04
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-05
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-06
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-07
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-08
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-09
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-10
FORMULA_NAME ShieldRVt-PT-050B-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749129916797

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-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 13:25:17] [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 13:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 13:25:18] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-06-05 13:25:18] [INFO ] Transformed 2503 places.
[2025-06-05 13:25:18] [INFO ] Transformed 2503 transitions.
[2025-06-05 13:25:18] [INFO ] Found NUPN structural information;
[2025-06-05 13:25:18] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 103 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 1987 transition count 1987
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 1987 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1033 place count 1986 transition count 1986
Iterating global reduction 0 with 1 rules applied. Total rules applied 1034 place count 1986 transition count 1986
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1035 place count 1985 transition count 1985
Iterating global reduction 0 with 1 rules applied. Total rules applied 1036 place count 1985 transition count 1985
Applied a total of 1036 rules in 914 ms. Remains 1985 /2503 variables (removed 518) and now considering 1985/2503 (removed 518) transitions.
// Phase 1: matrix 1985 rows 1985 cols
[2025-06-05 13:25:19] [INFO ] Computed 201 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:25:20] [INFO ] Implicit Places using invariants in 787 ms returned []
[2025-06-05 13:25:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:25:21] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
Running 1984 sub problems to find dead transitions.
[2025-06-05 13:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1984/3970 variables, and 0 constraints, problems are : Problem set: 0 solved, 1984 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1985 constraints, PredecessorRefiner: 1984/1984 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1984 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 1984/3970 variables, and 0 constraints, problems are : Problem set: 0 solved, 1984 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1985 constraints, PredecessorRefiner: 0/1984 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60626ms problems are : Problem set: 0 solved, 1984 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Starting structural reductions in LTL mode, iteration 1 : 1985/2503 places, 1985/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63939 ms. Remains : 1985/2503 places, 1985/2503 transitions.
Support contains 103 out of 1985 places after structural reductions.
[2025-06-05 13:26:22] [INFO ] Flatten gal took : 126 ms
[2025-06-05 13:26:22] [INFO ] Flatten gal took : 72 ms
[2025-06-05 13:26:22] [INFO ] Input system was already deterministic with 1985 transitions.
Support contains 101 out of 1985 places (down from 103) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2070 ms. (19 steps per ms) remains 44/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
[2025-06-05 13:26:23] [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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 575/635 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1350/1985 variables, 148/201 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1985 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1985/3970 variables, 1985/2186 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3970 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 2186 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1985/1985 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 575/635 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:29] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:29] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1350/1985 variables, 148/203 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:30] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:31] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:31] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:31] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:31] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:31] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:31] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:32] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1985/3970 variables, and 217 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/1985 constraints, PredecessorRefiner: 0/44 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 0 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 1985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 506 place count 1985 transition count 1479
Reduce places removed 506 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 522 rules applied. Total rules applied 1028 place count 1479 transition count 1463
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1044 place count 1463 transition count 1463
Performed 363 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 363 Pre rules applied. Total rules applied 1044 place count 1463 transition count 1100
Deduced a syphon composed of 363 places in 2 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 3 with 726 rules applied. Total rules applied 1770 place count 1100 transition count 1100
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1780 place count 1090 transition count 1090
Iterating global reduction 3 with 10 rules applied. Total rules applied 1790 place count 1090 transition count 1090
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1790 place count 1090 transition count 1081
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1808 place count 1081 transition count 1081
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 462
Deduced a syphon composed of 462 places in 1 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 3 with 924 rules applied. Total rules applied 2732 place count 619 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2733 place count 619 transition count 618
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2735 place count 618 transition count 617
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -78
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 2937 place count 517 transition count 695
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 2991 place count 490 transition count 719
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 2992 place count 490 transition count 718
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 2995 place count 490 transition count 715
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2998 place count 487 transition count 715
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3000 place count 487 transition count 713
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3002 place count 487 transition count 713
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3003 place count 486 transition count 712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3004 place count 485 transition count 712
Applied a total of 3004 rules in 390 ms. Remains 485 /1985 variables (removed 1500) and now considering 712/1985 (removed 1273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 485/1985 places, 712/1985 transitions.
RANDOM walk for 40000 steps (12 resets) in 542 ms. (73 steps per ms) remains 31/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 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 18 ms. (210 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 20 ms. (190 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 4003 steps (8 resets) in 18 ms. (210 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 4003 steps (8 resets) in 16 ms. (235 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 16 ms. (235 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 4003 steps (8 resets) in 37 ms. (105 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 4003 steps (8 resets) in 18 ms. (210 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 17 ms. (222 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 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 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 4003 steps (8 resets) in 20 ms. (190 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 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 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 18 ms. (210 steps per ms) remains 31/31 properties
// Phase 1: matrix 712 rows 485 cols
[2025-06-05 13:26:34] [INFO ] Computed 200 invariants in 3 ms
[2025-06-05 13:26:34] [INFO ] State equation strengthened by 13 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 80/118 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 239/357 variables, 118/150 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 326/683 variables, 149/299 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 71/370 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 7/377 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 3/686 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 2/688 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 112/800 variables, 53/437 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/800 variables, 23/460 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/800 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 3/803 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/803 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/803 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (OVERLAPS) 40/843 variables, 19/484 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/843 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/843 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (OVERLAPS) 2/845 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/845 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/845 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 27 (OVERLAPS) 31/876 variables, 10/504 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/876 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/876 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 30 (OVERLAPS) 2/878 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/878 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/878 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 33 (OVERLAPS) 24/902 variables, 10/520 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/902 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/902 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 36 (OVERLAPS) 2/904 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/904 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 38 (OVERLAPS) 21/925 variables, 11/535 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/925 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/925 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 41 (OVERLAPS) 23/948 variables, 8/547 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/948 variables, 3/550 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/948 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 44 (OVERLAPS) 2/950 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/950 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 46 (OVERLAPS) 25/975 variables, 11/562 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/975 variables, 3/565 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/975 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 49 (OVERLAPS) 1/976 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/976 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/976 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 52 (OVERLAPS) 22/998 variables, 8/575 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/998 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/998 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 55 (OVERLAPS) 3/1001 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1001 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1001 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 58 (OVERLAPS) 22/1023 variables, 10/590 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1023 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1023 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 61 (OVERLAPS) 22/1045 variables, 8/602 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1045 variables, 4/606 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1045 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 64 (OVERLAPS) 22/1067 variables, 8/614 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1067 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1067 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 67 (OVERLAPS) 20/1087 variables, 8/626 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1087 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1087 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 70 (OVERLAPS) 23/1110 variables, 8/638 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1110 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1110 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 73 (OVERLAPS) 2/1112 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1112 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 75 (OVERLAPS) 22/1134 variables, 10/652 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1134 variables, 4/656 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1134 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 78 (OVERLAPS) 23/1157 variables, 8/664 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1157 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1157 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1157 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 82 (OVERLAPS) 2/1159 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1159 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 84 (OVERLAPS) 21/1180 variables, 10/680 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1180 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1180 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1180 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 88 (OVERLAPS) 14/1194 variables, 6/692 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1194 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1194 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 91 (OVERLAPS) 3/1197 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1197 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 94 (OVERLAPS) 0/1197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1197/1197 variables, and 698 constraints, problems are : Problem set: 0 solved, 31 unsolved in 11874 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 485/485 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 80/118 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 239/357 variables, 118/150 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 326/683 variables, 149/318 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 71/389 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/683 variables, 12/408 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/683 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 3/686 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 2/688 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 112/800 variables, 53/468 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 23/491 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:26:49] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/800 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (OVERLAPS) 3/803 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/803 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/803 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (OVERLAPS) 40/843 variables, 19/516 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/843 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/843 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 27 (OVERLAPS) 2/845 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 30 (OVERLAPS) 31/876 variables, 10/536 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/876 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/876 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 33 (OVERLAPS) 2/878 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/878 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/878 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 36 (OVERLAPS) 24/902 variables, 10/552 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/902 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/902 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 39 (OVERLAPS) 2/904 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/904 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 41 (OVERLAPS) 21/925 variables, 11/567 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/925 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/925 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 44 (OVERLAPS) 23/948 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/948 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/948 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 47 (OVERLAPS) 2/950 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/950 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 49 (OVERLAPS) 25/975 variables, 11/594 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/975 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/975 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 52 (OVERLAPS) 1/976 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/976 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/976 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 55 (OVERLAPS) 22/998 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/998 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/998 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 58 (OVERLAPS) 3/1001 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1001 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1001 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 61 (OVERLAPS) 22/1023 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1023 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1023 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 64 (OVERLAPS) 22/1045 variables, 8/634 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1045 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1045 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 67 (OVERLAPS) 22/1067 variables, 8/646 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1067 variables, 4/650 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1067 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 70 (OVERLAPS) 20/1087 variables, 8/658 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1087 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1087 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 73 (OVERLAPS) 23/1110 variables, 8/670 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1110 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1110 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 76 (OVERLAPS) 2/1112 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1112 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 78 (OVERLAPS) 22/1134 variables, 10/684 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1134 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1134 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 81 (OVERLAPS) 23/1157 variables, 8/696 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1157 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1157 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1157 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 85 (OVERLAPS) 2/1159 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1159 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 87 (OVERLAPS) 21/1180 variables, 10/712 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1180 variables, 4/716 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1180 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1180 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 91 (OVERLAPS) 14/1194 variables, 6/724 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1194 variables, 3/727 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1194 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 94 (OVERLAPS) 3/1197 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1197 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1197 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 97 (OVERLAPS) 0/1197 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1197/1197 variables, and 730 constraints, problems are : Problem set: 0 solved, 31 unsolved in 36230 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 485/485 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48124ms problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 2293 ms.
Support contains 38 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 712/712 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 485 transition count 710
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 483 transition count 710
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 4 place count 483 transition count 697
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 30 place count 470 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 469 transition count 696
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 469 transition count 696
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 463 transition count 690
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 455 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 453 transition count 700
Applied a total of 62 rules in 52 ms. Remains 453 /485 variables (removed 32) and now considering 700/712 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 453/485 places, 700/712 transitions.
RANDOM walk for 40000 steps (12 resets) in 418 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 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 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 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 24 ms. (160 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 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 151900 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 31
Probabilistic random walk after 151900 steps, saw 106770 distinct states, run finished after 3007 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 700 rows 453 cols
[2025-06-05 13:27:28] [INFO ] Computed 200 invariants in 2 ms
[2025-06-05 13:27:28] [INFO ] State equation strengthened by 1 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 79/117 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 240/357 variables, 117/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 324/681 variables, 148/297 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 74/371 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 113/794 variables, 52/424 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/794 variables, 26/450 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/794 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 36/830 variables, 16/466 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/830 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/830 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 22/852 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 22/874 variables, 8/494 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/874 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/874 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (OVERLAPS) 22/896 variables, 8/506 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/896 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/896 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (OVERLAPS) 22/918 variables, 8/518 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/918 variables, 4/522 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/918 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 27 (OVERLAPS) 22/940 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/940 variables, 4/534 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/940 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 30 (OVERLAPS) 22/962 variables, 8/542 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/962 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/962 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 33 (OVERLAPS) 22/984 variables, 8/554 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/984 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/984 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 36 (OVERLAPS) 22/1006 variables, 8/566 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1006 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1006 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 39 (OVERLAPS) 22/1028 variables, 8/578 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1028 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1028 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 42 (OVERLAPS) 22/1050 variables, 8/590 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1050 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1050 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 45 (OVERLAPS) 22/1072 variables, 8/602 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1072 variables, 4/606 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1072 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 48 (OVERLAPS) 22/1094 variables, 8/614 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1094 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1094 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 51 (OVERLAPS) 22/1116 variables, 8/626 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1116 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1116 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 54 (OVERLAPS) 20/1136 variables, 8/638 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1136 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1136 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 57 (OVERLAPS) 14/1150 variables, 6/648 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1150 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1150 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 60 (OVERLAPS) 3/1153 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1153 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1153 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 63 (OVERLAPS) 0/1153 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1153/1153 variables, and 654 constraints, problems are : Problem set: 0 solved, 31 unsolved in 7597 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 453/453 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 79/117 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 240/357 variables, 117/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 19/168 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 324/681 variables, 148/316 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 74/390 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 12/403 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 113/794 variables, 52/455 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/794 variables, 26/481 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/794 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 36/830 variables, 16/497 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/830 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/830 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (OVERLAPS) 22/852 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/852 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/852 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (OVERLAPS) 22/874 variables, 8/525 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/874 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/874 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (OVERLAPS) 22/896 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/896 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/896 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 26 (OVERLAPS) 22/918 variables, 8/549 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/918 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/918 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 29 (OVERLAPS) 22/940 variables, 8/561 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/940 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/940 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 32 (OVERLAPS) 22/962 variables, 8/573 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/962 variables, 4/577 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/962 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 35 (OVERLAPS) 22/984 variables, 8/585 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/984 variables, 4/589 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/984 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 38 (OVERLAPS) 22/1006 variables, 8/597 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1006 variables, 4/601 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1006 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 41 (OVERLAPS) 22/1028 variables, 8/609 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1028 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1028 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 44 (OVERLAPS) 22/1050 variables, 8/621 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1050 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1050 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 47 (OVERLAPS) 22/1072 variables, 8/633 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1072 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1072 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 50 (OVERLAPS) 22/1094 variables, 8/645 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1094 variables, 4/649 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1094 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 53 (OVERLAPS) 22/1116 variables, 8/657 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1116 variables, 4/661 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1116 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 56 (OVERLAPS) 20/1136 variables, 8/669 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1136 variables, 4/673 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1136 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 59 (OVERLAPS) 14/1150 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1150 variables, 3/682 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1150 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 62 (OVERLAPS) 3/1153 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1153 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1153 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 65 (OVERLAPS) 0/1153 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1153/1153 variables, and 685 constraints, problems are : Problem set: 0 solved, 31 unsolved in 23082 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 453/453 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30689ms problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 21 different solutions.
Parikh walk visited 4 properties in 1027 ms.
Support contains 33 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 700/700 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 453 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 452 transition count 699
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 452 transition count 696
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 8 place count 449 transition count 696
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 446 transition count 699
Applied a total of 14 rules in 23 ms. Remains 446 /453 variables (removed 7) and now considering 699/700 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 446/453 places, 699/700 transitions.
RANDOM walk for 40000 steps (11 resets) in 393 ms. (101 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 154055 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 27
Probabilistic random walk after 154055 steps, saw 108370 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 699 rows 446 cols
[2025-06-05 13:28:03] [INFO ] Computed 200 invariants in 2 ms
[2025-06-05 13:28:03] [INFO ] State equation strengthened by 2 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 69/102 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 208/310 variables, 102/130 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 288/598 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 65/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 103/701 variables, 46/373 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/701 variables, 23/396 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/701 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 63/764 variables, 24/420 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 12/432 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 36/800 variables, 16/448 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/800 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 22/822 variables, 8/464 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/822 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/822 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (OVERLAPS) 22/844 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/844 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/844 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (OVERLAPS) 22/866 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/866 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/866 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 27 (OVERLAPS) 22/888 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/888 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/888 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (OVERLAPS) 22/910 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/910 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/910 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 33 (OVERLAPS) 22/932 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/932 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/932 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 36 (OVERLAPS) 22/954 variables, 8/536 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/954 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/954 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 39 (OVERLAPS) 22/976 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/976 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/976 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 42 (OVERLAPS) 22/998 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/998 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/998 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 45 (OVERLAPS) 22/1020 variables, 8/572 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1020 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1020 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 48 (OVERLAPS) 22/1042 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1042 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1042 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 51 (OVERLAPS) 22/1064 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1064 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1064 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 54 (OVERLAPS) 22/1086 variables, 8/608 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1086 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1086 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 57 (OVERLAPS) 22/1108 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1108 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1108 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 60 (OVERLAPS) 20/1128 variables, 8/632 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1128 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1128 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 63 (OVERLAPS) 14/1142 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1142 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1142 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 66 (OVERLAPS) 3/1145 variables, 2/647 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1145 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1145 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 69 (OVERLAPS) 0/1145 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 648 constraints, problems are : Problem set: 0 solved, 27 unsolved in 7110 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 446/446 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 69/102 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 208/310 variables, 102/130 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 288/598 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 65/342 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 103/701 variables, 46/400 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 23/423 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 63/764 variables, 24/447 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/764 variables, 12/459 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/764 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 36/800 variables, 16/475 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 22/822 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/822 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/822 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (OVERLAPS) 22/844 variables, 8/503 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/844 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/844 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (OVERLAPS) 22/866 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/866 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/866 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 29 (OVERLAPS) 22/888 variables, 8/527 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/888 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/888 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (OVERLAPS) 22/910 variables, 8/539 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/910 variables, 4/543 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/910 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 35 (OVERLAPS) 22/932 variables, 8/551 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/932 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/932 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 38 (OVERLAPS) 22/954 variables, 8/563 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/954 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/954 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 41 (OVERLAPS) 22/976 variables, 8/575 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/976 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/976 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 44 (OVERLAPS) 22/998 variables, 8/587 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/998 variables, 4/591 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/998 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 47 (OVERLAPS) 22/1020 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1020 variables, 4/603 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1020 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 50 (OVERLAPS) 22/1042 variables, 8/611 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1042 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1042 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 53 (OVERLAPS) 22/1064 variables, 8/623 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1064 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1064 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 56 (OVERLAPS) 22/1086 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1086 variables, 4/639 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1086 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 59 (OVERLAPS) 22/1108 variables, 8/647 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1108 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1108 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 62 (OVERLAPS) 20/1128 variables, 8/659 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1128 variables, 4/663 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1128 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 65 (OVERLAPS) 14/1142 variables, 6/669 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1142 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1142 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 68 (OVERLAPS) 3/1145 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1145 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1145 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 71 (OVERLAPS) 0/1145 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1145/1145 variables, and 675 constraints, problems are : Problem set: 0 solved, 27 unsolved in 20791 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 446/446 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27911ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 1352 ms.
Support contains 33 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 699/699 transitions.
Applied a total of 0 rules in 11 ms. Remains 446 /446 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 446/446 places, 699/699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 699/699 transitions.
Applied a total of 0 rules in 10 ms. Remains 446 /446 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2025-06-05 13:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:28:32] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-05 13:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:28:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-05 13:28:33] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:28:33] [INFO ] Redundant transitions in 37 ms returned []
Running 695 sub problems to find dead transitions.
[2025-06-05 13:28:33] [INFO ] Invariant cache hit.
[2025-06-05 13:28:33] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1145 variables, 446/646 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1145 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 648 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 446/446 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1145 variables, 446/646 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1145 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1145 variables, 695/1343 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1145/1145 variables, and 1343 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 446/446 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60865 ms. Remains : 446/446 places, 699/699 transitions.
[2025-06-05 13:29:33] [INFO ] Flatten gal took : 53 ms
[2025-06-05 13:29:33] [INFO ] Flatten gal took : 48 ms
[2025-06-05 13:29:33] [INFO ] Input system was already deterministic with 1985 transitions.
Computed a total of 605 stabilizing places and 605 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1952 transition count 1952
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1952 transition count 1952
Applied a total of 66 rules in 220 ms. Remains 1952 /1985 variables (removed 33) and now considering 1952/1985 (removed 33) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2025-06-05 13:29:34] [INFO ] Computed 201 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:29:34] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-06-05 13:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:29:36] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-06-05 13:29:36] [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 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1985 places, 1952/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62670 ms. Remains : 1952/1985 places, 1952/1985 transitions.
[2025-06-05 13:30:36] [INFO ] Flatten gal took : 39 ms
[2025-06-05 13:30:36] [INFO ] Flatten gal took : 40 ms
[2025-06-05 13:30:36] [INFO ] Input system was already deterministic with 1952 transitions.
[2025-06-05 13:30:36] [INFO ] Flatten gal took : 39 ms
[2025-06-05 13:30:36] [INFO ] Flatten gal took : 39 ms
[2025-06-05 13:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13028001049333905773.gal : 25 ms
[2025-06-05 13:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4597801070995382327.ctl : 2 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/CTLFireability13028001049333905773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4597801070995382327.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 13:31:06] [INFO ] Flatten gal took : 35 ms
[2025-06-05 13:31:06] [INFO ] Applying decomposition
[2025-06-05 13:31:06] [INFO ] Flatten gal took : 36 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/graph14451981142314589346.txt' '-o' '/tmp/graph14451981142314589346.bin' '-w' '/tmp/graph14451981142314589346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14451981142314589346.bin' '-l' '-1' '-v' '-w' '/tmp/graph14451981142314589346.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:31:07] [INFO ] Decomposing Gal with order
[2025-06-05 13:31:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:31:07] [INFO ] Removed a total of 499 redundant transitions.
[2025-06-05 13:31:07] [INFO ] Flatten gal took : 141 ms
[2025-06-05 13:31:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2025-06-05 13:31:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4074060972008957064.gal : 26 ms
[2025-06-05 13:31:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6251917804293727705.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/CTLFireability4074060972008957064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6251917804293727705.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 LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1953 transition count 1953
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1953 transition count 1953
Applied a total of 64 rules in 231 ms. Remains 1953 /1985 variables (removed 32) and now considering 1953/1985 (removed 32) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2025-06-05 13:31:37] [INFO ] Computed 201 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:31:38] [INFO ] Implicit Places using invariants in 479 ms returned []
[2025-06-05 13:31:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:31:39] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
Running 1952 sub problems to find dead transitions.
[2025-06-05 13:31:39] [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 1952/3906 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1953 constraints, PredecessorRefiner: 1952/1952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1952 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 1952/3906 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1953 constraints, PredecessorRefiner: 0/1952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 1952 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 1953/1985 places, 1953/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62750 ms. Remains : 1953/1985 places, 1953/1985 transitions.
[2025-06-05 13:32:40] [INFO ] Flatten gal took : 45 ms
[2025-06-05 13:32:40] [INFO ] Flatten gal took : 33 ms
[2025-06-05 13:32:40] [INFO ] Input system was already deterministic with 1953 transitions.
[2025-06-05 13:32:40] [INFO ] Flatten gal took : 31 ms
[2025-06-05 13:32:40] [INFO ] Flatten gal took : 31 ms
[2025-06-05 13:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14587336868261261039.gal : 7 ms
[2025-06-05 13:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7030724085471639682.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/CTLFireability14587336868261261039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7030724085471639682.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 13:33:10] [INFO ] Flatten gal took : 31 ms
[2025-06-05 13:33:10] [INFO ] Applying decomposition
[2025-06-05 13:33:10] [INFO ] Flatten gal took : 39 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/graph593091838185620949.txt' '-o' '/tmp/graph593091838185620949.bin' '-w' '/tmp/graph593091838185620949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph593091838185620949.bin' '-l' '-1' '-v' '-w' '/tmp/graph593091838185620949.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:33:10] [INFO ] Decomposing Gal with order
[2025-06-05 13:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:33:11] [INFO ] Removed a total of 498 redundant transitions.
[2025-06-05 13:33:11] [INFO ] Flatten gal took : 75 ms
[2025-06-05 13:33:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-05 13:33:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16481238452691307439.gal : 16 ms
[2025-06-05 13:33:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1870460815245486946.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/CTLFireability16481238452691307439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1870460815245486946.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 : 1985/1985 places, 1985/1985 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1984 transition count 1437
Reduce places removed 547 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 549 rules applied. Total rules applied 1096 place count 1437 transition count 1435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1098 place count 1435 transition count 1435
Performed 379 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 379 Pre rules applied. Total rules applied 1098 place count 1435 transition count 1056
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1856 place count 1056 transition count 1056
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1885 place count 1027 transition count 1027
Iterating global reduction 3 with 29 rules applied. Total rules applied 1914 place count 1027 transition count 1027
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 1914 place count 1027 transition count 1001
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1966 place count 1001 transition count 1001
Performed 389 Post agglomeration using F-continuation condition.Transition count delta: 389
Deduced a syphon composed of 389 places in 0 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 3 with 778 rules applied. Total rules applied 2744 place count 612 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2745 place count 612 transition count 611
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 2747 place count 611 transition count 610
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2749 place count 609 transition count 608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2750 place count 608 transition count 608
Applied a total of 2750 rules in 233 ms. Remains 608 /1985 variables (removed 1377) and now considering 608/1985 (removed 1377) transitions.
// Phase 1: matrix 608 rows 608 cols
[2025-06-05 13:33:41] [INFO ] Computed 200 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:33:41] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-05 13:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:33:42] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:33:42] [INFO ] Redundant transitions in 4 ms returned []
Running 604 sub problems to find dead transitions.
[2025-06-05 13:33:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 3/608 variables, 58/200 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/608 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 604 unsolved
SMT process timed out in 30055ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 30056ms
Starting structural reductions in SI_CTL mode, iteration 1 : 608/1985 places, 608/1985 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30921 ms. Remains : 608/1985 places, 608/1985 transitions.
[2025-06-05 13:34:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:34:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:34:12] [INFO ] Input system was already deterministic with 608 transitions.
[2025-06-05 13:34:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:34:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:34:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6277776567744338435.gal : 2 ms
[2025-06-05 13:34:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12553091101024164864.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/CTLFireability6277776567744338435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12553091101024164864.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.78928e+95,0.432434,18556,2,1720,5,55459,6,0,3040,77192,0


Converting to forward existential form...Done !
original formula: AG(AF(!(A((p38==1) U (((p890==1)||(p1526==1)) * A((p1250==1) U (p286==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(!((E(!((((p890==1)||(p1526==1)) * !((E(!((p286==1)) U (!((p1250==1)) * !((p286==1)))) ...424
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t10, t13, t15, t17, t18, t22, t25, t29, t31, t35, t39, t41, t44, t47, t51, t53, t...867
Detected timeout of ITS tools.
[2025-06-05 13:34:42] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:34:42] [INFO ] Applying decomposition
[2025-06-05 13:34:42] [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/graph11164420762794012315.txt' '-o' '/tmp/graph11164420762794012315.bin' '-w' '/tmp/graph11164420762794012315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11164420762794012315.bin' '-l' '-1' '-v' '-w' '/tmp/graph11164420762794012315.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:34:42] [INFO ] Decomposing Gal with order
[2025-06-05 13:34:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:34:42] [INFO ] Removed a total of 149 redundant transitions.
[2025-06-05 13:34:42] [INFO ] Flatten gal took : 20 ms
[2025-06-05 13:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 13:34:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17837505829425023766.gal : 4 ms
[2025-06-05 13:34:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7669900067908600377.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/CTLFireability17837505829425023766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7669900067908600377.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,3.78928e+95,0.172856,9520,169,20,9071,128,566,18332,41,285,0


Converting to forward existential form...Done !
original formula: AG(AF(!(A((i6.i1.u0.p38==1) U (((i9.i1.u71.p890==1)||(i16.i1.u123.p1526==1)) * A((i13.i1.u100.p1250==1) U (i2.i1.u20.p286==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(!((E(!((((i9.i1.u71.p890==1)||(i16.i1.u123.p1526==1)) * !((E(!((i2.i1.u20.p286==1)) U ...625
Reverse transition relation is NOT exact ! Due to transitions t70, i0.u2.t8, i0.u3.t10, i0.u4.t13, i0.u5.t15, i1.i0.u6.t17, i1.i0.u7.t18, i1.i0.u8.t22, i1....2119
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1956 transition count 1956
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1956 transition count 1956
Applied a total of 58 rules in 226 ms. Remains 1956 /1985 variables (removed 29) and now considering 1956/1985 (removed 29) transitions.
// Phase 1: matrix 1956 rows 1956 cols
[2025-06-05 13:35:12] [INFO ] Computed 201 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:35:13] [INFO ] Implicit Places using invariants in 490 ms returned []
[2025-06-05 13:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:35:14] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
Running 1955 sub problems to find dead transitions.
[2025-06-05 13:35:14] [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 1955/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 1955 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1956 constraints, PredecessorRefiner: 1955/1955 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1955 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 1955/3912 variables, and 0 constraints, problems are : Problem set: 0 solved, 1955 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1956 constraints, PredecessorRefiner: 0/1955 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 1955 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in LTL mode, iteration 1 : 1956/1985 places, 1956/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62752 ms. Remains : 1956/1985 places, 1956/1985 transitions.
[2025-06-05 13:36:15] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:36:15] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:36:15] [INFO ] Input system was already deterministic with 1956 transitions.
[2025-06-05 13:36:15] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:36:15] [INFO ] Flatten gal took : 40 ms
[2025-06-05 13:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1566398733982388383.gal : 6 ms
[2025-06-05 13:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2882362662339257296.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/CTLFireability1566398733982388383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2882362662339257296.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 13:36:45] [INFO ] Flatten gal took : 33 ms
[2025-06-05 13:36:45] [INFO ] Applying decomposition
[2025-06-05 13:36:45] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6208641358674721162.txt' '-o' '/tmp/graph6208641358674721162.bin' '-w' '/tmp/graph6208641358674721162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6208641358674721162.bin' '-l' '-1' '-v' '-w' '/tmp/graph6208641358674721162.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:36:45] [INFO ] Decomposing Gal with order
[2025-06-05 13:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:36:45] [INFO ] Removed a total of 493 redundant transitions.
[2025-06-05 13:36:45] [INFO ] Flatten gal took : 79 ms
[2025-06-05 13:36:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-05 13:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10670525573700770020.gal : 13 ms
[2025-06-05 13:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11455524972203260024.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/CTLFireability10670525573700770020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11455524972203260024.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1952 transition count 1952
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1952 transition count 1952
Applied a total of 66 rules in 238 ms. Remains 1952 /1985 variables (removed 33) and now considering 1952/1985 (removed 33) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2025-06-05 13:37:16] [INFO ] Computed 201 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:37:16] [INFO ] Implicit Places using invariants in 480 ms returned []
[2025-06-05 13:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:37:18] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-06-05 13:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 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 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1985 places, 1952/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62667 ms. Remains : 1952/1985 places, 1952/1985 transitions.
[2025-06-05 13:38:18] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:38:18] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:38:18] [INFO ] Input system was already deterministic with 1952 transitions.
[2025-06-05 13:38:18] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:38:18] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:38:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17417914819751451750.gal : 6 ms
[2025-06-05 13:38:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17069820289187478835.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/CTLFireability17417914819751451750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17069820289187478835.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 13:38:48] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:38:48] [INFO ] Applying decomposition
[2025-06-05 13:38:48] [INFO ] Flatten gal took : 30 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/graph12941599905225385806.txt' '-o' '/tmp/graph12941599905225385806.bin' '-w' '/tmp/graph12941599905225385806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12941599905225385806.bin' '-l' '-1' '-v' '-w' '/tmp/graph12941599905225385806.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:38:49] [INFO ] Decomposing Gal with order
[2025-06-05 13:38:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:38:49] [INFO ] Removed a total of 499 redundant transitions.
[2025-06-05 13:38:49] [INFO ] Flatten gal took : 58 ms
[2025-06-05 13:38:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-05 13:38:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16325498977381199354.gal : 14 ms
[2025-06-05 13:38:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12285085546272294015.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/CTLFireability16325498977381199354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12285085546272294015.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1984 transition count 1436
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1436 transition count 1436
Performed 381 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 381 Pre rules applied. Total rules applied 1096 place count 1436 transition count 1055
Deduced a syphon composed of 381 places in 2 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 2 with 762 rules applied. Total rules applied 1858 place count 1055 transition count 1055
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1886 place count 1027 transition count 1027
Iterating global reduction 2 with 28 rules applied. Total rules applied 1914 place count 1027 transition count 1027
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 1914 place count 1027 transition count 1002
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 1964 place count 1002 transition count 1002
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 1 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 2 with 794 rules applied. Total rules applied 2758 place count 605 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2759 place count 605 transition count 604
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 2761 place count 604 transition count 603
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2763 place count 602 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2764 place count 601 transition count 601
Applied a total of 2764 rules in 229 ms. Remains 601 /1985 variables (removed 1384) and now considering 601/1985 (removed 1384) transitions.
// Phase 1: matrix 601 rows 601 cols
[2025-06-05 13:39:19] [INFO ] Computed 200 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:39:19] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-05 13:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:39:20] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:39:20] [INFO ] Redundant transitions in 3 ms returned []
Running 599 sub problems to find dead transitions.
[2025-06-05 13:39: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/600 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (OVERLAPS) 1/601 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 601/1202 variables, 601/801 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 801 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (OVERLAPS) 1/601 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 601/1202 variables, 601/801 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 599/1400 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:40:19] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1401 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 601/1985 places, 601/1985 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60987 ms. Remains : 601/1985 places, 601/1985 transitions.
[2025-06-05 13:40:20] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:40:20] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:40:20] [INFO ] Input system was already deterministic with 601 transitions.
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-050B-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 13:40:20] [INFO ] Flatten gal took : 17 ms
[2025-06-05 13:40:20] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:40:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4600566545556323122.gal : 2 ms
[2025-06-05 13:40:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6158614402998497812.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4600566545556323122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6158614402998497812.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 1984 transition count 1435
Reduce places removed 549 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 550 rules applied. Total rules applied 1099 place count 1435 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1100 place count 1434 transition count 1434
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 380 Pre rules applied. Total rules applied 1100 place count 1434 transition count 1054
Deduced a syphon composed of 380 places in 1 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 3 with 760 rules applied. Total rules applied 1860 place count 1054 transition count 1054
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1887 place count 1027 transition count 1027
Iterating global reduction 3 with 27 rules applied. Total rules applied 1914 place count 1027 transition count 1027
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 1914 place count 1027 transition count 1003
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1962 place count 1003 transition count 1003
Performed 396 Post agglomeration using F-continuation condition.Transition count delta: 396
Deduced a syphon composed of 396 places in 0 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 2754 place count 607 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2755 place count 607 transition count 606
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 2757 place count 606 transition count 605
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2759 place count 604 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2760 place count 603 transition count 603
Applied a total of 2760 rules in 203 ms. Remains 603 /1985 variables (removed 1382) and now considering 603/1985 (removed 1382) transitions.
// Phase 1: matrix 603 rows 603 cols
[2025-06-05 13:40:20] [INFO ] Computed 200 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:40:20] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-05 13:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:40:21] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:40:21] [INFO ] Redundant transitions in 5 ms returned []
Running 601 sub problems to find dead transitions.
[2025-06-05 13:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/603 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 603/1206 variables, 603/803 constraints. Problems are: Problem set: 0 solved, 601 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 1206/1206 variables, and 803 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/603 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 603/1206 variables, 603/803 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 601/1404 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 1404 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in SI_CTL mode, iteration 1 : 603/1985 places, 603/1985 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60944 ms. Remains : 603/1985 places, 603/1985 transitions.
[2025-06-05 13:41:21] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:41:21] [INFO ] Flatten gal took : 15 ms
[2025-06-05 13:41:21] [INFO ] Input system was already deterministic with 603 transitions.
[2025-06-05 13:41:21] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:41:21] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:41:21] [INFO ] Time to serialize gal into /tmp/CTLFireability18406235786218500134.gal : 2 ms
[2025-06-05 13:41:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5557706230792271194.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/CTLFireability18406235786218500134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5557706230792271194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.54714e+95,0.381609,15812,2,1011,5,44668,6,0,3017,57865,0


Converting to forward existential form...Done !
original formula: (EG(EF((AG((p1760==1)) + (p499==1)))) * AF((p1625==1)))
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (!(E(TRUE U !((p1760==1)))) + (p499==1))))))] = FALSE * [FwdG(Init,!((p1625==1)))] = FAL...158
Hit Full ! (commute/partial/dont) 601/0/2
(forward)formula 0,0,1.69742,57120,1,0,9,363013,20,3,15229,82519,8
FORMULA ShieldRVt-PT-050B-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1958 transition count 1958
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1958 transition count 1958
Applied a total of 54 rules in 221 ms. Remains 1958 /1985 variables (removed 27) and now considering 1958/1985 (removed 27) transitions.
// Phase 1: matrix 1958 rows 1958 cols
[2025-06-05 13:41:23] [INFO ] Computed 201 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:41:23] [INFO ] Implicit Places using invariants in 463 ms returned []
[2025-06-05 13:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:41:25] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
Running 1957 sub problems to find dead transitions.
[2025-06-05 13:41:25] [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 1957/3916 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1958 constraints, PredecessorRefiner: 1957/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1957 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 timeout
1)
(s72 1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1957/3916 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1958 constraints, PredecessorRefiner: 0/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 1957 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in LTL mode, iteration 1 : 1958/1985 places, 1958/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62662 ms. Remains : 1958/1985 places, 1958/1985 transitions.
[2025-06-05 13:42:25] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:42:25] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:42:25] [INFO ] Input system was already deterministic with 1958 transitions.
[2025-06-05 13:42:25] [INFO ] Flatten gal took : 27 ms
[2025-06-05 13:42:25] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:42:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3407090573214072915.gal : 9 ms
[2025-06-05 13:42:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13173505669466576766.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/CTLFireability3407090573214072915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13173505669466576766.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 13:42:56] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:42:56] [INFO ] Applying decomposition
[2025-06-05 13:42:56] [INFO ] Flatten gal took : 28 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/graph8696203757026487718.txt' '-o' '/tmp/graph8696203757026487718.bin' '-w' '/tmp/graph8696203757026487718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8696203757026487718.bin' '-l' '-1' '-v' '-w' '/tmp/graph8696203757026487718.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:42:56] [INFO ] Decomposing Gal with order
[2025-06-05 13:42:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:42:56] [INFO ] Removed a total of 487 redundant transitions.
[2025-06-05 13:42:56] [INFO ] Flatten gal took : 56 ms
[2025-06-05 13:42:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 13:42:56] [INFO ] Time to serialize gal into /tmp/CTLFireability885698085707626575.gal : 13 ms
[2025-06-05 13:42:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4446506109762618800.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/CTLFireability885698085707626575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4446506109762618800.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 SI_CTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1984 transition count 1436
Reduce places removed 548 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 549 rules applied. Total rules applied 1097 place count 1436 transition count 1435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1098 place count 1435 transition count 1435
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 380 Pre rules applied. Total rules applied 1098 place count 1435 transition count 1055
Deduced a syphon composed of 380 places in 1 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 3 with 760 rules applied. Total rules applied 1858 place count 1055 transition count 1055
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1887 place count 1026 transition count 1026
Iterating global reduction 3 with 29 rules applied. Total rules applied 1916 place count 1026 transition count 1026
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 1916 place count 1026 transition count 1000
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1968 place count 1000 transition count 1000
Performed 396 Post agglomeration using F-continuation condition.Transition count delta: 396
Deduced a syphon composed of 396 places in 0 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 2760 place count 604 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2761 place count 604 transition count 603
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 2763 place count 603 transition count 602
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 601 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2766 place count 600 transition count 600
Applied a total of 2766 rules in 188 ms. Remains 600 /1985 variables (removed 1385) and now considering 600/1985 (removed 1385) transitions.
// Phase 1: matrix 600 rows 600 cols
[2025-06-05 13:43:26] [INFO ] Computed 200 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:43:26] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-05 13:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:43:27] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:43:27] [INFO ] Redundant transitions in 4 ms returned []
Running 599 sub problems to find dead transitions.
[2025-06-05 13:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (OVERLAPS) 600/1200 variables, 600/800 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 800 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (OVERLAPS) 600/1200 variables, 600/800 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1200 variables, 599/1399 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 1)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 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 Int declared 1200/1200 variables, and 1399 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in SI_CTL mode, iteration 1 : 600/1985 places, 600/1985 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60959 ms. Remains : 600/1985 places, 600/1985 transitions.
[2025-06-05 13:44:27] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:44:27] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:44:27] [INFO ] Input system was already deterministic with 600 transitions.
[2025-06-05 13:44:27] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:44:27] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:44:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6034436659915458098.gal : 2 ms
[2025-06-05 13:44:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10519233163266190415.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/CTLFireability6034436659915458098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10519233163266190415.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.36101e+95,0.341834,14664,2,1001,5,41006,6,0,3003,50999,0


Converting to forward existential form...Done !
original formula: EF(EG((p1849==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p1849==1))] != FALSE
Hit Full ! (commute/partial/dont) 597/0/3
(forward)formula 0,1,1.46879,49788,1,0,8,323507,19,2,15173,50999,8
FORMULA ShieldRVt-PT-050B-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1952 transition count 1952
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1952 transition count 1952
Applied a total of 66 rules in 223 ms. Remains 1952 /1985 variables (removed 33) and now considering 1952/1985 (removed 33) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2025-06-05 13:44:29] [INFO ] Computed 201 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:44:29] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-06-05 13:44:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:44:31] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-06-05 13:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1985 places, 1952/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62601 ms. Remains : 1952/1985 places, 1952/1985 transitions.
[2025-06-05 13:45:31] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:45:31] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:45:31] [INFO ] Input system was already deterministic with 1952 transitions.
[2025-06-05 13:45:31] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:45:31] [INFO ] Flatten gal took : 36 ms
[2025-06-05 13:45:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12102823128605967231.gal : 5 ms
[2025-06-05 13:45:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15582807481356293121.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/CTLFireability12102823128605967231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15582807481356293121.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 13:46:01] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:46:01] [INFO ] Applying decomposition
[2025-06-05 13:46:01] [INFO ] Flatten gal took : 30 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/graph7248918301300008732.txt' '-o' '/tmp/graph7248918301300008732.bin' '-w' '/tmp/graph7248918301300008732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7248918301300008732.bin' '-l' '-1' '-v' '-w' '/tmp/graph7248918301300008732.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:46:01] [INFO ] Decomposing Gal with order
[2025-06-05 13:46:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:46:02] [INFO ] Removed a total of 498 redundant transitions.
[2025-06-05 13:46:02] [INFO ] Flatten gal took : 55 ms
[2025-06-05 13:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 13:46:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5944370982894764200.gal : 12 ms
[2025-06-05 13:46:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5635319859223928398.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/CTLFireability5944370982894764200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5635319859223928398.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 : 1985/1985 places, 1985/1985 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 550 transitions
Trivial Post-agglo rules discarded 550 transitions
Performed 550 trivial Post agglomeration. Transition count delta: 550
Iterating post reduction 0 with 550 rules applied. Total rules applied 550 place count 1984 transition count 1434
Reduce places removed 550 places and 0 transitions.
Iterating post reduction 1 with 550 rules applied. Total rules applied 1100 place count 1434 transition count 1434
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 380 Pre rules applied. Total rules applied 1100 place count 1434 transition count 1054
Deduced a syphon composed of 380 places in 2 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1860 place count 1054 transition count 1054
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1887 place count 1027 transition count 1027
Iterating global reduction 2 with 27 rules applied. Total rules applied 1914 place count 1027 transition count 1027
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 1914 place count 1027 transition count 1003
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 1962 place count 1003 transition count 1003
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 0 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 2758 place count 605 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2759 place count 605 transition count 604
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 2761 place count 604 transition count 603
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2763 place count 602 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2764 place count 601 transition count 601
Applied a total of 2764 rules in 186 ms. Remains 601 /1985 variables (removed 1384) and now considering 601/1985 (removed 1384) transitions.
// Phase 1: matrix 601 rows 601 cols
[2025-06-05 13:46:32] [INFO ] Computed 200 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:46:32] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-05 13:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:46:33] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:46:33] [INFO ] Redundant transitions in 4 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-05 13:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (OVERLAPS) 601/1202 variables, 601/801 constraints. Problems are: Problem set: 0 solved, 600 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 1202/1202 variables, and 801 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (OVERLAPS) 601/1202 variables, 601/801 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1202 variables, 600/1401 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1401 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in SI_CTL mode, iteration 1 : 601/1985 places, 601/1985 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60959 ms. Remains : 601/1985 places, 601/1985 transitions.
[2025-06-05 13:47:33] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:47:33] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:47:33] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-05 13:47:33] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:47:33] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:47:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7964948959699260033.gal : 2 ms
[2025-06-05 13:47:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14714598319327711385.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/CTLFireability7964948959699260033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14714598319327711385.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.14802e+95,0.3386,14660,2,1470,5,41048,6,0,3008,51083,0


Converting to forward existential form...Done !
original formula: E(EG(EF((p2397!=1))) U (p1256==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(E(TRUE U (p2397!=1)))) * (p1256==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, t9, t11, t13, t15, t18, t21, t25, t27, t31, t35, t37, t40, t43, t47, t49, t51, t5...716
Detected timeout of ITS tools.
[2025-06-05 13:48:03] [INFO ] Flatten gal took : 18 ms
[2025-06-05 13:48:03] [INFO ] Applying decomposition
[2025-06-05 13:48:03] [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/graph12082295864716903225.txt' '-o' '/tmp/graph12082295864716903225.bin' '-w' '/tmp/graph12082295864716903225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12082295864716903225.bin' '-l' '-1' '-v' '-w' '/tmp/graph12082295864716903225.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:48:03] [INFO ] Decomposing Gal with order
[2025-06-05 13:48:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:48:03] [INFO ] Removed a total of 148 redundant transitions.
[2025-06-05 13:48:03] [INFO ] Flatten gal took : 16 ms
[2025-06-05 13:48:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-05 13:48:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6712121223807265266.gal : 3 ms
[2025-06-05 13:48:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10815897297589313122.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/CTLFireability6712121223807265266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10815897297589313122.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,3.14802e+95,0.125189,8960,104,18,4560,106,445,7216,37,227,0


Converting to forward existential form...Done !
original formula: E(EG(EF((i27.u192.p2397!=1))) U (i14.u99.p1256==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(E(TRUE U (i27.u192.p2397!=1)))) * (i14.u99.p1256==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t4, i0.u2.t6, i0.u3.t9, i0.u4.t11, i1.i0.u5.t13, i1.i0.u6.t15, i1.i0.u7.t18, i1.i0.u8.t...1672
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
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1955 transition count 1955
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1955 transition count 1955
Applied a total of 60 rules in 222 ms. Remains 1955 /1985 variables (removed 30) and now considering 1955/1985 (removed 30) transitions.
// Phase 1: matrix 1955 rows 1955 cols
[2025-06-05 13:48:33] [INFO ] Computed 201 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:48:34] [INFO ] Implicit Places using invariants in 467 ms returned []
[2025-06-05 13:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:48:35] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
Running 1954 sub problems to find dead transitions.
[2025-06-05 13:48:35] [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 1954/3910 variables, and 0 constraints, problems are : Problem set: 0 solved, 1954 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1955 constraints, PredecessorRefiner: 1954/1954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1954 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 1954/3910 variables, and 0 constraints, problems are : Problem set: 0 solved, 1954 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1955 constraints, PredecessorRefiner: 0/1954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1954 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in LTL mode, iteration 1 : 1955/1985 places, 1955/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62595 ms. Remains : 1955/1985 places, 1955/1985 transitions.
[2025-06-05 13:49:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:49:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:49:36] [INFO ] Input system was already deterministic with 1955 transitions.
[2025-06-05 13:49:36] [INFO ] Flatten gal took : 42 ms
[2025-06-05 13:49:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:49:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15592628122961816722.gal : 5 ms
[2025-06-05 13:49:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7573600375295897213.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/CTLFireability15592628122961816722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7573600375295897213.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 13:50:06] [INFO ] Flatten gal took : 32 ms
[2025-06-05 13:50:06] [INFO ] Applying decomposition
[2025-06-05 13:50:06] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph435713469538454983.txt' '-o' '/tmp/graph435713469538454983.bin' '-w' '/tmp/graph435713469538454983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph435713469538454983.bin' '-l' '-1' '-v' '-w' '/tmp/graph435713469538454983.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:50:06] [INFO ] Decomposing Gal with order
[2025-06-05 13:50:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:50:06] [INFO ] Removed a total of 494 redundant transitions.
[2025-06-05 13:50:06] [INFO ] Flatten gal took : 54 ms
[2025-06-05 13:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 13:50:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13598138190068081012.gal : 12 ms
[2025-06-05 13:50:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9257523264915649414.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/CTLFireability13598138190068081012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9257523264915649414.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 : 1985/1985 places, 1985/1985 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1952 transition count 1952
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1952 transition count 1952
Applied a total of 66 rules in 233 ms. Remains 1952 /1985 variables (removed 33) and now considering 1952/1985 (removed 33) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2025-06-05 13:50:37] [INFO ] Computed 201 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:50:37] [INFO ] Implicit Places using invariants in 444 ms returned []
[2025-06-05 13:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:50:38] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-06-05 13:50:38] [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 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 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 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1985 places, 1952/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 1952/1985 places, 1952/1985 transitions.
[2025-06-05 13:51:39] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:51:39] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:51:39] [INFO ] Input system was already deterministic with 1952 transitions.
[2025-06-05 13:51:39] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:51:39] [INFO ] Flatten gal took : 35 ms
[2025-06-05 13:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3496886063573854370.gal : 6 ms
[2025-06-05 13:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11705338256042787946.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/CTLFireability3496886063573854370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11705338256042787946.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 13:52:09] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:52:09] [INFO ] Applying decomposition
[2025-06-05 13:52:09] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9969345989599634319.txt' '-o' '/tmp/graph9969345989599634319.bin' '-w' '/tmp/graph9969345989599634319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9969345989599634319.bin' '-l' '-1' '-v' '-w' '/tmp/graph9969345989599634319.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:52:09] [INFO ] Decomposing Gal with order
[2025-06-05 13:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:52:09] [INFO ] Removed a total of 499 redundant transitions.
[2025-06-05 13:52:09] [INFO ] Flatten gal took : 55 ms
[2025-06-05 13:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 13:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9927565622070212807.gal : 13 ms
[2025-06-05 13:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17066355055389475279.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/CTLFireability9927565622070212807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17066355055389475279.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 : 1985/1985 places, 1985/1985 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1984 transition count 1440
Reduce places removed 544 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 546 rules applied. Total rules applied 1090 place count 1440 transition count 1438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1092 place count 1438 transition count 1438
Performed 381 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 381 Pre rules applied. Total rules applied 1092 place count 1438 transition count 1057
Deduced a syphon composed of 381 places in 2 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 3 with 762 rules applied. Total rules applied 1854 place count 1057 transition count 1057
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1882 place count 1029 transition count 1029
Iterating global reduction 3 with 28 rules applied. Total rules applied 1910 place count 1029 transition count 1029
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 1910 place count 1029 transition count 1004
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1960 place count 1004 transition count 1004
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 0 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 2754 place count 607 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2755 place count 607 transition count 606
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 2757 place count 606 transition count 605
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2759 place count 604 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2760 place count 603 transition count 603
Applied a total of 2760 rules in 196 ms. Remains 603 /1985 variables (removed 1382) and now considering 603/1985 (removed 1382) transitions.
// Phase 1: matrix 603 rows 603 cols
[2025-06-05 13:52:40] [INFO ] Computed 200 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:52:40] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-05 13:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:52:40] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:52:40] [INFO ] Redundant transitions in 4 ms returned []
Running 601 sub problems to find dead transitions.
[2025-06-05 13:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/603 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 603/1206 variables, 603/803 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 803 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/603 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 603/1206 variables, 603/803 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 601/1404 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 13:53:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 1/1405 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 1405 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in SI_CTL mode, iteration 1 : 603/1985 places, 603/1985 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60959 ms. Remains : 603/1985 places, 603/1985 transitions.
[2025-06-05 13:53:41] [INFO ] Flatten gal took : 13 ms
[2025-06-05 13:53:41] [INFO ] Flatten gal took : 16 ms
[2025-06-05 13:53:41] [INFO ] Input system was already deterministic with 603 transitions.
[2025-06-05 13:53:41] [INFO ] Flatten gal took : 11 ms
[2025-06-05 13:53:41] [INFO ] Flatten gal took : 12 ms
[2025-06-05 13:53:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10626883985438157398.gal : 2 ms
[2025-06-05 13:53:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8393484664072441325.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/CTLFireability10626883985438157398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8393484664072441325.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.18688e+95,0.361534,15436,2,1022,5,43905,6,0,3017,55359,0


Converting to forward existential form...Done !
original formula: A((p685!=1) U !(E(EF((p89==1)) U (p1653==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(E(TRUE U (p89==1)) U (p1653==1))))))) * !(E(!(!(E(E(TRUE U (p89==1)) U (p1653==1)))) U (!((...221
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t9, t14, t26, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Detected timeout of ITS tools.
[2025-06-05 13:54:11] [INFO ] Flatten gal took : 18 ms
[2025-06-05 13:54:11] [INFO ] Applying decomposition
[2025-06-05 13:54:11] [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/graph7096361328419004904.txt' '-o' '/tmp/graph7096361328419004904.bin' '-w' '/tmp/graph7096361328419004904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7096361328419004904.bin' '-l' '-1' '-v' '-w' '/tmp/graph7096361328419004904.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:54:11] [INFO ] Decomposing Gal with order
[2025-06-05 13:54:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:54:11] [INFO ] Removed a total of 149 redundant transitions.
[2025-06-05 13:54:11] [INFO ] Flatten gal took : 18 ms
[2025-06-05 13:54:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 13:54:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4086063685908157120.gal : 4 ms
[2025-06-05 13:54:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4571097090888574877.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/CTLFireability4086063685908157120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4571097090888574877.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,3.18688e+95,0.135242,8984,65,14,5197,96,463,8881,35,168,0


Converting to forward existential form...Done !
original formula: A((i7.u53.p685!=1) U !(E(EF((i0.i0.u4.p89==1)) U (i18.i1.u132.p1653==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(E(TRUE U (i0.i0.u4.p89==1)) U (i18.i1.u132.p1653==1))))))) * !(E(!(!(E(E(TRUE U (i0.i0.u4.p...291
Reverse transition relation is NOT exact ! Due to transitions t26, i0.i0.t2, i0.i1.u1.t6, i0.i1.u2.t9, i0.i1.u5.t14, Intersection with reachable at each s...216
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 1985/1985 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1953 transition count 1953
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1953 transition count 1953
Applied a total of 64 rules in 217 ms. Remains 1953 /1985 variables (removed 32) and now considering 1953/1985 (removed 32) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2025-06-05 13:54:41] [INFO ] Computed 201 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:41] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-06-05 13:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:43] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Running 1952 sub problems to find dead transitions.
[2025-06-05 13:54:43] [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 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 1952/3906 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1953 constraints, PredecessorRefiner: 1952/1952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1952 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 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1952/3906 variables, and 0 constraints, problems are : Problem set: 0 solved, 1952 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1953 constraints, PredecessorRefiner: 0/1952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 1952 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in LTL mode, iteration 1 : 1953/1985 places, 1953/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62505 ms. Remains : 1953/1985 places, 1953/1985 transitions.
[2025-06-05 13:55:43] [INFO ] Flatten gal took : 27 ms
[2025-06-05 13:55:43] [INFO ] Flatten gal took : 37 ms
[2025-06-05 13:55:43] [INFO ] Input system was already deterministic with 1953 transitions.
[2025-06-05 13:55:43] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:55:43] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:55:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2982536890353794803.gal : 5 ms
[2025-06-05 13:55:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6459006146577765700.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/CTLFireability2982536890353794803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6459006146577765700.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 13:56:14] [INFO ] Flatten gal took : 32 ms
[2025-06-05 13:56:14] [INFO ] Applying decomposition
[2025-06-05 13:56:14] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6595151394116098357.txt' '-o' '/tmp/graph6595151394116098357.bin' '-w' '/tmp/graph6595151394116098357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6595151394116098357.bin' '-l' '-1' '-v' '-w' '/tmp/graph6595151394116098357.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:56:14] [INFO ] Decomposing Gal with order
[2025-06-05 13:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:56:14] [INFO ] Removed a total of 501 redundant transitions.
[2025-06-05 13:56:14] [INFO ] Flatten gal took : 53 ms
[2025-06-05 13:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 13:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9721723668453575921.gal : 11 ms
[2025-06-05 13:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14948985154195209367.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/CTLFireability9721723668453575921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14948985154195209367.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 : 1985/1985 places, 1985/1985 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1954 transition count 1954
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1954 transition count 1954
Applied a total of 62 rules in 223 ms. Remains 1954 /1985 variables (removed 31) and now considering 1954/1985 (removed 31) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2025-06-05 13:56:44] [INFO ] Computed 201 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:56:45] [INFO ] Implicit Places using invariants in 458 ms returned []
[2025-06-05 13:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:56:46] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 1953 sub problems to find dead transitions.
[2025-06-05 13:56:46] [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 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 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 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 0/1953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 1954/1985 places, 1954/1985 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62493 ms. Remains : 1954/1985 places, 1954/1985 transitions.
[2025-06-05 13:57:47] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:57:47] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:57:47] [INFO ] Input system was already deterministic with 1954 transitions.
[2025-06-05 13:57:47] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:57:47] [INFO ] Flatten gal took : 28 ms
[2025-06-05 13:57:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9780147531713874431.gal : 5 ms
[2025-06-05 13:57:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9722144855881198214.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/CTLFireability9780147531713874431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9722144855881198214.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 13:58:17] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:58:17] [INFO ] Applying decomposition
[2025-06-05 13:58:17] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5715487845341828761.txt' '-o' '/tmp/graph5715487845341828761.bin' '-w' '/tmp/graph5715487845341828761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5715487845341828761.bin' '-l' '-1' '-v' '-w' '/tmp/graph5715487845341828761.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:58:17] [INFO ] Decomposing Gal with order
[2025-06-05 13:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:58:17] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-05 13:58:17] [INFO ] Flatten gal took : 54 ms
[2025-06-05 13:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 13:58:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17685979770314637550.gal : 12 ms
[2025-06-05 13:58:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7636884618741485764.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/CTLFireability17685979770314637550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7636884618741485764.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.
[2025-06-05 13:58:47] [INFO ] Flatten gal took : 31 ms
[2025-06-05 13:58:47] [INFO ] Flatten gal took : 29 ms
[2025-06-05 13:58:47] [INFO ] Applying decomposition
[2025-06-05 13:58:47] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3785719329370589118.txt' '-o' '/tmp/graph3785719329370589118.bin' '-w' '/tmp/graph3785719329370589118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3785719329370589118.bin' '-l' '-1' '-v' '-w' '/tmp/graph3785719329370589118.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:58:47] [INFO ] Decomposing Gal with order
[2025-06-05 13:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:58:48] [INFO ] Removed a total of 477 redundant transitions.
[2025-06-05 13:58:48] [INFO ] Flatten gal took : 57 ms
[2025-06-05 13:58:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 13:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8691103562366442242.gal : 12 ms
[2025-06-05 13:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8430536827831735408.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/CTLFireability8691103562366442242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8430536827831735408.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 13 CTL formulae.

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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-050B"
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-050B, 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-174901994100330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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