About the Execution of ITS-Tools for ShieldPPPt-PT-030B
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 | ???????????????T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533600897.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 ShieldPPPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533600897
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 569K 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 ShieldPPPt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-15
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749313676718
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 16:27:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 16:27:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 16:27:58] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-07 16:27:58] [INFO ] Transformed 2343 places.
[2025-06-07 16:27:58] [INFO ] Transformed 2133 transitions.
[2025-06-07 16:27:58] [INFO ] Found NUPN structural information;
[2025-06-07 16:27:58] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 109 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 304 places :
Symmetric choice reduction at 0 with 304 rule applications. Total rules 304 place count 2039 transition count 1829
Iterating global reduction 0 with 304 rules applied. Total rules applied 608 place count 2039 transition count 1829
Applied a total of 608 rules in 434 ms. Remains 2039 /2343 variables (removed 304) and now considering 1829/2133 (removed 304) transitions.
// Phase 1: matrix 1829 rows 2039 cols
[2025-06-07 16:27:59] [INFO ] Computed 331 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:27:59] [INFO ] Implicit Places using invariants in 936 ms returned []
[2025-06-07 16:27:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:28:01] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2468 ms to find 0 implicit places.
Running 1828 sub problems to find dead transitions.
[2025-06-07 16:28:01] [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 2038/3868 variables, and 0 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2039 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1828 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 2038/3868 variables, and 0 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2039 constraints, PredecessorRefiner: 0/1828 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1828 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 2039/2343 places, 1829/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63510 ms. Remains : 2039/2343 places, 1829/2133 transitions.
Support contains 109 out of 2039 places after structural reductions.
[2025-06-07 16:29:02] [INFO ] Flatten gal took : 126 ms
[2025-06-07 16:29:02] [INFO ] Flatten gal took : 78 ms
[2025-06-07 16:29:02] [INFO ] Input system was already deterministic with 1829 transitions.
Support contains 104 out of 2039 places (down from 109) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1463 ms. (27 steps per ms) remains 23/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
[2025-06-07 16:29:03] [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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 484/530 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1509/2039 variables, 271/331 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2039 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1829/3868 variables, 2039/2370 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3868 variables, 0/2370 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/3868 variables, 0/2370 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3868/3868 variables, and 2370 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3786 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2039/2039 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 484/530 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:07] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:07] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:07] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:07] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1509/2039 variables, 271/335 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:08] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:08] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:09] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:09] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:09] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:09] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:09] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:10] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:10] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:10] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:10] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:10] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2039 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:11] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:12] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 11 ms to minimize.
SMT process timed out in 8826ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 46 out of 2039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2039/2039 places, 1829/1829 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2039 transition count 1439
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 392 rules applied. Total rules applied 782 place count 1649 transition count 1437
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 795 place count 1648 transition count 1425
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 807 place count 1636 transition count 1425
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 221 Pre rules applied. Total rules applied 807 place count 1636 transition count 1204
Deduced a syphon composed of 221 places in 2 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 4 with 442 rules applied. Total rules applied 1249 place count 1415 transition count 1204
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1266 place count 1398 transition count 1187
Iterating global reduction 4 with 17 rules applied. Total rules applied 1283 place count 1398 transition count 1187
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 1283 place count 1398 transition count 1173
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1311 place count 1384 transition count 1173
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 503
Deduced a syphon composed of 503 places in 1 ms
Reduce places removed 503 places and 0 transitions.
Iterating global reduction 4 with 1006 rules applied. Total rules applied 2317 place count 881 transition count 670
Renaming transitions due to excessive name length > 1024 char.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 2479 place count 800 transition count 670
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2482 place count 800 transition count 667
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2485 place count 797 transition count 667
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 5 with 78 rules applied. Total rules applied 2563 place count 797 transition count 667
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2564 place count 796 transition count 666
Applied a total of 2564 rules in 524 ms. Remains 796 /2039 variables (removed 1243) and now considering 666/1829 (removed 1163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 796/2039 places, 666/1829 transitions.
RANDOM walk for 40000 steps (8 resets) in 687 ms. (58 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
// Phase 1: matrix 666 rows 796 cols
[2025-06-07 16:29:13] [INFO ] Computed 331 invariants in 4 ms
[2025-06-07 16:29:13] [INFO ] State equation strengthened by 8 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 137/177 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 41/218 variables, 19/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 262/480 variables, 218/293 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 320/800 variables, 183/481 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/800 variables, 68/549 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 17/817 variables, 18/569 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/817 variables, 17/586 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/817 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 32/849 variables, 16/602 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/849 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 247/1096 variables, 159/761 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1096 variables, 50/811 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (OVERLAPS) 8/1104 variables, 8/819 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1104 variables, 8/827 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1104 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 16/1120 variables, 8/835 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (OVERLAPS) 179/1299 variables, 104/939 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 32/971 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1299 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (OVERLAPS) 11/1310 variables, 11/982 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1310 variables, 11/993 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1310 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 22/1332 variables, 11/1004 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1332 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 102/1434 variables, 76/1080 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1434 variables, 23/1103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1434 variables, 1/1104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1434 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 37 (OVERLAPS) 2/1436 variables, 2/1106 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1436 variables, 2/1108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1436 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 40 (OVERLAPS) 4/1440 variables, 2/1110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1440 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 42 (OVERLAPS) 22/1462 variables, 18/1128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1462 variables, 7/1135 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1462 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 45 (OVERLAPS) 0/1462 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1462/1462 variables, and 1135 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5507 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 796/796 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 137/177 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 41/218 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:18] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 262/480 variables, 218/295 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 320/800 variables, 183/490 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 68/558 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 13/573 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:19] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:19] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:19] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:20] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:20] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/800 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:20] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/800 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 17/817 variables, 18/597 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/817 variables, 17/614 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/817 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 32/849 variables, 16/630 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/849 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 247/1096 variables, 159/789 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1096 variables, 50/839 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1096 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (OVERLAPS) 8/1104 variables, 8/847 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1104 variables, 8/855 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:23] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1104 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:24] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1104 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1104 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 16/1120 variables, 8/865 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1120 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 179/1299 variables, 104/969 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1299 variables, 32/1001 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:26] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 3 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1299 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:27] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 4 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1299 variables, 1/1003 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:28] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:28] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:28] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:28] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:28] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:28] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1299 variables, 6/1009 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1299 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 11/1310 variables, 11/1020 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1310 variables, 11/1031 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:30] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:31] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1310 variables, 2/1033 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:31] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 3 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1310 variables, 1/1034 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1310 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 44 (OVERLAPS) 22/1332 variables, 11/1045 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1332 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 46 (OVERLAPS) 102/1434 variables, 76/1121 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1434 variables, 23/1144 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1434 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:34] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:34] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:34] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:35] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:36] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:36] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:36] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1434 variables, 15/1160 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1434 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 51 (OVERLAPS) 2/1436 variables, 2/1162 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1436 variables, 2/1164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1436 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 54 (OVERLAPS) 4/1440 variables, 2/1166 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1440 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 56 (OVERLAPS) 22/1462 variables, 18/1184 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1462 variables, 7/1191 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:40] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:40] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:40] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:41] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:41] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1462 variables, 5/1196 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:41] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 3 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1462 variables, 1/1197 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:43] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1462 variables, 1/1198 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1462 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 62 (OVERLAPS) 0/1462 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1462/1462 variables, and 1198 constraints, problems are : Problem set: 0 solved, 20 unsolved in 28196 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 796/796 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 30/30 constraints]
After SMT, in 33720ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 1721 ms.
Support contains 38 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 666/666 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 796 transition count 662
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 792 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 791 transition count 662
Applied a total of 10 rules in 132 ms. Remains 791 /796 variables (removed 5) and now considering 662/666 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 791/796 places, 662/666 transitions.
RANDOM walk for 40000 steps (8 resets) in 456 ms. (87 steps per ms) remains 14/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
// Phase 1: matrix 662 rows 791 cols
[2025-06-07 16:29:49] [INFO ] Computed 331 invariants in 4 ms
[2025-06-07 16:29:49] [INFO ] State equation strengthened by 8 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 91/118 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 30/148 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 186/334 variables, 148/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 297/631 variables, 159/361 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 54/415 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 22/653 variables, 21/437 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/653 variables, 17/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/653 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 55/708 variables, 25/479 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/708 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 276/984 variables, 188/667 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 49/716 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 10/994 variables, 10/728 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/994 variables, 8/736 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/994 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 14/1008 variables, 7/743 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1008 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1008 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 192/1200 variables, 111/856 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1200 variables, 35/891 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1200 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (OVERLAPS) 11/1211 variables, 12/903 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1211 variables, 11/914 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1211 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 20/1231 variables, 10/924 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1231 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 155/1386 variables, 98/1022 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1386 variables, 27/1049 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1386 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1386 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 7/1393 variables, 9/1060 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1393 variables, 7/1067 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1393 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (OVERLAPS) 8/1401 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1401 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (OVERLAPS) 49/1450 variables, 40/1111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1450 variables, 16/1127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1450 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (OVERLAPS) 3/1453 variables, 2/1129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1453 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1453 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (OVERLAPS) 0/1453 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1453/1453 variables, and 1130 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3472 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 791/791 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 91/118 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 30/148 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 186/334 variables, 148/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 297/631 variables, 159/365 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 54/419 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/631 variables, 9/429 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/631 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/631 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 22/653 variables, 21/452 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 17/469 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/653 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 55/708 variables, 25/494 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:54] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/708 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/708 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 276/984 variables, 188/683 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/984 variables, 49/732 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/984 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:55] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:55] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:55] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:55] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:55] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/984 variables, 5/739 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/984 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 10/994 variables, 10/749 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/994 variables, 8/757 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:56] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/994 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/994 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 14/1008 variables, 7/765 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1008 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:57] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:57] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1008 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1008 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 192/1200 variables, 111/880 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1200 variables, 35/915 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1200 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (OVERLAPS) 11/1211 variables, 12/927 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1211 variables, 11/938 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:58] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:29:58] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1211 variables, 2/940 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1211 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (OVERLAPS) 20/1231 variables, 10/950 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1231 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (OVERLAPS) 155/1386 variables, 98/1048 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1386 variables, 27/1075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1386 variables, 2/1077 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:00] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 5 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1386 variables, 1/1078 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:01] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1386 variables, 13/1091 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:02] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:02] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 3 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1386 variables, 2/1093 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1386 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (OVERLAPS) 7/1393 variables, 9/1102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1393 variables, 7/1109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1393 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (OVERLAPS) 8/1401 variables, 4/1113 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:05] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:05] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/1401 variables, 2/1115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1401 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (OVERLAPS) 49/1450 variables, 40/1155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1450 variables, 16/1171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:06] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:06] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:06] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:06] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:06] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:07] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:07] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1450 variables, 8/1179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1450 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (OVERLAPS) 3/1453 variables, 2/1181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1453 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1453 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (OVERLAPS) 0/1453 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1453/1453 variables, and 1182 constraints, problems are : Problem set: 0 solved, 13 unsolved in 17242 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 791/791 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 32/32 constraints]
After SMT, in 20728ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2677 ms.
Support contains 27 out of 791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 791/791 places, 662/662 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 791 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 790 transition count 661
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 790 transition count 658
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 787 transition count 658
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 780 transition count 651
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 778 transition count 651
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 776 transition count 649
Applied a total of 28 rules in 92 ms. Remains 776 /791 variables (removed 15) and now considering 649/662 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 776/791 places, 649/662 transitions.
RANDOM walk for 40000 steps (8 resets) in 448 ms. (89 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 130981 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 12
Probabilistic random walk after 130981 steps, saw 82469 distinct states, run finished after 3008 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 649 rows 776 cols
[2025-06-07 16:30:16] [INFO ] Computed 331 invariants in 2 ms
[2025-06-07 16:30:16] [INFO ] State equation strengthened by 6 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/109 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/139 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 175/314 variables, 139/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 293/607 variables, 157/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 57/406 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 16/623 variables, 17/424 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/623 variables, 16/440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/623 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 28/651 variables, 14/454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/651 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 281/932 variables, 170/624 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/932 variables, 52/676 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/932 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 11/943 variables, 13/689 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/943 variables, 11/700 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/943 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 18/961 variables, 9/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/961 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/961 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 207/1168 variables, 120/831 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1168 variables, 38/869 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1168 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 11/1179 variables, 12/881 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1179 variables, 11/892 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1179 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 20/1199 variables, 10/902 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1199 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 160/1359 variables, 102/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1359 variables, 30/1034 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1359 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1359 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 6/1365 variables, 8/1044 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1365 variables, 6/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1365 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 8/1373 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1373 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 49/1422 variables, 40/1094 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1422 variables, 16/1110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1422 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 3/1425 variables, 2/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1425 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1425 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 0/1425 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1425/1425 variables, and 1113 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3157 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 776/776 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/109 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/139 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 175/314 variables, 139/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 293/607 variables, 157/353 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 57/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/607 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/607 variables, 9/420 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 16/623 variables, 17/437 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/623 variables, 16/453 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/623 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/623 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 28/651 variables, 14/468 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/651 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 281/932 variables, 170/638 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/932 variables, 52/690 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/932 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 11/943 variables, 13/703 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/943 variables, 11/714 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/943 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 18/961 variables, 9/723 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/961 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/961 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 207/1168 variables, 120/845 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1168 variables, 38/883 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:22] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:23] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:23] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:23] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:23] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:23] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1168 variables, 6/889 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1168 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 11/1179 variables, 12/901 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1179 variables, 11/912 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1179 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 20/1199 variables, 10/922 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1199 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 160/1359 variables, 102/1024 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1359 variables, 30/1054 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1359 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:25] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:25] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:25] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:25] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1359 variables, 4/1060 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:26] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:26] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:26] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1359 variables, 3/1063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1359 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 6/1365 variables, 8/1071 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1365 variables, 6/1077 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1365 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 8/1373 variables, 4/1081 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1373 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 49/1422 variables, 40/1121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1422 variables, 16/1137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1422 variables, 2/1139 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:29] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:30] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:30] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:30] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1422 variables, 8/1147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1422 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 3/1425 variables, 2/1149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1425 variables, 1/1150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:31] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 4 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1425 variables, 1/1151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:32] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:32] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1425 variables, 2/1153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1425 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (OVERLAPS) 0/1425 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1425/1425 variables, and 1153 constraints, problems are : Problem set: 0 solved, 12 unsolved in 14237 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 776/776 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 23/23 constraints]
After SMT, in 17407ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1669 ms.
Support contains 26 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 649/649 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 775 transition count 648
Applied a total of 2 rules in 45 ms. Remains 775 /776 variables (removed 1) and now considering 648/649 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 775/776 places, 648/649 transitions.
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 135212 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 12
Probabilistic random walk after 135212 steps, saw 85262 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 648 rows 775 cols
[2025-06-07 16:30:39] [INFO ] Computed 331 invariants in 2 ms
[2025-06-07 16:30:39] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/109 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/139 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 175/314 variables, 139/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 292/606 variables, 157/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 58/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 15/621 variables, 16/424 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 15/439 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 28/649 variables, 14/453 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 281/930 variables, 170/623 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/930 variables, 52/675 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/930 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 11/941 variables, 13/688 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/941 variables, 11/699 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/941 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 18/959 variables, 9/708 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/959 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/959 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 207/1166 variables, 120/830 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1166 variables, 38/868 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1166 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 11/1177 variables, 12/880 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1177 variables, 11/891 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1177 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 20/1197 variables, 10/901 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1197 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 160/1357 variables, 102/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1357 variables, 30/1033 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1357 variables, 2/1035 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1357 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 6/1363 variables, 8/1043 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1363 variables, 6/1049 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1363 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 8/1371 variables, 4/1053 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1371 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 49/1420 variables, 40/1093 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1420 variables, 16/1109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1420 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 3/1423 variables, 2/1111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1423 variables, 1/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1423 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 0/1423 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1423/1423 variables, and 1112 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2980 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 775/775 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/109 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/139 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 175/314 variables, 139/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 292/606 variables, 157/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 58/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 9/420 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 15/621 variables, 16/436 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/621 variables, 15/451 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:43] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/621 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/621 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 28/649 variables, 14/466 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/649 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 281/930 variables, 170/636 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/930 variables, 52/688 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/930 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 11/941 variables, 13/701 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/941 variables, 11/712 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/941 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 18/959 variables, 9/721 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/959 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:45] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:45] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:45] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:45] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/959 variables, 4/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/959 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 207/1166 variables, 120/847 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1166 variables, 38/885 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:46] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:46] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1166 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1166 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 11/1177 variables, 12/899 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1177 variables, 11/910 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 20/1197 variables, 10/920 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1197 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 160/1357 variables, 102/1022 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1357 variables, 30/1052 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1357 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:48] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1357 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:49] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1357 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:50] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:50] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1357 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:50] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1357 variables, 1/1066 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:51] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1357 variables, 1/1067 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:51] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:51] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1357 variables, 2/1069 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:52] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 3 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1357 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1357 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 6/1363 variables, 8/1078 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1363 variables, 6/1084 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1363 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 8/1371 variables, 4/1088 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1371 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 49/1420 variables, 40/1128 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1420 variables, 16/1144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:54] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:54] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:54] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:55] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:55] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:55] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:55] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1420 variables, 7/1151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1420 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 3/1423 variables, 2/1153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1423 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:56] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1423 variables, 1/1155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1423 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:30:57] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 63 (OVERLAPS) 0/1423 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1423 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (OVERLAPS) 0/1423 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1423/1423 variables, and 1156 constraints, problems are : Problem set: 0 solved, 12 unsolved in 17404 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 775/775 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 29/29 constraints]
After SMT, in 20395ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2995 ms.
Support contains 26 out of 775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 648/648 transitions.
Applied a total of 0 rules in 17 ms. Remains 775 /775 variables (removed 0) and now considering 648/648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 775/775 places, 648/648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 648/648 transitions.
Applied a total of 0 rules in 16 ms. Remains 775 /775 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2025-06-07 16:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:31:03] [INFO ] Implicit Places using invariants in 511 ms returned []
[2025-06-07 16:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:31:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 16:31:04] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 16:31:04] [INFO ] Redundant transitions in 32 ms returned []
Running 638 sub problems to find dead transitions.
[2025-06-07 16:31:04] [INFO ] Invariant cache hit.
[2025-06-07 16:31:04] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 307/307 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:12] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:15] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:16] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:17] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:19] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:20] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:34] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.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 0.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 0.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 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 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 0.0)
(s646 1.0)
(s647 0.0)
(s648 1.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 1.0)
(s660 0.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 1.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 1.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1423 variables, and 363 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 307/331 constraints, State Equation: 0/775 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 307/307 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 56/363 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 3 (OVERLAPS) 8/775 variables, 24/387 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:49] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:50] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:50] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:50] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:51] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:31:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/1423 variables, and 395 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/775 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/638 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 638 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61380 ms. Remains : 775/775 places, 648/648 transitions.
[2025-06-07 16:32:04] [INFO ] Flatten gal took : 56 ms
[2025-06-07 16:32:04] [INFO ] Flatten gal took : 60 ms
[2025-06-07 16:32:04] [INFO ] Input system was already deterministic with 1829 transitions.
Computed a total of 484 stabilizing places and 484 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2039/2039 places, 1829/1829 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2012 transition count 1802
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2011 transition count 1801
Applied a total of 56 rules in 281 ms. Remains 2011 /2039 variables (removed 28) and now considering 1801/1829 (removed 28) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2025-06-07 16:32:05] [INFO ] Computed 331 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:32:05] [INFO ] Implicit Places using invariants in 635 ms returned []
[2025-06-07 16:32:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:32:07] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 16:32:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 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 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2039 places, 1801/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62864 ms. Remains : 2011/2039 places, 1801/1829 transitions.
[2025-06-07 16:33:07] [INFO ] Flatten gal took : 38 ms
[2025-06-07 16:33:07] [INFO ] Flatten gal took : 42 ms
[2025-06-07 16:33:07] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 16:33:07] [INFO ] Flatten gal took : 37 ms
[2025-06-07 16:33:07] [INFO ] Flatten gal took : 37 ms
[2025-06-07 16:33:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality18009321915595126490.gal : 28 ms
[2025-06-07 16:33:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14674507116003040547.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/CTLCardinality18009321915595126490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14674507116003040547.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-07 16:33:38] [INFO ] Flatten gal took : 37 ms
[2025-06-07 16:33:38] [INFO ] Applying decomposition
[2025-06-07 16:33:38] [INFO ] Flatten gal took : 37 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/graph7644301988520589423.txt' '-o' '/tmp/graph7644301988520589423.bin' '-w' '/tmp/graph7644301988520589423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7644301988520589423.bin' '-l' '-1' '-v' '-w' '/tmp/graph7644301988520589423.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:33:38] [INFO ] Decomposing Gal with order
[2025-06-07 16:33:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:33:38] [INFO ] Removed a total of 302 redundant transitions.
[2025-06-07 16:33:38] [INFO ] Flatten gal took : 142 ms
[2025-06-07 16:33:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2025-06-07 16:33:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality5205483586895502203.gal : 24 ms
[2025-06-07 16:33:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality9338689963697172563.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/CTLCardinality5205483586895502203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9338689963697172563.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2012 transition count 1802
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2011 transition count 1801
Applied a total of 56 rules in 294 ms. Remains 2011 /2039 variables (removed 28) and now considering 1801/1829 (removed 28) transitions.
[2025-06-07 16:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:34:09] [INFO ] Implicit Places using invariants in 611 ms returned []
[2025-06-07 16:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:34:11] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 16:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 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 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2039 places, 1801/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62866 ms. Remains : 2011/2039 places, 1801/1829 transitions.
[2025-06-07 16:35:11] [INFO ] Flatten gal took : 37 ms
[2025-06-07 16:35:11] [INFO ] Flatten gal took : 36 ms
[2025-06-07 16:35:11] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 16:35:11] [INFO ] Flatten gal took : 35 ms
[2025-06-07 16:35:11] [INFO ] Flatten gal took : 35 ms
[2025-06-07 16:35:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality6389698323084936328.gal : 6 ms
[2025-06-07 16:35:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5636803082710940717.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/CTLCardinality6389698323084936328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5636803082710940717.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-07 16:35:42] [INFO ] Flatten gal took : 35 ms
[2025-06-07 16:35:42] [INFO ] Applying decomposition
[2025-06-07 16:35:42] [INFO ] Flatten gal took : 33 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/graph7102318855891458040.txt' '-o' '/tmp/graph7102318855891458040.bin' '-w' '/tmp/graph7102318855891458040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7102318855891458040.bin' '-l' '-1' '-v' '-w' '/tmp/graph7102318855891458040.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:35:42] [INFO ] Decomposing Gal with order
[2025-06-07 16:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:35:42] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 16:35:42] [INFO ] Flatten gal took : 104 ms
[2025-06-07 16:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-07 16:35:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5735404326884161751.gal : 15 ms
[2025-06-07 16:35:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1981530673602403991.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/CTLCardinality5735404326884161751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1981530673602403991.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 : 2039/2039 places, 1829/1829 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 405 transitions
Trivial Post-agglo rules discarded 405 transitions
Performed 405 trivial Post agglomeration. Transition count delta: 405
Iterating post reduction 0 with 405 rules applied. Total rules applied 405 place count 2038 transition count 1423
Reduce places removed 405 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 407 rules applied. Total rules applied 812 place count 1633 transition count 1421
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 817 place count 1632 transition count 1417
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 821 place count 1628 transition count 1417
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 220 Pre rules applied. Total rules applied 821 place count 1628 transition count 1197
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 4 with 440 rules applied. Total rules applied 1261 place count 1408 transition count 1197
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1278 place count 1391 transition count 1180
Iterating global reduction 4 with 17 rules applied. Total rules applied 1295 place count 1391 transition count 1180
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 1295 place count 1391 transition count 1164
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1327 place count 1375 transition count 1164
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 1 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 4 with 950 rules applied. Total rules applied 2277 place count 900 transition count 689
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2279 place count 898 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2280 place count 897 transition count 687
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2280 place count 897 transition count 685
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2284 place count 895 transition count 685
Applied a total of 2284 rules in 287 ms. Remains 895 /2039 variables (removed 1144) and now considering 685/1829 (removed 1144) transitions.
// Phase 1: matrix 685 rows 895 cols
[2025-06-07 16:36:12] [INFO ] Computed 330 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:36:13] [INFO ] Implicit Places using invariants in 394 ms returned [874, 878]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 395 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 893/2039 places, 685/1829 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 891 transition count 683
Applied a total of 4 rules in 38 ms. Remains 891 /893 variables (removed 2) and now considering 683/685 (removed 2) transitions.
// Phase 1: matrix 683 rows 891 cols
[2025-06-07 16:36:13] [INFO ] Computed 328 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:36:13] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-06-07 16:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:36:14] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 891/2039 places, 683/1829 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1774 ms. Remains : 891/2039 places, 683/1829 transitions.
[2025-06-07 16:36:14] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:36:14] [INFO ] Flatten gal took : 16 ms
[2025-06-07 16:36:14] [INFO ] Input system was already deterministic with 683 transitions.
[2025-06-07 16:36:14] [INFO ] Flatten gal took : 16 ms
[2025-06-07 16:36:14] [INFO ] Flatten gal took : 16 ms
[2025-06-07 16:36:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality17019763021944290644.gal : 3 ms
[2025-06-07 16:36:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13233945143734915720.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/CTLCardinality17019763021944290644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13233945143734915720.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.66574e+129,8.46752,218008,2,3490,5,831936,6,0,4243,1.51246e+06,0
Converting to forward existential form...Done !
original formula: (EG((A(((EF(((p844==0)||(p1856==1))) * AF((p1041==0))) * (p2262==1)) U (p1997==1)) + (p2341==1))) + E((A(EG((p209==0)) U EG(((p1732==0)||...383
=> equivalent forward existential formula: ([FwdG(Init,(!((E(!((p1997==1)) U (!(((E(TRUE U ((p844==0)||(p1856==1))) * !(EG(!((p1041==0))))) * (p2262==1))) ...963
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1219
Detected timeout of ITS tools.
[2025-06-07 16:36:44] [INFO ] Flatten gal took : 16 ms
[2025-06-07 16:36:44] [INFO ] Applying decomposition
[2025-06-07 16:36:44] [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/graph10014333170304567535.txt' '-o' '/tmp/graph10014333170304567535.bin' '-w' '/tmp/graph10014333170304567535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10014333170304567535.bin' '-l' '-1' '-v' '-w' '/tmp/graph10014333170304567535.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:36:44] [INFO ] Decomposing Gal with order
[2025-06-07 16:36:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:36:44] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-07 16:36:44] [INFO ] Flatten gal took : 44 ms
[2025-06-07 16:36:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 14 ms.
[2025-06-07 16:36:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16617596330116869321.gal : 7 ms
[2025-06-07 16:36:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1316367371549129710.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/CTLCardinality16617596330116869321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1316367371549129710.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2013 transition count 1803
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2013 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2012 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2012 transition count 1802
Applied a total of 54 rules in 290 ms. Remains 2012 /2039 variables (removed 27) and now considering 1802/1829 (removed 27) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2025-06-07 16:37:15] [INFO ] Computed 331 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:37:15] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-06-07 16:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:37:17] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
Running 1801 sub problems to find dead transitions.
[2025-06-07 16:37:17] [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 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 1801/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1801 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 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 0/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 1801 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 2012/2039 places, 1802/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62866 ms. Remains : 2012/2039 places, 1802/1829 transitions.
[2025-06-07 16:38:17] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:38:17] [INFO ] Flatten gal took : 42 ms
[2025-06-07 16:38:17] [INFO ] Input system was already deterministic with 1802 transitions.
[2025-06-07 16:38:17] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:38:17] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:38:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7424607926483500019.gal : 6 ms
[2025-06-07 16:38:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15690010934700313088.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/CTLCardinality7424607926483500019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15690010934700313088.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-07 16:38:47] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:38:47] [INFO ] Applying decomposition
[2025-06-07 16:38:47] [INFO ] Flatten gal took : 31 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/graph17027353369968934396.txt' '-o' '/tmp/graph17027353369968934396.bin' '-w' '/tmp/graph17027353369968934396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17027353369968934396.bin' '-l' '-1' '-v' '-w' '/tmp/graph17027353369968934396.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:38:48] [INFO ] Decomposing Gal with order
[2025-06-07 16:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:38:48] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 16:38:48] [INFO ] Flatten gal took : 62 ms
[2025-06-07 16:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-07 16:38:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality1864403622994919405.gal : 13 ms
[2025-06-07 16:38:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9638217171080144369.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/CTLCardinality1864403622994919405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9638217171080144369.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2012 transition count 1802
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2011 transition count 1801
Applied a total of 56 rules in 289 ms. Remains 2011 /2039 variables (removed 28) and now considering 1801/1829 (removed 28) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2025-06-07 16:39:18] [INFO ] Computed 331 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:39:19] [INFO ] Implicit Places using invariants in 582 ms returned []
[2025-06-07 16:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:39:20] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 16:39:20] [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 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 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 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2039 places, 1801/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62864 ms. Remains : 2011/2039 places, 1801/1829 transitions.
[2025-06-07 16:40:21] [INFO ] Flatten gal took : 34 ms
[2025-06-07 16:40:21] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:40:21] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 16:40:21] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:40:21] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:40:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality9023226769557816058.gal : 7 ms
[2025-06-07 16:40:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9260162848278941386.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/CTLCardinality9023226769557816058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9260162848278941386.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-07 16:40:51] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:40:51] [INFO ] Applying decomposition
[2025-06-07 16:40:51] [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/graph9499952578795774457.txt' '-o' '/tmp/graph9499952578795774457.bin' '-w' '/tmp/graph9499952578795774457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9499952578795774457.bin' '-l' '-1' '-v' '-w' '/tmp/graph9499952578795774457.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:40:51] [INFO ] Decomposing Gal with order
[2025-06-07 16:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:40:51] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 16:40:51] [INFO ] Flatten gal took : 58 ms
[2025-06-07 16:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-07 16:40:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2297524685567703309.gal : 16 ms
[2025-06-07 16:40:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality126014528461552622.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/CTLCardinality2297524685567703309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality126014528461552622.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2039/2039 places, 1829/1829 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2012 transition count 1802
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 2011 transition count 1801
Applied a total of 56 rules in 287 ms. Remains 2011 /2039 variables (removed 28) and now considering 1801/1829 (removed 28) transitions.
[2025-06-07 16:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:41:22] [INFO ] Implicit Places using invariants in 575 ms returned []
[2025-06-07 16:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:41:24] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 16:41:24] [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 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s178 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
)
(s179 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2039 places, 1801/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62813 ms. Remains : 2011/2039 places, 1801/1829 transitions.
[2025-06-07 16:42:24] [INFO ] Flatten gal took : 28 ms
[2025-06-07 16:42:24] [INFO ] Flatten gal took : 38 ms
[2025-06-07 16:42:24] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 16:42:24] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:42:24] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:42:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9908387901211921830.gal : 5 ms
[2025-06-07 16:42:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12304584663652350203.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/CTLCardinality9908387901211921830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12304584663652350203.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-07 16:42:55] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:42:55] [INFO ] Applying decomposition
[2025-06-07 16:42:55] [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/graph8619904859119379076.txt' '-o' '/tmp/graph8619904859119379076.bin' '-w' '/tmp/graph8619904859119379076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8619904859119379076.bin' '-l' '-1' '-v' '-w' '/tmp/graph8619904859119379076.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:42:55] [INFO ] Decomposing Gal with order
[2025-06-07 16:42:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:42:55] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 16:42:55] [INFO ] Flatten gal took : 54 ms
[2025-06-07 16:42:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13798863101935998334.gal : 12 ms
[2025-06-07 16:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14930871069896021659.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/CTLCardinality13798863101935998334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14930871069896021659.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2017 transition count 1807
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2017 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 2016 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 2016 transition count 1806
Applied a total of 46 rules in 274 ms. Remains 2016 /2039 variables (removed 23) and now considering 1806/1829 (removed 23) transitions.
// Phase 1: matrix 1806 rows 2016 cols
[2025-06-07 16:43:25] [INFO ] Computed 331 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:43:26] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-06-07 16:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:43:27] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
Running 1805 sub problems to find dead transitions.
[2025-06-07 16:43:27] [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 timeout
1.0)
(s1765 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2015/3822 variables, and 0 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2016 constraints, PredecessorRefiner: 1805/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1805 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 2015/3822 variables, and 0 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2016 constraints, PredecessorRefiner: 0/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 1805 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in LTL mode, iteration 1 : 2016/2039 places, 1806/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62779 ms. Remains : 2016/2039 places, 1806/1829 transitions.
[2025-06-07 16:44:28] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:44:28] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:44:28] [INFO ] Input system was already deterministic with 1806 transitions.
[2025-06-07 16:44:28] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:44:28] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:44:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7693394518438247497.gal : 7 ms
[2025-06-07 16:44:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality15652628109408948716.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/CTLCardinality7693394518438247497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15652628109408948716.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-07 16:44:58] [INFO ] Flatten gal took : 32 ms
[2025-06-07 16:44:58] [INFO ] Applying decomposition
[2025-06-07 16:44:58] [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/graph13202377814723877731.txt' '-o' '/tmp/graph13202377814723877731.bin' '-w' '/tmp/graph13202377814723877731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13202377814723877731.bin' '-l' '-1' '-v' '-w' '/tmp/graph13202377814723877731.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:44:58] [INFO ] Decomposing Gal with order
[2025-06-07 16:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:44:58] [INFO ] Removed a total of 299 redundant transitions.
[2025-06-07 16:44:58] [INFO ] Flatten gal took : 56 ms
[2025-06-07 16:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:44:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality14967679807489358188.gal : 12 ms
[2025-06-07 16:44:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3575573126791615180.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/CTLCardinality14967679807489358188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3575573126791615180.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2013 transition count 1803
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2013 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2012 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2012 transition count 1802
Applied a total of 54 rules in 299 ms. Remains 2012 /2039 variables (removed 27) and now considering 1802/1829 (removed 27) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2025-06-07 16:45:29] [INFO ] Computed 331 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:45:29] [INFO ] Implicit Places using invariants in 574 ms returned []
[2025-06-07 16:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:45:31] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
Running 1801 sub problems to find dead transitions.
[2025-06-07 16:45: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 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 1801/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1801 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 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 0/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 1801 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 2012/2039 places, 1802/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62795 ms. Remains : 2012/2039 places, 1802/1829 transitions.
[2025-06-07 16:46:31] [INFO ] Flatten gal took : 28 ms
[2025-06-07 16:46:31] [INFO ] Flatten gal took : 28 ms
[2025-06-07 16:46:31] [INFO ] Input system was already deterministic with 1802 transitions.
[2025-06-07 16:46:31] [INFO ] Flatten gal took : 28 ms
[2025-06-07 16:46:31] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:46:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4981911178190328300.gal : 5 ms
[2025-06-07 16:46:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality2808426941212686944.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/CTLCardinality4981911178190328300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2808426941212686944.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-07 16:47:02] [INFO ] Flatten gal took : 34 ms
[2025-06-07 16:47:02] [INFO ] Applying decomposition
[2025-06-07 16:47:02] [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/graph6133234170292416488.txt' '-o' '/tmp/graph6133234170292416488.bin' '-w' '/tmp/graph6133234170292416488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6133234170292416488.bin' '-l' '-1' '-v' '-w' '/tmp/graph6133234170292416488.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:47:02] [INFO ] Decomposing Gal with order
[2025-06-07 16:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:47:02] [INFO ] Removed a total of 302 redundant transitions.
[2025-06-07 16:47:02] [INFO ] Flatten gal took : 54 ms
[2025-06-07 16:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:47:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2766668790545257941.gal : 12 ms
[2025-06-07 16:47:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6314801446100111627.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/CTLCardinality2766668790545257941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6314801446100111627.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2013 transition count 1803
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2013 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 2012 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 2012 transition count 1802
Applied a total of 54 rules in 283 ms. Remains 2012 /2039 variables (removed 27) and now considering 1802/1829 (removed 27) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2025-06-07 16:47:32] [INFO ] Computed 331 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:47:33] [INFO ] Implicit Places using invariants in 631 ms returned []
[2025-06-07 16:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:47:34] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Running 1801 sub problems to find dead transitions.
[2025-06-07 16:47:34] [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)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 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 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 1801/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1801 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 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 0/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1801 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in LTL mode, iteration 1 : 2012/2039 places, 1802/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62870 ms. Remains : 2012/2039 places, 1802/1829 transitions.
[2025-06-07 16:48:35] [INFO ] Flatten gal took : 35 ms
[2025-06-07 16:48:35] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:48:35] [INFO ] Input system was already deterministic with 1802 transitions.
[2025-06-07 16:48:35] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:48:35] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:48:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9605183335715236778.gal : 6 ms
[2025-06-07 16:48:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality7616854205058863377.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/CTLCardinality9605183335715236778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7616854205058863377.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-07 16:49:05] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:49:05] [INFO ] Applying decomposition
[2025-06-07 16:49:05] [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/graph8013167336658269538.txt' '-o' '/tmp/graph8013167336658269538.bin' '-w' '/tmp/graph8013167336658269538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8013167336658269538.bin' '-l' '-1' '-v' '-w' '/tmp/graph8013167336658269538.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:49:05] [INFO ] Decomposing Gal with order
[2025-06-07 16:49:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:49:05] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 16:49:05] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:49:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 16:49:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4124760187319164844.gal : 13 ms
[2025-06-07 16:49:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10399399919490333130.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/CTLCardinality4124760187319164844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10399399919490333130.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 : 2039/2039 places, 1829/1829 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2014 transition count 1804
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2014 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 2013 transition count 1803
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 2013 transition count 1803
Applied a total of 52 rules in 277 ms. Remains 2013 /2039 variables (removed 26) and now considering 1803/1829 (removed 26) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2025-06-07 16:49:36] [INFO ] Computed 331 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:49:36] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-06-07 16:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:49:38] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
Running 1802 sub problems to find dead transitions.
[2025-06-07 16:49:38] [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 2012/3816 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2013 constraints, PredecessorRefiner: 1802/1802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1802 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 2012/3816 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2013 constraints, PredecessorRefiner: 0/1802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 1802 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Starting structural reductions in LTL mode, iteration 1 : 2013/2039 places, 1803/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62711 ms. Remains : 2013/2039 places, 1803/1829 transitions.
[2025-06-07 16:50:38] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:50:38] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:50:38] [INFO ] Input system was already deterministic with 1803 transitions.
[2025-06-07 16:50:38] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:50:38] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:50:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality6667171250497717900.gal : 5 ms
[2025-06-07 16:50:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1828246271831312519.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/CTLCardinality6667171250497717900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1828246271831312519.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-07 16:51:08] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:51:08] [INFO ] Applying decomposition
[2025-06-07 16:51:09] [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/graph6842842902521789412.txt' '-o' '/tmp/graph6842842902521789412.bin' '-w' '/tmp/graph6842842902521789412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6842842902521789412.bin' '-l' '-1' '-v' '-w' '/tmp/graph6842842902521789412.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:51:09] [INFO ] Decomposing Gal with order
[2025-06-07 16:51:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:51:09] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-07 16:51:09] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:51:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 16:51:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality16634092126478405407.gal : 11 ms
[2025-06-07 16:51:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality3273844776398424712.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/CTLCardinality16634092126478405407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3273844776398424712.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 : 2039/2039 places, 1829/1829 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2038 transition count 1408
Reduce places removed 420 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 422 rules applied. Total rules applied 842 place count 1618 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 843 place count 1617 transition count 1406
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 225 Pre rules applied. Total rules applied 843 place count 1617 transition count 1181
Deduced a syphon composed of 225 places in 2 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1293 place count 1392 transition count 1181
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1315 place count 1370 transition count 1159
Iterating global reduction 3 with 22 rules applied. Total rules applied 1337 place count 1370 transition count 1159
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1337 place count 1370 transition count 1139
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1377 place count 1350 transition count 1139
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 3 with 954 rules applied. Total rules applied 2331 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2333 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2334 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2334 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2338 place count 868 transition count 658
Applied a total of 2338 rules in 259 ms. Remains 868 /2039 variables (removed 1171) and now considering 658/1829 (removed 1171) transitions.
// Phase 1: matrix 658 rows 868 cols
[2025-06-07 16:51:39] [INFO ] Computed 330 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:51:40] [INFO ] Implicit Places using invariants in 380 ms returned [848, 852]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 381 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 866/2039 places, 658/1829 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 864 transition count 656
Applied a total of 4 rules in 33 ms. Remains 864 /866 variables (removed 2) and now considering 656/658 (removed 2) transitions.
// Phase 1: matrix 656 rows 864 cols
[2025-06-07 16:51:40] [INFO ] Computed 328 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:51:40] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-07 16:51:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:51:41] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 864/2039 places, 656/1829 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1756 ms. Remains : 864/2039 places, 656/1829 transitions.
[2025-06-07 16:51:41] [INFO ] Flatten gal took : 13 ms
[2025-06-07 16:51:41] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:51:41] [INFO ] Input system was already deterministic with 656 transitions.
[2025-06-07 16:51:41] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:51:41] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:51:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality13855601508261346132.gal : 2 ms
[2025-06-07 16:51:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality11797361487640531360.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/CTLCardinality13855601508261346132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11797361487640531360.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12809e+128,2.43855,81492,2,1575,5,302442,6,0,4115,521128,0
Converting to forward existential form...Done !
original formula: EG(AG(AF(((p493==0)&&(p1757==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!(((p493==0)&&(p1757==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 651/0/5
Detected timeout of ITS tools.
[2025-06-07 16:52:11] [INFO ] Flatten gal took : 19 ms
[2025-06-07 16:52:11] [INFO ] Applying decomposition
[2025-06-07 16:52:11] [INFO ] Flatten gal took : 14 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/graph12531686001203221550.txt' '-o' '/tmp/graph12531686001203221550.bin' '-w' '/tmp/graph12531686001203221550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12531686001203221550.bin' '-l' '-1' '-v' '-w' '/tmp/graph12531686001203221550.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:52:11] [INFO ] Decomposing Gal with order
[2025-06-07 16:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:52:11] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-07 16:52:11] [INFO ] Flatten gal took : 19 ms
[2025-06-07 16:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-06-07 16:52:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8854296801267293733.gal : 4 ms
[2025-06-07 16:52:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2772572441368773803.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/CTLCardinality8854296801267293733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2772572441368773803.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12809e+128,15.6896,484388,160,18,952055,197,919,2.73897e+06,46,1020,0
Converting to forward existential form...Done !
original formula: EG(AG(AF(((i6.u48.p493==0)&&(i20.u180.p1757==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!(((i6.u48.p493==0)&&(i20.u180.p1757==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2039/2039 places, 1829/1829 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2038 transition count 1410
Reduce places removed 418 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 838 place count 1620 transition count 1408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 839 place count 1619 transition count 1408
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 227 Pre rules applied. Total rules applied 839 place count 1619 transition count 1181
Deduced a syphon composed of 227 places in 3 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 3 with 454 rules applied. Total rules applied 1293 place count 1392 transition count 1181
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1315 place count 1370 transition count 1159
Iterating global reduction 3 with 22 rules applied. Total rules applied 1337 place count 1370 transition count 1159
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1337 place count 1370 transition count 1139
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1377 place count 1350 transition count 1139
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 3 with 954 rules applied. Total rules applied 2331 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2332 place count 873 transition count 662
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2334 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2335 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2339 place count 868 transition count 658
Applied a total of 2339 rules in 298 ms. Remains 868 /2039 variables (removed 1171) and now considering 658/1829 (removed 1171) transitions.
// Phase 1: matrix 658 rows 868 cols
[2025-06-07 16:52:41] [INFO ] Computed 330 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:42] [INFO ] Implicit Places using invariants in 377 ms returned [848, 852]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 378 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 866/2039 places, 658/1829 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 864 transition count 656
Applied a total of 4 rules in 33 ms. Remains 864 /866 variables (removed 2) and now considering 656/658 (removed 2) transitions.
// Phase 1: matrix 656 rows 864 cols
[2025-06-07 16:52:42] [INFO ] Computed 328 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:42] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-07 16:52:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:43] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 864/2039 places, 656/1829 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1776 ms. Remains : 864/2039 places, 656/1829 transitions.
[2025-06-07 16:52:43] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:52:43] [INFO ] Flatten gal took : 16 ms
[2025-06-07 16:52:43] [INFO ] Input system was already deterministic with 656 transitions.
[2025-06-07 16:52:43] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:52:43] [INFO ] Flatten gal took : 17 ms
[2025-06-07 16:52:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3557952393676017738.gal : 3 ms
[2025-06-07 16:52:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15248084641903607303.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/CTLCardinality3557952393676017738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15248084641903607303.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83252e+128,2.34596,84228,2,1607,5,309971,6,0,4114,536876,0
Converting to forward existential form...Done !
original formula: EG(((p158==0)||(p1738==1)))
=> equivalent forward existential formula: [FwdG(Init,((p158==0)||(p1738==1)))] != FALSE
Hit Full ! (commute/partial/dont) 651/0/5
(forward)formula 0,1,8.0456,232976,1,0,9,1.25325e+06,19,4,19939,1.05277e+06,8
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 2039/2039 places, 1829/1829 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2016 transition count 1806
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2016 transition count 1806
Applied a total of 46 rules in 177 ms. Remains 2016 /2039 variables (removed 23) and now considering 1806/1829 (removed 23) transitions.
// Phase 1: matrix 1806 rows 2016 cols
[2025-06-07 16:52:51] [INFO ] Computed 331 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:52] [INFO ] Implicit Places using invariants in 571 ms returned []
[2025-06-07 16:52:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:53] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Running 1805 sub problems to find dead transitions.
[2025-06-07 16:52:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2015/3822 variables, and 0 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2016 constraints, PredecessorRefiner: 1805/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s489 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
)
(s490 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2015/3822 variables, and 0 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2016 constraints, PredecessorRefiner: 0/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 1805 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in LTL mode, iteration 1 : 2016/2039 places, 1806/1829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62656 ms. Remains : 2016/2039 places, 1806/1829 transitions.
[2025-06-07 16:53:54] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:53:54] [INFO ] Flatten gal took : 38 ms
[2025-06-07 16:53:54] [INFO ] Input system was already deterministic with 1806 transitions.
[2025-06-07 16:53:54] [INFO ] Flatten gal took : 33 ms
[2025-06-07 16:53:54] [INFO ] Flatten gal took : 33 ms
[2025-06-07 16:53:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4411000903045962927.gal : 6 ms
[2025-06-07 16:53:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2144053921324267749.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/CTLCardinality4411000903045962927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2144053921324267749.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-07 16:54:24] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:54:24] [INFO ] Applying decomposition
[2025-06-07 16:54:24] [INFO ] Flatten gal took : 31 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/graph921431422978234486.txt' '-o' '/tmp/graph921431422978234486.bin' '-w' '/tmp/graph921431422978234486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph921431422978234486.bin' '-l' '-1' '-v' '-w' '/tmp/graph921431422978234486.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:54:24] [INFO ] Decomposing Gal with order
[2025-06-07 16:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:54:24] [INFO ] Removed a total of 295 redundant transitions.
[2025-06-07 16:54:24] [INFO ] Flatten gal took : 52 ms
[2025-06-07 16:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:54:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9609890405397372454.gal : 11 ms
[2025-06-07 16:54:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2132463644911328875.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/CTLCardinality9609890405397372454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2132463644911328875.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 : 2039/2039 places, 1829/1829 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2038 transition count 1409
Reduce places removed 419 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 421 rules applied. Total rules applied 840 place count 1619 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 841 place count 1618 transition count 1407
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 225 Pre rules applied. Total rules applied 841 place count 1618 transition count 1182
Deduced a syphon composed of 225 places in 2 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1291 place count 1393 transition count 1182
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1310 place count 1374 transition count 1163
Iterating global reduction 3 with 19 rules applied. Total rules applied 1329 place count 1374 transition count 1163
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1329 place count 1374 transition count 1145
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1365 place count 1356 transition count 1145
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 476
Deduced a syphon composed of 476 places in 1 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 3 with 952 rules applied. Total rules applied 2317 place count 880 transition count 669
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2319 place count 878 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2320 place count 877 transition count 667
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2320 place count 877 transition count 665
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2324 place count 875 transition count 665
Applied a total of 2324 rules in 222 ms. Remains 875 /2039 variables (removed 1164) and now considering 665/1829 (removed 1164) transitions.
// Phase 1: matrix 665 rows 875 cols
[2025-06-07 16:54:55] [INFO ] Computed 330 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:54:55] [INFO ] Implicit Places using invariants in 353 ms returned [854, 858]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 354 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 873/2039 places, 665/1829 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 871 transition count 663
Applied a total of 4 rules in 32 ms. Remains 871 /873 variables (removed 2) and now considering 663/665 (removed 2) transitions.
// Phase 1: matrix 663 rows 871 cols
[2025-06-07 16:54:55] [INFO ] Computed 328 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:54:55] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-06-07 16:54:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:54:56] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 871/2039 places, 663/1829 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1599 ms. Remains : 871/2039 places, 663/1829 transitions.
[2025-06-07 16:54:56] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:54:56] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:54:56] [INFO ] Input system was already deterministic with 663 transitions.
[2025-06-07 16:54:56] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:54:56] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2727807030020765151.gal : 2 ms
[2025-06-07 16:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality14372161130121775412.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/CTLCardinality2727807030020765151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14372161130121775412.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.04436e+128,3.20051,105612,2,2392,5,396686,6,0,4148,693665,0
Converting to forward existential form...Done !
original formula: EG(A(!(((((p2312==0)&&(p1809==1)) + A((p1767==0) U (p113==0))) + !(((p2026==0)&&(p1440==1))))) U AF(AG((p1069==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!(!(E(TRUE U !((p1069==1)))))))) U (!(!(((((p2312==0)&&(p1809==1)) + !((E(!((p113==0)) U ...344
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1096
Detected timeout of ITS tools.
[2025-06-07 16:55:26] [INFO ] Flatten gal took : 17 ms
[2025-06-07 16:55:26] [INFO ] Applying decomposition
[2025-06-07 16:55:26] [INFO ] Flatten gal took : 14 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/graph13036308295810880528.txt' '-o' '/tmp/graph13036308295810880528.bin' '-w' '/tmp/graph13036308295810880528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13036308295810880528.bin' '-l' '-1' '-v' '-w' '/tmp/graph13036308295810880528.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:55:26] [INFO ] Decomposing Gal with order
[2025-06-07 16:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:55:26] [INFO ] Removed a total of 88 redundant transitions.
[2025-06-07 16:55:26] [INFO ] Flatten gal took : 20 ms
[2025-06-07 16:55:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-07 16:55:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2731743033084252193.gal : 5 ms
[2025-06-07 16:55:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8458050419820582506.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/CTLCardinality2731743033084252193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8458050419820582506.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 : 2039/2039 places, 1829/1829 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2038 transition count 1410
Reduce places removed 418 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 838 place count 1620 transition count 1408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 839 place count 1619 transition count 1408
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 227 Pre rules applied. Total rules applied 839 place count 1619 transition count 1181
Deduced a syphon composed of 227 places in 2 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 3 with 454 rules applied. Total rules applied 1293 place count 1392 transition count 1181
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1314 place count 1371 transition count 1160
Iterating global reduction 3 with 21 rules applied. Total rules applied 1335 place count 1371 transition count 1160
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1335 place count 1371 transition count 1141
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1373 place count 1352 transition count 1141
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 474
Deduced a syphon composed of 474 places in 1 ms
Reduce places removed 474 places and 0 transitions.
Iterating global reduction 3 with 948 rules applied. Total rules applied 2321 place count 878 transition count 667
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 place count 876 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2324 place count 875 transition count 665
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2324 place count 875 transition count 663
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2328 place count 873 transition count 663
Applied a total of 2328 rules in 236 ms. Remains 873 /2039 variables (removed 1166) and now considering 663/1829 (removed 1166) transitions.
// Phase 1: matrix 663 rows 873 cols
[2025-06-07 16:55:57] [INFO ] Computed 330 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:55:57] [INFO ] Implicit Places using invariants in 352 ms returned [853, 857]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 353 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 871/2039 places, 663/1829 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 869 transition count 661
Applied a total of 4 rules in 31 ms. Remains 869 /871 variables (removed 2) and now considering 661/663 (removed 2) transitions.
// Phase 1: matrix 661 rows 869 cols
[2025-06-07 16:55:57] [INFO ] Computed 328 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:55:57] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-07 16:55:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:55:58] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 869/2039 places, 661/1829 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1604 ms. Remains : 869/2039 places, 661/1829 transitions.
[2025-06-07 16:55:58] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:55:58] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:55:58] [INFO ] Input system was already deterministic with 661 transitions.
[2025-06-07 16:55:58] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:55:58] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:55:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3336751891484525394.gal : 3 ms
[2025-06-07 16:55:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality6366489924820335724.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/CTLCardinality3336751891484525394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6366489924820335724.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83871e+128,3.34308,111004,2,2878,5,417344,6,0,4138,737854,0
Converting to forward existential form...Done !
original formula: AF(((!(A((p1729==1) U (p1684==1))) * (p732==0)) * ((p1012==1) * AG((p1909==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((p1684==1)) U (!((p1729==1)) * !((p1684==1)))) + EG(!((p1684==1)))))) * (p732==0)) * ((p...205
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1043
Detected timeout of ITS tools.
[2025-06-07 16:56:28] [INFO ] Flatten gal took : 33 ms
[2025-06-07 16:56:28] [INFO ] Applying decomposition
[2025-06-07 16:56:28] [INFO ] Flatten gal took : 14 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/graph9723637794219993338.txt' '-o' '/tmp/graph9723637794219993338.bin' '-w' '/tmp/graph9723637794219993338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9723637794219993338.bin' '-l' '-1' '-v' '-w' '/tmp/graph9723637794219993338.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:56:28] [INFO ] Decomposing Gal with order
[2025-06-07 16:56:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:56:28] [INFO ] Removed a total of 88 redundant transitions.
[2025-06-07 16:56:28] [INFO ] Flatten gal took : 19 ms
[2025-06-07 16:56:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-07 16:56:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6271915611349353748.gal : 4 ms
[2025-06-07 16:56:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality6995110458851088849.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/CTLCardinality6271915611349353748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6995110458851088849.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83871e+128,18.354,544476,574,40,952408,254,943,3.35416e+06,52,1205,0
Converting to forward existential form...Done !
original formula: AF(((!(A((i20.u178.p1729==1) U (i18.u174.p1684==1))) * (i7.u73.p732==0)) * ((i9.i1.i0.u104.p1012==1) * AG((i21.u198.p1909==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((i18.u174.p1684==1)) U (!((i20.u178.p1729==1)) * !((i18.u174.p1684==1)))) + EG(!((i18.u1...271
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t134, i0.u3.t1, i0.u8.t140, i0.u2.t0, i0.u7.t136, i0.u5.t132, i0.u11.t4, i0.u16.t154, i...2640
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2039/2039 places, 1829/1829 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2038 transition count 1408
Reduce places removed 420 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 422 rules applied. Total rules applied 842 place count 1618 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 843 place count 1617 transition count 1406
Performed 226 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 226 Pre rules applied. Total rules applied 843 place count 1617 transition count 1180
Deduced a syphon composed of 226 places in 2 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 3 with 452 rules applied. Total rules applied 1295 place count 1391 transition count 1180
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1316 place count 1370 transition count 1159
Iterating global reduction 3 with 21 rules applied. Total rules applied 1337 place count 1370 transition count 1159
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1337 place count 1370 transition count 1140
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1375 place count 1351 transition count 1140
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 1 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 2331 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2333 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2334 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2334 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2338 place count 868 transition count 658
Applied a total of 2338 rules in 217 ms. Remains 868 /2039 variables (removed 1171) and now considering 658/1829 (removed 1171) transitions.
// Phase 1: matrix 658 rows 868 cols
[2025-06-07 16:56:58] [INFO ] Computed 330 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:56:59] [INFO ] Implicit Places using invariants in 341 ms returned [848, 852]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 342 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 866/2039 places, 658/1829 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 864 transition count 656
Applied a total of 4 rules in 31 ms. Remains 864 /866 variables (removed 2) and now considering 656/658 (removed 2) transitions.
// Phase 1: matrix 656 rows 864 cols
[2025-06-07 16:56:59] [INFO ] Computed 328 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:56:59] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-07 16:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:57:00] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 864/2039 places, 656/1829 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1583 ms. Remains : 864/2039 places, 656/1829 transitions.
[2025-06-07 16:57:00] [INFO ] Flatten gal took : 13 ms
[2025-06-07 16:57:00] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:57:00] [INFO ] Input system was already deterministic with 656 transitions.
[2025-06-07 16:57:00] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:57:00] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11716922254131303214.gal : 3 ms
[2025-06-07 16:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14931896616854710115.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/CTLCardinality11716922254131303214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14931896616854710115.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12809e+128,2.44542,82544,2,1575,5,301855,6,0,4115,520899,0
Converting to forward existential form...Done !
original formula: EG(AF(((p1938==1)||(p1824==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p1938==1)||(p1824==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 652/4/4
Detected timeout of ITS tools.
[2025-06-07 16:57:30] [INFO ] Flatten gal took : 19 ms
[2025-06-07 16:57:30] [INFO ] Applying decomposition
[2025-06-07 16:57:30] [INFO ] Flatten gal took : 14 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/graph17196685099508483852.txt' '-o' '/tmp/graph17196685099508483852.bin' '-w' '/tmp/graph17196685099508483852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17196685099508483852.bin' '-l' '-1' '-v' '-w' '/tmp/graph17196685099508483852.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:57:30] [INFO ] Decomposing Gal with order
[2025-06-07 16:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:57:30] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-07 16:57:30] [INFO ] Flatten gal took : 43 ms
[2025-06-07 16:57:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2025-06-07 16:57:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16076918422948342666.gal : 5 ms
[2025-06-07 16:57:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3107988671278079757.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/CTLCardinality16076918422948342666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3107988671278079757.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12809e+128,15.8688,479948,157,18,921178,180,957,2.75989e+06,46,1082,0
Converting to forward existential form...Done !
original formula: EG(AF(((i15.u200.p1938==1)||(i18.i0.i0.u188.p1824==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((i15.u200.p1938==1)||(i18.i0.i0.u188.p1824==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 16:58:00] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:58:00] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:58:00] [INFO ] Applying decomposition
[2025-06-07 16:58:00] [INFO ] Flatten gal took : 31 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/graph4876507993845589218.txt' '-o' '/tmp/graph4876507993845589218.bin' '-w' '/tmp/graph4876507993845589218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4876507993845589218.bin' '-l' '-1' '-v' '-w' '/tmp/graph4876507993845589218.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:58:00] [INFO ] Decomposing Gal with order
[2025-06-07 16:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:58:01] [INFO ] Removed a total of 282 redundant transitions.
[2025-06-07 16:58:01] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:58:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 16:58:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16654085338600642319.gal : 12 ms
[2025-06-07 16:58:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6499680337821277958.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/CTLCardinality16654085338600642319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6499680337821277958.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 15 CTL formulae.
ITS-tools command line returned an error code 137
[2025-06-07 17:25:22] [INFO ] Applying decomposition
[2025-06-07 17:25:22] [INFO ] Flatten gal took : 187 ms
[2025-06-07 17:25:22] [INFO ] Decomposing Gal with order
[2025-06-07 17:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:25:23] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-07 17:25:23] [INFO ] Flatten gal took : 364 ms
[2025-06-07 17:25:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 207 ms.
[2025-06-07 17:25:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16897337966720758593.gal : 44 ms
[2025-06-07 17:25:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16408490004634884510.ctl : 9 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/CTLCardinality16897337966720758593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16408490004634884510.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 15 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldPPPt-PT-030B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533600897"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;