Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200428.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 ASLink-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 920K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-10a-LTLFireability-00
FORMULA_NAME ASLink-PT-10a-LTLFireability-01
FORMULA_NAME ASLink-PT-10a-LTLFireability-02
FORMULA_NAME ASLink-PT-10a-LTLFireability-03
FORMULA_NAME ASLink-PT-10a-LTLFireability-04
FORMULA_NAME ASLink-PT-10a-LTLFireability-05
FORMULA_NAME ASLink-PT-10a-LTLFireability-06
FORMULA_NAME ASLink-PT-10a-LTLFireability-07
FORMULA_NAME ASLink-PT-10a-LTLFireability-08
FORMULA_NAME ASLink-PT-10a-LTLFireability-09
FORMULA_NAME ASLink-PT-10a-LTLFireability-10
FORMULA_NAME ASLink-PT-10a-LTLFireability-11
FORMULA_NAME ASLink-PT-10a-LTLFireability-12
FORMULA_NAME ASLink-PT-10a-LTLFireability-13
FORMULA_NAME ASLink-PT-10a-LTLFireability-14
FORMULA_NAME ASLink-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748616031107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 14:40:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 14:40:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:40:32] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-05-30 14:40:32] [INFO ] Transformed 2186 places.
[2025-05-30 14:40:32] [INFO ] Transformed 3192 transitions.
[2025-05-30 14:40:32] [INFO ] Found NUPN structural information;
[2025-05-30 14:40:32] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2126 transition count 3158
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 2114 transition count 3103
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 2113 transition count 3103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 2113 transition count 3101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 2112 transition count 3093
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 2112 transition count 3093
Applied a total of 89 rules in 586 ms. Remains 2112 /2186 variables (removed 74) and now considering 3093/3158 (removed 65) transitions.
// Phase 1: matrix 3093 rows 2112 cols
[2025-05-30 14:40:33] [INFO ] Computed 361 invariants in 160 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:40:35] [INFO ] Implicit Places using invariants in 1985 ms returned [1, 19, 20, 23, 52, 70, 199, 215, 220, 221, 222, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 616, 634, 763, 779, 784, 785, 805, 823, 952, 968, 973, 975, 993, 1011, 1140, 1156, 1161, 1162, 1182, 1200, 1329, 1345, 1350, 1351, 1352, 1370, 1388, 1517, 1533, 1538, 1539, 1540, 1558, 1576, 1705, 1721, 1726, 1727, 1728, 1764, 1893, 1898, 1910, 1915, 1916, 1917, 1950, 1952, 1955, 1973, 1974, 1975, 1976, 2001, 2009, 2015, 2021, 2027, 2033, 2041, 2047, 2053, 2061]
Discarding 88 places :
Implicit Place search using SMT only with invariants took 2041 ms to find 88 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2024/2186 places, 3093/3158 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2013 transition count 3082
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2013 transition count 3082
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 2004 transition count 3073
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 2004 transition count 3073
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 2000 transition count 3069
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 2000 transition count 3069
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1998 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1998 transition count 3067
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1996 transition count 3065
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1996 transition count 3065
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1995 transition count 3064
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1995 transition count 3064
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1994 transition count 3063
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1994 transition count 3063
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1993 transition count 3062
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1993 transition count 3062
Applied a total of 62 rules in 641 ms. Remains 1993 /2024 variables (removed 31) and now considering 3062/3093 (removed 31) transitions.
// Phase 1: matrix 3062 rows 1993 cols
[2025-05-30 14:40:36] [INFO ] Computed 273 invariants in 110 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:40:37] [INFO ] Implicit Places using invariants in 1351 ms returned []
[2025-05-30 14:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:40:41] [INFO ] Implicit Places using invariants and state equation in 4383 ms returned []
Implicit Place search using SMT with State Equation took 5738 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1993/2186 places, 3062/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9023 ms. Remains : 1993/2186 places, 3062/3158 transitions.
Support contains 64 out of 1993 places after structural reductions.
[2025-05-30 14:40:42] [INFO ] Flatten gal took : 221 ms
[2025-05-30 14:40:42] [INFO ] Flatten gal took : 135 ms
[2025-05-30 14:40:42] [INFO ] Input system was already deterministic with 3062 transitions.
RANDOM walk for 40000 steps (172 resets) in 1710 ms. (23 steps per ms) remains 23/33 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 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 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 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 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 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 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 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 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 12 ms. (308 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 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
[2025-05-30 14:40:43] [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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 251/299 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 462/761 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1191/1952 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1952 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 41/1993 variables, 15/273 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:45] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 23 ms to minimize.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1993 variables, 1/274 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1993 variables, 0/274 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5055/5055 variables, and 2267 constraints, problems are : Problem set: 2 solved, 21 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 216/216 constraints, State Equation: 1993/1993 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 21 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 252/299 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 462/761 variables, 49/57 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1191/1952 variables, 201/258 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1952 variables, 1/259 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:49] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:49] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:50] [INFO ] Deduced a trap composed of 94 places in 286 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:51] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 38 ms to minimize.
Problem AtomicPropp30 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1952 variables, 4/263 constraints. Problems are: Problem set: 3 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:52] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 23 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1952 variables, 1/264 constraints. Problems are: Problem set: 3 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1952/5055 variables, and 264 constraints, problems are : Problem set: 3 solved, 20 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 201/216 constraints, State Equation: 0/1993 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10107ms problems are : Problem set: 3 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 1993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 353 place count 1993 transition count 2709
Reduce places removed 353 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 354 rules applied. Total rules applied 707 place count 1640 transition count 2708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 708 place count 1639 transition count 2708
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 708 place count 1639 transition count 2448
Deduced a syphon composed of 260 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 3 with 605 rules applied. Total rules applied 1313 place count 1294 transition count 2448
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 24 rules applied. Total rules applied 1337 place count 1283 transition count 2435
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1350 place count 1270 transition count 2435
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 1350 place count 1270 transition count 2399
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1422 place count 1234 transition count 2399
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1427 place count 1229 transition count 2389
Iterating global reduction 5 with 5 rules applied. Total rules applied 1432 place count 1229 transition count 2389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 5 rules applied. Total rules applied 1437 place count 1228 transition count 2385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1438 place count 1227 transition count 2385
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 3 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1644 place count 1124 transition count 2282
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1646 place count 1122 transition count 2280
Iterating global reduction 7 with 2 rules applied. Total rules applied 1648 place count 1122 transition count 2280
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1657 place count 1122 transition count 2271
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1666 place count 1113 transition count 2271
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1712 place count 1113 transition count 2225
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 8 with 47 rules applied. Total rules applied 1759 place count 1066 transition count 2225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1766 place count 1066 transition count 2218
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1767 place count 1066 transition count 2217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1768 place count 1065 transition count 2217
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 1796 place count 1065 transition count 2217
Applied a total of 1796 rules in 726 ms. Remains 1065 /1993 variables (removed 928) and now considering 2217/3062 (removed 845) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 1065/1993 places, 2217/3062 transitions.
RANDOM walk for 40000 steps (483 resets) in 882 ms. (45 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
// Phase 1: matrix 2217 rows 1065 cols
[2025-05-30 14:40:54] [INFO ] Computed 175 invariants in 21 ms
[2025-05-30 14:40:54] [INFO ] State equation strengthened by 55 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 51/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 256/348 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 637/985 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 80/1065 variables, 15/175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:55] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:40:55] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2217/3282 variables, 1065/1242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3282 variables, 55/1297 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3282 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/3282 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3282/3282 variables, and 1297 constraints, problems are : Problem set: 0 solved, 18 unsolved in 9287 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1065/1065 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 51/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 256/348 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 637/985 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:04] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:04] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:05] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/985 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/985 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 80/1065 variables, 15/180 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:06] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1065 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 12 (OVERLAPS) 2217/3282 variables, 1065/1246 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3282 variables, 55/1301 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3282 variables, 3/1304 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3282 variables, 0/1304 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3282 variables, 0/1304 constraints. Problems are: Problem set: 15 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3282/3282 variables, and 1304 constraints, problems are : Problem set: 15 solved, 3 unsolved in 20632 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1065/1065 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/18 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29981ms problems are : Problem set: 15 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3521 ms.
Support contains 6 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 2217/2217 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1065 transition count 2216
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1064 transition count 2216
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 1061 transition count 2196
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 1061 transition count 2196
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 1059 transition count 2196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1058 transition count 2188
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1058 transition count 2188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 1057 transition count 2180
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 1057 transition count 2180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 1056 transition count 2172
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 1056 transition count 2172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 1055 transition count 2164
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 1055 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 1054 transition count 2156
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 1054 transition count 2156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 1053 transition count 2148
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 1053 transition count 2148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 1052 transition count 2140
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 1052 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 1051 transition count 2132
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 1051 transition count 2132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 1050 transition count 2124
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 1050 transition count 2124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 1049 transition count 2116
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 1049 transition count 2116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 1048 transition count 2108
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 1048 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 1047 transition count 2100
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 1047 transition count 2100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 1046 transition count 2092
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 1046 transition count 2092
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1045 transition count 2084
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1045 transition count 2084
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 1042 transition count 2081
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 1040 transition count 2079
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 1040 transition count 2079
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 1040 transition count 2077
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 1038 transition count 2077
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 57 place count 1038 transition count 2077
Applied a total of 57 rules in 707 ms. Remains 1038 /1065 variables (removed 27) and now considering 2077/2217 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 1038/1065 places, 2077/2217 transitions.
RANDOM walk for 40000 steps (468 resets) in 407 ms. (98 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (47 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
// Phase 1: matrix 2077 rows 1038 cols
[2025-05-30 14:41:29] [INFO ] Computed 173 invariants in 21 ms
[2025-05-30 14:41:29] [INFO ] State equation strengthened by 55 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/247 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 641/888 variables, 107/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:29] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 150/1038 variables, 28/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1038 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2077/3115 variables, 1038/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3115 variables, 55/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3115 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3115 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3115/3115 variables, and 1267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1038/1038 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/247 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 641/888 variables, 107/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:30] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 150/1038 variables, 28/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2077/3115 variables, 1038/1213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3115 variables, 55/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3115 variables, 2/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3115 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3115 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3115/3115 variables, and 1270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3723 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1038/1038 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4889ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2944 ms.
Support contains 5 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 2077/2077 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 1038 transition count 2076
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1037 transition count 2076
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1037 transition count 2076
Applied a total of 3 rules in 98 ms. Remains 1037 /1038 variables (removed 1) and now considering 2076/2077 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1037/1038 places, 2076/2077 transitions.
RANDOM walk for 40000 steps (456 resets) in 369 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (53 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (41 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209566 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209566 steps, saw 97059 distinct states, run finished after 3009 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 2076 rows 1037 cols
[2025-05-30 14:41:40] [INFO ] Computed 173 invariants in 21 ms
[2025-05-30 14:41:40] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/246 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 661/907 variables, 108/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:40] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:40] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 130/1037 variables, 26/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1037 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2076/3113 variables, 1037/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3113 variables, 55/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3113 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3113 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3113/3113 variables, and 1267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 134/134 constraints, State Equation: 1037/1037 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/246 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 661/907 variables, 108/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:41:42] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 130/1037 variables, 26/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1037 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2076/3113 variables, 1037/1213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3113 variables, 55/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3113 variables, 2/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3113 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3113 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3113/3113 variables, and 1270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4795 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 134/134 constraints, State Equation: 1037/1037 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6193ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3713 ms.
Support contains 5 out of 1037 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1037/1037 places, 2076/2076 transitions.
Applied a total of 0 rules in 40 ms. Remains 1037 /1037 variables (removed 0) and now considering 2076/2076 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1037/1037 places, 2076/2076 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1037/1037 places, 2076/2076 transitions.
Applied a total of 0 rules in 39 ms. Remains 1037 /1037 variables (removed 0) and now considering 2076/2076 (removed 0) transitions.
[2025-05-30 14:41:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:41:51] [INFO ] Implicit Places using invariants in 912 ms returned [21, 96, 102, 105, 107, 110, 117, 118, 119, 188, 194, 197, 199, 202, 209, 210, 211, 281, 287, 290, 292, 295, 302, 303, 304, 373, 379, 382, 384, 387, 394, 395, 396, 397, 484, 491, 498, 499, 500, 501, 570, 576, 579, 581, 584, 591, 592, 593, 594, 669, 675, 678, 680, 683, 690, 691, 692, 761, 767, 770, 772, 775, 782, 783, 784, 853, 859, 862, 864, 867, 874, 875, 876, 894, 950, 958, 964, 967, 980, 1024, 1025]
[2025-05-30 14:41:51] [INFO ] Actually due to overlaps returned [117, 209, 302, 394, 498, 591, 690, 782, 874, 21, 118, 210, 303, 395, 397, 499, 592, 594, 691, 783, 875, 894, 119, 500, 501, 692, 211, 304, 396, 593, 784, 876, 980, 96, 102, 107, 188, 194, 199, 287, 292, 373, 379, 384, 570, 576, 581, 669, 675, 680, 761, 767, 772, 853, 859, 864, 202, 281, 295, 387, 484, 584, 775, 867, 950, 958, 964, 967, 1024]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 920 ms to find 69 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 968/1037 places, 2076/2076 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 968 transition count 2059
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 951 transition count 2059
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 34 place count 951 transition count 2035
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 51 rules applied. Total rules applied 85 place count 924 transition count 2035
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 130 place count 879 transition count 1990
Iterating global reduction 2 with 45 rules applied. Total rules applied 175 place count 879 transition count 1990
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 185 place count 879 transition count 1980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 185 place count 879 transition count 1979
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 878 transition count 1979
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 196 place count 869 transition count 1970
Iterating global reduction 3 with 9 rules applied. Total rules applied 205 place count 869 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 868 transition count 1969
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 868 transition count 1969
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 243 place count 850 transition count 1951
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 246 place count 850 transition count 1948
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 273 place count 850 transition count 1921
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 300 place count 823 transition count 1921
Applied a total of 300 rules in 217 ms. Remains 823 /968 variables (removed 145) and now considering 1921/2076 (removed 155) transitions.
// Phase 1: matrix 1921 rows 823 cols
[2025-05-30 14:41:51] [INFO ] Computed 101 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:41:52] [INFO ] Implicit Places using invariants in 620 ms returned [72, 89, 145, 162, 218, 238, 294, 311, 367, 384, 390, 395, 451, 468, 524, 541, 597, 614, 670, 687, 743, 760]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 631 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 801/1037 places, 1921/2076 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 798 transition count 1918
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 798 transition count 1918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 797 transition count 1917
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 797 transition count 1917
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 30 place count 786 transition count 1906
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 786 transition count 1904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 784 transition count 1904
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 784 transition count 1894
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 54 place count 774 transition count 1894
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 774 transition count 1894
Applied a total of 55 rules in 291 ms. Remains 774 /801 variables (removed 27) and now considering 1894/1921 (removed 27) transitions.
// Phase 1: matrix 1894 rows 774 cols
[2025-05-30 14:41:52] [INFO ] Computed 79 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:41:52] [INFO ] Implicit Places using invariants in 549 ms returned []
[2025-05-30 14:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:41:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 14:41:55] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 774/1037 places, 1894/2076 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5057 ms. Remains : 774/1037 places, 1894/2076 transitions.
RANDOM walk for 40000 steps (683 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (85 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 206092 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 206092 steps, saw 88323 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2025-05-30 14:41:58] [INFO ] Invariant cache hit.
[2025-05-30 14:41:58] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 121/130 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 562/692 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/774 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1894/2668 variables, 774/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2668 variables, 10/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2668 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2668 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2668/2668 variables, and 863 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 774/774 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/130 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 562/692 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/774 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1894/2668 variables, 774/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2668 variables, 10/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2668 variables, 2/865 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2668 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2668 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2668/2668 variables, and 865 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4878 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 774/774 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6009ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2424 ms.
Support contains 5 out of 774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 1894/1894 transitions.
Applied a total of 0 rules in 31 ms. Remains 774 /774 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 774/774 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 1894/1894 transitions.
Applied a total of 0 rules in 30 ms. Remains 774 /774 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2025-05-30 14:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:42:07] [INFO ] Implicit Places using invariants in 509 ms returned []
[2025-05-30 14:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:42:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 14:42:09] [INFO ] Implicit Places using invariants and state equation in 2350 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:42:10] [INFO ] Redundant transitions in 153 ms returned []
Running 1893 sub problems to find dead transitions.
[2025-05-30 14:42:10] [INFO ] Invariant cache hit.
[2025-05-30 14:42:10] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/773 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/2668 variables, and 38 constraints, problems are : Problem set: 0 solved, 1893 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 38/64 constraints, State Equation: 0/774 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1893/1893 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1893 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/773 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/2668 variables, and 38 constraints, problems are : Problem set: 0 solved, 1893 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 38/64 constraints, State Equation: 0/774 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1893 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60868ms problems are : Problem set: 0 solved, 1893 unsolved
Search for dead transitions found 0 dead transitions in 60877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63945 ms. Remains : 774/774 places, 1894/1894 transitions.
Successfully simplified 18 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-10a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-10a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 366 rules applied. Total rules applied 366 place count 1992 transition count 2695
Reduce places removed 376 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 383 rules applied. Total rules applied 749 place count 1616 transition count 2688
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 756 place count 1609 transition count 2688
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 756 place count 1609 transition count 2405
Deduced a syphon composed of 283 places in 5 ms
Ensure Unique test removed 85 places
Reduce places removed 368 places and 0 transitions.
Iterating global reduction 3 with 651 rules applied. Total rules applied 1407 place count 1241 transition count 2405
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 55 rules applied. Total rules applied 1462 place count 1219 transition count 2372
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 1496 place count 1185 transition count 2372
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 42 Pre rules applied. Total rules applied 1496 place count 1185 transition count 2330
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1580 place count 1143 transition count 2330
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1598 place count 1125 transition count 2290
Iterating global reduction 5 with 18 rules applied. Total rules applied 1616 place count 1125 transition count 2290
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
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 5 with 17 rules applied. Total rules applied 1633 place count 1122 transition count 2276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1634 place count 1121 transition count 2276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1635 place count 1120 transition count 2268
Iterating global reduction 7 with 1 rules applied. Total rules applied 1636 place count 1120 transition count 2268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1637 place count 1119 transition count 2260
Iterating global reduction 7 with 1 rules applied. Total rules applied 1638 place count 1119 transition count 2260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1639 place count 1118 transition count 2252
Iterating global reduction 7 with 1 rules applied. Total rules applied 1640 place count 1118 transition count 2252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1641 place count 1117 transition count 2244
Iterating global reduction 7 with 1 rules applied. Total rules applied 1642 place count 1117 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1643 place count 1116 transition count 2236
Iterating global reduction 7 with 1 rules applied. Total rules applied 1644 place count 1116 transition count 2236
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1645 place count 1115 transition count 2228
Iterating global reduction 7 with 1 rules applied. Total rules applied 1646 place count 1115 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1647 place count 1114 transition count 2220
Iterating global reduction 7 with 1 rules applied. Total rules applied 1648 place count 1114 transition count 2220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1649 place count 1113 transition count 2212
Iterating global reduction 7 with 1 rules applied. Total rules applied 1650 place count 1113 transition count 2212
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1651 place count 1112 transition count 2204
Iterating global reduction 7 with 1 rules applied. Total rules applied 1652 place count 1112 transition count 2204
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1653 place count 1111 transition count 2196
Iterating global reduction 7 with 1 rules applied. Total rules applied 1654 place count 1111 transition count 2196
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1655 place count 1110 transition count 2188
Iterating global reduction 7 with 1 rules applied. Total rules applied 1656 place count 1110 transition count 2188
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1657 place count 1109 transition count 2180
Iterating global reduction 7 with 1 rules applied. Total rules applied 1658 place count 1109 transition count 2180
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1659 place count 1108 transition count 2172
Iterating global reduction 7 with 1 rules applied. Total rules applied 1660 place count 1108 transition count 2172
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1661 place count 1107 transition count 2164
Iterating global reduction 7 with 1 rules applied. Total rules applied 1662 place count 1107 transition count 2164
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 1854 place count 1011 transition count 2068
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1857 place count 1008 transition count 2065
Iterating global reduction 7 with 3 rules applied. Total rules applied 1860 place count 1008 transition count 2065
Applied a total of 1860 rules in 787 ms. Remains 1008 /1993 variables (removed 985) and now considering 2065/3062 (removed 997) transitions.
// Phase 1: matrix 2065 rows 1008 cols
[2025-05-30 14:43:12] [INFO ] Computed 152 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:12] [INFO ] Implicit Places using invariants in 708 ms returned [21, 74, 103, 108, 167, 184, 190, 195, 197, 257, 274, 280, 285, 287, 347, 364, 370, 375, 377, 386, 439, 460, 466, 471, 473, 533, 550, 556, 561, 563, 572, 625, 646, 652, 657, 659, 719, 736, 742, 747, 749, 809, 826, 832, 837, 839, 865, 900, 921, 929, 935, 937, 992, 1005]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 710 ms to find 54 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 954/1993 places, 2065/3062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 954 transition count 2047
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 936 transition count 2047
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 57 place count 915 transition count 2026
Iterating global reduction 2 with 21 rules applied. Total rules applied 78 place count 915 transition count 2026
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 78 place count 915 transition count 2025
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 914 transition count 2025
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 99 place count 895 transition count 2006
Iterating global reduction 2 with 19 rules applied. Total rules applied 118 place count 895 transition count 2006
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 127 place count 886 transition count 1997
Iterating global reduction 2 with 9 rules applied. Total rules applied 136 place count 886 transition count 1997
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 188 place count 860 transition count 1971
Applied a total of 188 rules in 182 ms. Remains 860 /954 variables (removed 94) and now considering 1971/2065 (removed 94) transitions.
// Phase 1: matrix 1971 rows 860 cols
[2025-05-30 14:43:12] [INFO ] Computed 98 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:13] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-05-30 14:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:15] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 860/1993 places, 1971/3062 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4240 ms. Remains : 860/1993 places, 1971/3062 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-05
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-05 finished in 4494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X((p2 U (p3||G(p2))))&&p1)||p0))))'
Support contains 4 out of 1993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1989 transition count 3036
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1989 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1988 transition count 3028
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1988 transition count 3028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1987 transition count 3020
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1987 transition count 3020
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1986 transition count 3012
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1986 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1985 transition count 3004
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1985 transition count 3004
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1984 transition count 2996
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1984 transition count 2996
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1983 transition count 2988
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1983 transition count 2988
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1982 transition count 2980
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1982 transition count 2980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1981 transition count 2972
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1981 transition count 2972
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1980 transition count 2964
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1980 transition count 2964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1979 transition count 2956
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1979 transition count 2956
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1978 transition count 2948
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1978 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1977 transition count 2940
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1977 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1976 transition count 2932
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1976 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1975 transition count 2924
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1975 transition count 2924
Applied a total of 36 rules in 1341 ms. Remains 1975 /1993 variables (removed 18) and now considering 2924/3062 (removed 138) transitions.
// Phase 1: matrix 2924 rows 1975 cols
[2025-05-30 14:43:17] [INFO ] Computed 273 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:18] [INFO ] Implicit Places using invariants in 1265 ms returned [29, 754, 936, 1118, 1679, 1897]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1278 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1969/1993 places, 2924/3062 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1967 transition count 2922
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1965 transition count 2920
Applied a total of 8 rules in 309 ms. Remains 1965 /1969 variables (removed 4) and now considering 2920/2924 (removed 4) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2025-05-30 14:43:18] [INFO ] Computed 267 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:19] [INFO ] Implicit Places using invariants in 1246 ms returned []
[2025-05-30 14:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:25] [INFO ] Implicit Places using invariants and state equation in 5530 ms returned []
Implicit Place search using SMT with State Equation took 6778 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/1993 places, 2920/3062 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9707 ms. Remains : 1965/1993 places, 2920/3062 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 13941 reset in 820 ms.
Product exploration explored 100000 steps with 14136 reset in 731 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 264 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (169 resets) in 311 ms. (128 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
[2025-05-30 14:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/116 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 693/809 variables, 51/58 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1148/1957 variables, 208/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1957 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1965 variables, 1/267 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1965 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4885/4885 variables, and 2232 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 209/209 constraints, State Equation: 1965/1965 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/143 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 706/849 variables, 52/60 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1108/1957 variables, 206/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1957 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1965 variables, 1/267 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1965 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2920/4885 variables, 1965/2232 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4885 variables, 1/2233 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:43:30] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4885 variables, 1/2234 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4885 variables, 0/2234 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4885 variables, 0/2234 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4885/4885 variables, and 2234 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 209/209 constraints, State Equation: 1965/1965 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3565ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 733 ms.
Support contains 1 out of 1965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 1965 transition count 2529
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 782 place count 1574 transition count 2529
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 782 place count 1574 transition count 2264
Deduced a syphon composed of 265 places in 4 ms
Ensure Unique test removed 85 places
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 2 with 615 rules applied. Total rules applied 1397 place count 1224 transition count 2264
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 23 rules applied. Total rules applied 1420 place count 1210 transition count 2255
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1429 place count 1201 transition count 2255
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1429 place count 1201 transition count 2215
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1509 place count 1161 transition count 2215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1514 place count 1156 transition count 2210
Iterating global reduction 4 with 5 rules applied. Total rules applied 1519 place count 1156 transition count 2210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 1523 place count 1156 transition count 2206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1524 place count 1155 transition count 2206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1524 place count 1155 transition count 2205
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1526 place count 1154 transition count 2205
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 4 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 6 with 210 rules applied. Total rules applied 1736 place count 1049 transition count 2100
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1746 place count 1049 transition count 2090
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1756 place count 1039 transition count 2090
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1796 place count 1039 transition count 2050
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 1837 place count 998 transition count 2050
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1847 place count 998 transition count 2040
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 1877 place count 998 transition count 2040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1878 place count 997 transition count 2039
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1888 place count 987 transition count 2039
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 1888 place count 987 transition count 2019
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 1938 place count 957 transition count 2019
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1948 place count 947 transition count 2009
Iterating global reduction 9 with 10 rules applied. Total rules applied 1958 place count 947 transition count 2009
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1968 place count 947 transition count 1999
Applied a total of 1968 rules in 506 ms. Remains 947 /1965 variables (removed 1018) and now considering 1999/2920 (removed 921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 947/1965 places, 1999/2920 transitions.
RANDOM walk for 40000 steps (592 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 312078 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 312078 steps, saw 103324 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 1999 rows 947 cols
[2025-05-30 14:43:35] [INFO ] Computed 147 invariants in 25 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/186 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/193 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 162/355 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/361 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/362 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 136/498 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/502 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 84/586 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/586 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/588 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/588 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 79/667 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/667 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/668 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/668 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 92/760 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/760 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/761 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/761 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 88/849 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/849 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 45/894 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/894 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 53/947 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/947 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1999/2946 variables, 947/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2946 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/2946 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2946/2946 variables, and 1094 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 124/124 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/186 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/193 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 162/355 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/361 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/362 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 136/498 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/502 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 84/586 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/586 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/588 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/588 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 79/667 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/667 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/668 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/668 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 92/760 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/760 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/761 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/761 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 88/849 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/849 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 45/894 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/894 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 53/947 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/947 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1999/2946 variables, 947/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2946 variables, 1/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2946 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/2946 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2946/2946 variables, and 1095 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 124/124 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 1999/1999 transitions.
Applied a total of 0 rules in 37 ms. Remains 947 /947 variables (removed 0) and now considering 1999/1999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 947/947 places, 1999/1999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 1999/1999 transitions.
Applied a total of 0 rules in 36 ms. Remains 947 /947 variables (removed 0) and now considering 1999/1999 (removed 0) transitions.
[2025-05-30 14:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:39] [INFO ] Implicit Places using invariants in 849 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 263, 269, 272, 274, 275, 280, 281, 333, 350, 356, 359, 361, 362, 367, 368, 420, 437, 443, 446, 448, 449, 454, 455, 507, 524, 530, 533, 535, 536, 541, 542, 594, 611, 617, 620, 622, 623, 628, 629, 681, 698, 704, 707, 709, 710, 715, 716, 768, 785, 791, 794, 796, 797, 802, 803, 855, 872, 878, 881, 883, 884]
[2025-05-30 14:43:39] [INFO ] Actually due to overlaps returned [187, 275, 362, 449, 536, 623, 710, 797, 884, 88, 94, 99, 175, 181, 186, 269, 274, 350, 356, 361, 437, 443, 448, 524, 530, 535, 611, 617, 622, 698, 704, 709, 785, 791, 796, 872, 878, 883, 71, 100, 158, 245, 263, 333, 420, 507, 594, 681, 768, 855]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 851 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 897/947 places, 1999/1999 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 857 transition count 1959
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 857 transition count 1959
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 848 transition count 1950
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 848 transition count 1950
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 138 place count 828 transition count 1930
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 168 place count 828 transition count 1900
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 198 place count 798 transition count 1900
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 208 place count 798 transition count 1890
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 218 place count 788 transition count 1890
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 788 transition count 1890
Applied a total of 219 rules in 225 ms. Remains 788 /897 variables (removed 109) and now considering 1890/1999 (removed 109) transitions.
// Phase 1: matrix 1890 rows 788 cols
[2025-05-30 14:43:39] [INFO ] Computed 97 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:40] [INFO ] Implicit Places using invariants in 617 ms returned [88, 89, 159, 160, 233, 234, 304, 305, 375, 376, 446, 447, 517, 518, 588, 589, 659, 660]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 619 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 770/947 places, 1890/1999 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1766 ms. Remains : 770/947 places, 1890/1999 transitions.
RANDOM walk for 40000 steps (658 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (87 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232248 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232248 steps, saw 148141 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1890 rows 770 cols
[2025-05-30 14:43:43] [INFO ] Computed 79 invariants in 22 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/364 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/517 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/532 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/687 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/735 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/735 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/770 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1890/2660 variables, 770/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2660 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2660 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2660/2660 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/364 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/517 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/532 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/687 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/735 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/735 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/770 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1890/2660 variables, 770/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2660 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2660 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2660 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2660/2660 variables, and 850 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1851ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1890/1890 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 770/770 places, 1890/1890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1890/1890 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
[2025-05-30 14:43:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:46] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-05-30 14:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:43:47] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:43:48] [INFO ] Redundant transitions in 85 ms returned []
Running 1844 sub problems to find dead transitions.
[2025-05-30 14:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/2660 variables, and 75 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 63/64 constraints, State Equation: 0/770 constraints, PredecessorRefiner: 1844/1844 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1844 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/2660 variables, and 75 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 63/64 constraints, State Equation: 0/770 constraints, PredecessorRefiner: 0/1844 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 1844 unsolved
Search for dead transitions found 0 dead transitions in 60843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63251 ms. Remains : 770/770 places, 1890/1890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 14:44:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 14:44:49] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-05-30 14:44:49] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 27 ms returned sat
[2025-05-30 14:44:49] [INFO ] After 501ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:44:49] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
TRAPS : Iteration 1
[2025-05-30 14:44:49] [INFO ] After 738ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 14:44:49] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 14:44:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-05-30 14:44:49] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 26 ms returned sat
[2025-05-30 14:44:50] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 14:44:50] [INFO ] After 737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 14:44:50] [INFO ] After 930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1860 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X p1)), (G (OR p0 (NOT p2) p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 p1 p2 p3))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 341 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 1965 transition count 2531
Reduce places removed 389 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 390 rules applied. Total rules applied 779 place count 1576 transition count 2530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 780 place count 1575 transition count 2530
Performed 263 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 263 Pre rules applied. Total rules applied 780 place count 1575 transition count 2267
Deduced a syphon composed of 263 places in 5 ms
Ensure Unique test removed 83 places
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 3 with 609 rules applied. Total rules applied 1389 place count 1229 transition count 2267
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 23 rules applied. Total rules applied 1412 place count 1215 transition count 2258
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1421 place count 1206 transition count 2258
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 38 Pre rules applied. Total rules applied 1421 place count 1206 transition count 2220
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 1497 place count 1168 transition count 2220
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1502 place count 1163 transition count 2215
Iterating global reduction 5 with 5 rules applied. Total rules applied 1507 place count 1163 transition count 2215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 1511 place count 1163 transition count 2211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1512 place count 1162 transition count 2211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1512 place count 1162 transition count 2210
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1514 place count 1161 transition count 2210
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 5 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 7 with 208 rules applied. Total rules applied 1722 place count 1057 transition count 2106
Applied a total of 1722 rules in 244 ms. Remains 1057 /1965 variables (removed 908) and now considering 2106/2920 (removed 814) transitions.
// Phase 1: matrix 2106 rows 1057 cols
[2025-05-30 14:44:51] [INFO ] Computed 170 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:52] [INFO ] Implicit Places using invariants in 821 ms returned [90, 96, 101, 117, 188, 194, 199, 216, 287, 293, 298, 314, 384, 390, 395, 411, 481, 488, 495, 511, 581, 587, 592, 608, 678, 684, 689, 705, 775, 781, 786, 802, 875, 881, 886, 902, 972, 978, 983, 1002, 1054]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 825 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1016/1965 places, 2106/2920 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 1016 transition count 2105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1015 transition count 2105
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 2 place count 1015 transition count 2085
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 42 place count 995 transition count 2085
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 61 place count 976 transition count 2066
Iterating global reduction 2 with 19 rules applied. Total rules applied 80 place count 976 transition count 2066
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 97 place count 959 transition count 2049
Iterating global reduction 2 with 17 rules applied. Total rules applied 114 place count 959 transition count 2049
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 121 place count 952 transition count 2042
Iterating global reduction 2 with 7 rules applied. Total rules applied 128 place count 952 transition count 2042
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 166 place count 933 transition count 2023
Applied a total of 166 rules in 183 ms. Remains 933 /1016 variables (removed 83) and now considering 2023/2106 (removed 83) transitions.
// Phase 1: matrix 2023 rows 933 cols
[2025-05-30 14:44:52] [INFO ] Computed 129 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:53] [INFO ] Implicit Places using invariants in 651 ms returned [93, 96, 179, 182, 266, 269, 350, 353, 440, 443, 524, 527, 608, 611, 692, 695, 782, 785, 866, 869]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 653 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 913/1965 places, 2023/2920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 913 transition count 2013
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 903 transition count 2013
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 30 place count 893 transition count 2003
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 893 transition count 2003
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 50 place count 893 transition count 1993
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 892 transition count 1992
Applied a total of 52 rules in 109 ms. Remains 892 /913 variables (removed 21) and now considering 1992/2023 (removed 31) transitions.
// Phase 1: matrix 1992 rows 892 cols
[2025-05-30 14:44:53] [INFO ] Computed 109 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:53] [INFO ] Implicit Places using invariants in 632 ms returned [72, 152, 233, 316, 396, 482, 562, 642, 722, 808]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 634 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 882/1965 places, 1992/2920 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 872 transition count 1982
Applied a total of 20 rules in 68 ms. Remains 872 /882 variables (removed 10) and now considering 1982/1992 (removed 10) transitions.
// Phase 1: matrix 1982 rows 872 cols
[2025-05-30 14:44:53] [INFO ] Computed 99 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:54] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-05-30 14:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:44:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 14:44:57] [INFO ] Implicit Places using invariants and state equation in 2572 ms returned []
Implicit Place search using SMT with State Equation took 3152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 872/1965 places, 1982/2920 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 5868 ms. Remains : 872/1965 places, 1982/2920 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 356 steps (5 resets) in 13 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1605 reset in 353 ms.
Product exploration explored 100000 steps with 1482 reset in 419 ms.
Built C files in :
/tmp/ltsmin12632125998185433722
[2025-05-30 14:44:58] [INFO ] Too many transitions (1982) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:44:58] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12632125998185433722
Running compilation step : cd /tmp/ltsmin12632125998185433722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12632125998185433722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12632125998185433722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1982/1982 transitions.
Applied a total of 0 rules in 34 ms. Remains 872 /872 variables (removed 0) and now considering 1982/1982 (removed 0) transitions.
[2025-05-30 14:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:45:02] [INFO ] Implicit Places using invariants in 577 ms returned []
[2025-05-30 14:45:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:45:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 14:45:04] [INFO ] Implicit Places using invariants and state equation in 2548 ms returned []
Implicit Place search using SMT with State Equation took 3127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:45:05] [INFO ] Redundant transitions in 53 ms returned []
Running 1981 sub problems to find dead transitions.
[2025-05-30 14:45:05] [INFO ] Invariant cache hit.
[2025-05-30 14:45:05] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2854 variables, and 55 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 55/82 constraints, State Equation: 0/872 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1981/1981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1981 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2854 variables, and 55 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 55/82 constraints, State Equation: 0/872 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60742ms problems are : Problem set: 0 solved, 1981 unsolved
Search for dead transitions found 0 dead transitions in 60747ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63976 ms. Remains : 872/872 places, 1982/1982 transitions.
Built C files in :
/tmp/ltsmin327428738576149653
[2025-05-30 14:46:05] [INFO ] Too many transitions (1982) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:46:05] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin327428738576149653
Running compilation step : cd /tmp/ltsmin327428738576149653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin327428738576149653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin327428738576149653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 14:46:09] [INFO ] Flatten gal took : 74 ms
[2025-05-30 14:46:09] [INFO ] Flatten gal took : 71 ms
[2025-05-30 14:46:09] [INFO ] Time to serialize gal into /tmp/LTL8131038082490578437.gal : 21 ms
[2025-05-30 14:46:09] [INFO ] Time to serialize properties into /tmp/LTL11288915595479266444.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8131038082490578437.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11798151858111501378.hoa' '-atoms' '/tmp/LTL11288915595479266444.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11288915595479266444.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11798151858111501378.hoa
Detected timeout of ITS tools.
[2025-05-30 14:46:24] [INFO ] Flatten gal took : 68 ms
[2025-05-30 14:46:24] [INFO ] Flatten gal took : 66 ms
[2025-05-30 14:46:24] [INFO ] Time to serialize gal into /tmp/LTL12157997376603191010.gal : 13 ms
[2025-05-30 14:46:24] [INFO ] Time to serialize properties into /tmp/LTL3848945986292586511.ltl : 5 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12157997376603191010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3848945986292586511.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p513==1)||(p290==1))")||(("((p1699!=1)&&(p945==0))")&&(X(("(p1699!=1)")U(("(p513!=1)")||(G("(p1699!=1)"))))))))))
Formula 0 simplified : FG(!"((p513==1)||(p290==1))" & (!"((p1699!=1)&&(p945==0))" | X(!"(p1699!=1)" M !"(p513!=1)")))
Detected timeout of ITS tools.
[2025-05-30 14:46:39] [INFO ] Flatten gal took : 60 ms
[2025-05-30 14:46:39] [INFO ] Applying decomposition
[2025-05-30 14:46:39] [INFO ] Flatten gal took : 76 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/graph13642613510755429386.txt' '-o' '/tmp/graph13642613510755429386.bin' '-w' '/tmp/graph13642613510755429386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13642613510755429386.bin' '-l' '-1' '-v' '-w' '/tmp/graph13642613510755429386.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:46:39] [INFO ] Decomposing Gal with order
[2025-05-30 14:46:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:46:40] [INFO ] Removed a total of 3945 redundant transitions.
[2025-05-30 14:46:40] [INFO ] Flatten gal took : 194 ms
[2025-05-30 14:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 57 ms.
[2025-05-30 14:46:40] [INFO ] Time to serialize gal into /tmp/LTL9587465941334119480.gal : 17 ms
[2025-05-30 14:46:40] [INFO ] Time to serialize properties into /tmp/LTL10576814597079468424.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9587465941334119480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10576814597079468424.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i6.u61.p513==1)||(i4.u42.p290==1))")||(("((i18.u175.p1699!=1)&&(i8.u101.p945==0))")&&(X(("(i18.u175.p1699!=1)")U(("(i6.u61....201
Formula 0 simplified : FG(!"((i6.u61.p513==1)||(i4.u42.p290==1))" & (!"((i18.u175.p1699!=1)&&(i8.u101.p945==0))" | X(!"(i18.u175.p1699!=1)" M !"(i6.u61.p51...164
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10a-LTLFireability-07 finished in 219707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 6 out of 1993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1989 transition count 3036
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1989 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1988 transition count 3028
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1988 transition count 3028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1987 transition count 3020
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1987 transition count 3020
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1986 transition count 3012
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1986 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1985 transition count 3004
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1985 transition count 3004
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1984 transition count 2996
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1984 transition count 2996
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1983 transition count 2988
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1983 transition count 2988
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1982 transition count 2980
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1982 transition count 2980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1981 transition count 2972
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1981 transition count 2972
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1980 transition count 2964
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1980 transition count 2964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1979 transition count 2956
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1979 transition count 2956
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1978 transition count 2948
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1978 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1977 transition count 2940
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1977 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1976 transition count 2932
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1976 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1975 transition count 2924
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1975 transition count 2924
Applied a total of 36 rules in 1257 ms. Remains 1975 /1993 variables (removed 18) and now considering 2924/3062 (removed 138) transitions.
// Phase 1: matrix 2924 rows 1975 cols
[2025-05-30 14:46:56] [INFO ] Computed 273 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:46:57] [INFO ] Implicit Places using invariants in 1172 ms returned [29, 754, 936, 1118, 1679, 1897]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1175 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1969/1993 places, 2924/3062 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1967 transition count 2922
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1965 transition count 2920
Applied a total of 8 rules in 304 ms. Remains 1965 /1969 variables (removed 4) and now considering 2920/2924 (removed 4) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2025-05-30 14:46:58] [INFO ] Computed 267 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:46:59] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2025-05-30 14:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:05] [INFO ] Implicit Places using invariants and state equation in 6022 ms returned []
Implicit Place search using SMT with State Equation took 7246 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/1993 places, 2920/3062 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9982 ms. Remains : 1965/1993 places, 2920/3062 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-10 finished in 10288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 1993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1989 transition count 3036
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1989 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1988 transition count 3028
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1988 transition count 3028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1987 transition count 3020
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1987 transition count 3020
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1986 transition count 3012
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1986 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1985 transition count 3004
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1985 transition count 3004
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1984 transition count 2996
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1984 transition count 2996
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1983 transition count 2988
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1983 transition count 2988
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1982 transition count 2980
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1982 transition count 2980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1981 transition count 2972
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1981 transition count 2972
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1980 transition count 2964
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1980 transition count 2964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1979 transition count 2956
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1979 transition count 2956
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1978 transition count 2948
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1978 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1977 transition count 2940
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1977 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1976 transition count 2932
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1976 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1975 transition count 2924
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1975 transition count 2924
Applied a total of 36 rules in 1281 ms. Remains 1975 /1993 variables (removed 18) and now considering 2924/3062 (removed 138) transitions.
// Phase 1: matrix 2924 rows 1975 cols
[2025-05-30 14:47:06] [INFO ] Computed 273 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:08] [INFO ] Implicit Places using invariants in 1206 ms returned [29, 754, 936, 1118, 1679]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1214 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1970/1993 places, 2924/3062 transitions.
Applied a total of 0 rules in 81 ms. Remains 1970 /1970 variables (removed 0) and now considering 2924/2924 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2577 ms. Remains : 1970/1993 places, 2924/3062 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-11 finished in 2774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 1993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1989 transition count 3036
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1989 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1988 transition count 3028
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1988 transition count 3028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1987 transition count 3020
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1987 transition count 3020
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1986 transition count 3012
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1986 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1985 transition count 3004
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1985 transition count 3004
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1984 transition count 2996
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1984 transition count 2996
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1983 transition count 2988
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1983 transition count 2988
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1982 transition count 2980
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1982 transition count 2980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1981 transition count 2972
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1981 transition count 2972
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1980 transition count 2964
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1980 transition count 2964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1979 transition count 2956
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1979 transition count 2956
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1978 transition count 2948
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1978 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1977 transition count 2940
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1977 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1976 transition count 2932
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1976 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1975 transition count 2924
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1975 transition count 2924
Applied a total of 36 rules in 1307 ms. Remains 1975 /1993 variables (removed 18) and now considering 2924/3062 (removed 138) transitions.
[2025-05-30 14:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:10] [INFO ] Implicit Places using invariants in 1231 ms returned [29, 754, 936, 1118, 1679, 1897]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1238 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1969/1993 places, 2924/3062 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1967 transition count 2922
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1966 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1965 transition count 2920
Applied a total of 8 rules in 326 ms. Remains 1965 /1969 variables (removed 4) and now considering 2920/2924 (removed 4) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2025-05-30 14:47:11] [INFO ] Computed 267 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:12] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2025-05-30 14:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:18] [INFO ] Implicit Places using invariants and state equation in 6428 ms returned []
Implicit Place search using SMT with State Equation took 7685 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1965/1993 places, 2920/3062 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10557 ms. Remains : 1965/1993 places, 2920/3062 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-14
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-14 finished in 10713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X((p2 U (p3||G(p2))))&&p1)||p0))))'
Found a Shortening insensitive property : ASLink-PT-10a-LTLFireability-07
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 4 out of 1993 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1993/1993 places, 3062/3062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 363 rules applied. Total rules applied 363 place count 1993 transition count 2699
Reduce places removed 363 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 364 rules applied. Total rules applied 727 place count 1630 transition count 2698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 1629 transition count 2698
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 728 place count 1629 transition count 2438
Deduced a syphon composed of 260 places in 5 ms
Ensure Unique test removed 83 places
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 3 with 603 rules applied. Total rules applied 1331 place count 1286 transition count 2438
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 24 rules applied. Total rules applied 1355 place count 1274 transition count 2426
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 1368 place count 1262 transition count 2425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1369 place count 1261 transition count 2425
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 35 Pre rules applied. Total rules applied 1369 place count 1261 transition count 2390
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 1439 place count 1226 transition count 2390
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1447 place count 1218 transition count 2360
Iterating global reduction 6 with 8 rules applied. Total rules applied 1455 place count 1218 transition count 2360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 1462 place count 1215 transition count 2356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1463 place count 1214 transition count 2356
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1464 place count 1213 transition count 2348
Iterating global reduction 8 with 1 rules applied. Total rules applied 1465 place count 1213 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1466 place count 1212 transition count 2340
Iterating global reduction 8 with 1 rules applied. Total rules applied 1467 place count 1212 transition count 2340
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1468 place count 1211 transition count 2332
Iterating global reduction 8 with 1 rules applied. Total rules applied 1469 place count 1211 transition count 2332
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1470 place count 1210 transition count 2324
Iterating global reduction 8 with 1 rules applied. Total rules applied 1471 place count 1210 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1472 place count 1209 transition count 2316
Iterating global reduction 8 with 1 rules applied. Total rules applied 1473 place count 1209 transition count 2316
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1474 place count 1208 transition count 2308
Iterating global reduction 8 with 1 rules applied. Total rules applied 1475 place count 1208 transition count 2308
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1476 place count 1207 transition count 2300
Iterating global reduction 8 with 1 rules applied. Total rules applied 1477 place count 1207 transition count 2300
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1478 place count 1206 transition count 2292
Iterating global reduction 8 with 1 rules applied. Total rules applied 1479 place count 1206 transition count 2292
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1480 place count 1205 transition count 2284
Iterating global reduction 8 with 1 rules applied. Total rules applied 1481 place count 1205 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1482 place count 1204 transition count 2276
Iterating global reduction 8 with 1 rules applied. Total rules applied 1483 place count 1204 transition count 2276
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1484 place count 1203 transition count 2268
Iterating global reduction 8 with 1 rules applied. Total rules applied 1485 place count 1203 transition count 2268
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1486 place count 1202 transition count 2260
Iterating global reduction 8 with 1 rules applied. Total rules applied 1487 place count 1202 transition count 2260
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1488 place count 1201 transition count 2252
Iterating global reduction 8 with 1 rules applied. Total rules applied 1489 place count 1201 transition count 2252
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1490 place count 1200 transition count 2244
Iterating global reduction 8 with 1 rules applied. Total rules applied 1491 place count 1200 transition count 2244
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 5 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 8 with 210 rules applied. Total rules applied 1701 place count 1095 transition count 2139
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1704 place count 1092 transition count 2136
Iterating global reduction 8 with 3 rules applied. Total rules applied 1707 place count 1092 transition count 2136
Applied a total of 1707 rules in 779 ms. Remains 1092 /1993 variables (removed 901) and now considering 2136/3062 (removed 926) transitions.
// Phase 1: matrix 2136 rows 1092 cols
[2025-05-30 14:47:20] [INFO ] Computed 175 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:21] [INFO ] Implicit Places using invariants in 879 ms returned [21, 96, 102, 107, 123, 194, 200, 205, 222, 293, 299, 304, 320, 390, 396, 401, 417, 418, 526, 527, 597, 603, 608, 624, 625, 700, 706, 711, 727, 797, 803, 808, 824, 897, 903, 908, 924, 942, 999, 1007, 1013, 1032, 1076, 1089]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 881 ms to find 44 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1048/1993 places, 2136/3062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1048 transition count 2117
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1029 transition count 2117
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 38 place count 1029 transition count 2094
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 84 place count 1006 transition count 2094
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 104 place count 986 transition count 2074
Iterating global reduction 2 with 20 rules applied. Total rules applied 124 place count 986 transition count 2074
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 986 transition count 2073
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 985 transition count 2073
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 142 place count 969 transition count 2057
Iterating global reduction 2 with 16 rules applied. Total rules applied 158 place count 969 transition count 2057
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 962 transition count 2050
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 962 transition count 2050
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 220 place count 938 transition count 2026
Applied a total of 220 rules in 183 ms. Remains 938 /1048 variables (removed 110) and now considering 2026/2136 (removed 110) transitions.
// Phase 1: matrix 2026 rows 938 cols
[2025-05-30 14:47:21] [INFO ] Computed 131 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:22] [INFO ] Implicit Places using invariants in 687 ms returned [93, 96, 179, 182, 266, 269, 350, 353, 430, 443, 445, 448, 529, 532, 613, 616, 697, 700, 787, 790, 871, 874]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 689 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 916/1993 places, 2026/3062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 916 transition count 2016
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 906 transition count 2016
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 31 place count 895 transition count 2005
Iterating global reduction 2 with 11 rules applied. Total rules applied 42 place count 895 transition count 2005
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 52 place count 895 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 894 transition count 1994
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 894 transition count 1994
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 892 transition count 1992
Applied a total of 58 rules in 143 ms. Remains 892 /916 variables (removed 24) and now considering 1992/2026 (removed 34) transitions.
// Phase 1: matrix 1992 rows 892 cols
[2025-05-30 14:47:22] [INFO ] Computed 109 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:22] [INFO ] Implicit Places using invariants in 624 ms returned [72, 152, 233, 316, 396, 482, 562, 642, 722, 808]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 625 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 882/1993 places, 1992/3062 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 872 transition count 1982
Applied a total of 20 rules in 59 ms. Remains 872 /882 variables (removed 10) and now considering 1982/1992 (removed 10) transitions.
// Phase 1: matrix 1982 rows 872 cols
[2025-05-30 14:47:22] [INFO ] Computed 99 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:23] [INFO ] Implicit Places using invariants in 608 ms returned []
[2025-05-30 14:47:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 14:47:26] [INFO ] Implicit Places using invariants and state equation in 2749 ms returned []
Implicit Place search using SMT with State Equation took 3358 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 4 : 872/1993 places, 1982/3062 transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 6719 ms. Remains : 872/1993 places, 1982/3062 transitions.
Running random walk in product with property : ASLink-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 15360 reset in 567 ms.
Product exploration explored 100000 steps with 15085 reset in 569 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 240 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (467 resets) in 344 ms. (115 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (63 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (58 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (58 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
[2025-05-30 14:47:28] [INFO ] Invariant cache hit.
[2025-05-30 14:47:28] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/178 variables, 15/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 677/855 variables, 73/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/872 variables, 9/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1982/2854 variables, 872/971 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2854 variables, 9/980 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2854 variables, 0/980 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2854 variables, 0/980 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2854/2854 variables, and 980 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 872/872 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/116 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/277 variables, 17/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 582/859 variables, 71/93 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/872 variables, 7/100 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/872 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1982/2854 variables, 872/972 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2854 variables, 9/981 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2854 variables, 1/982 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2854 variables, 0/982 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2854 variables, 0/982 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2854/2854 variables, and 982 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 872/872 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2066ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 1 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1982/1982 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 872 transition count 1980
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 870 transition count 1980
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 870 transition count 1978
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 868 transition count 1978
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 866 transition count 1976
Free-agglomeration rule applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 50 place count 866 transition count 1938
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 98 place count 828 transition count 1928
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 127 place count 828 transition count 1899
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 156 place count 799 transition count 1899
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 799 transition count 1899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 798 transition count 1898
Applied a total of 160 rules in 202 ms. Remains 798 /872 variables (removed 74) and now considering 1898/1982 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 798/872 places, 1898/1982 transitions.
RANDOM walk for 40000 steps (679 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (87 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 224042 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 224042 steps, saw 131278 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1898 rows 798 cols
[2025-05-30 14:47:33] [INFO ] Computed 99 invariants in 21 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 249/352 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/358 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 163/521 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/526 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 145/671 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 67/738 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:47:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/738 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/738 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 60/798 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/798 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1898/2696 variables, 798/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2696 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2696 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2696/2696 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 798/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 249/352 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/358 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 163/521 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/526 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 145/671 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 67/738 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/738 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/738 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 60/798 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/798 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1898/2696 variables, 798/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2696 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2696 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2696 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2696/2696 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 798/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2001ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 798/798 places, 1898/1898 transitions.
Applied a total of 0 rules in 32 ms. Remains 798 /798 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 798/798 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 798/798 places, 1898/1898 transitions.
Applied a total of 0 rules in 30 ms. Remains 798 /798 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2025-05-30 14:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:36] [INFO ] Implicit Places using invariants in 607 ms returned [88, 89, 159, 160, 233, 234, 304, 305, 374, 380, 381, 451, 452, 522, 523, 593, 594, 660, 669, 670]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 608 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 778/798 places, 1898/1898 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 776 transition count 1896
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 776 transition count 1896
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 774 transition count 1894
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 774 transition count 1894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 772 transition count 1892
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 772 transition count 1890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 770 transition count 1890
Applied a total of 16 rules in 129 ms. Remains 770 /778 variables (removed 8) and now considering 1890/1898 (removed 8) transitions.
// Phase 1: matrix 1890 rows 770 cols
[2025-05-30 14:47:36] [INFO ] Computed 79 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:37] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-05-30 14:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:38] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 770/798 places, 1890/1898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3015 ms. Remains : 770/798 places, 1890/1898 transitions.
RANDOM walk for 40000 steps (669 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (88 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217947 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217947 steps, saw 137176 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2025-05-30 14:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/364 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/517 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/532 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/687 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/735 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/735 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/770 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1890/2660 variables, 770/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2660 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2660 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2660/2660 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/364 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/517 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/532 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/687 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/735 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/735 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/770 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1890/2660 variables, 770/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2660 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2660 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2660 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2660/2660 variables, and 850 constraints, problems are : Problem set: 0 solved, 1 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 770/770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1795ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 164 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1890/1890 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 770/770 places, 1890/1890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1890/1890 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
[2025-05-30 14:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:44] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-05-30 14:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:47:46] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:47:46] [INFO ] Redundant transitions in 31 ms returned []
Running 1844 sub problems to find dead transitions.
[2025-05-30 14:47:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/2660 variables, and 75 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 63/64 constraints, State Equation: 0/770 constraints, PredecessorRefiner: 1844/1844 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1844 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/2660 variables, and 75 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 63/64 constraints, State Equation: 0/770 constraints, PredecessorRefiner: 0/1844 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60684ms problems are : Problem set: 0 solved, 1844 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62993 ms. Remains : 770/770 places, 1890/1890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1890/1890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 14:48:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 14:48:47] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-05-30 14:48:47] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 23 ms returned sat
[2025-05-30 14:48:47] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 14:48:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-05-30 14:48:47] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 23 ms returned sat
[2025-05-30 14:48:48] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 14:48:48] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 14:48:48] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1590 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X p1)), (G (OR p0 (NOT p2) p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 p1 p2 p3))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 425 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1982/1982 transitions.
Applied a total of 0 rules in 40 ms. Remains 872 /872 variables (removed 0) and now considering 1982/1982 (removed 0) transitions.
// Phase 1: matrix 1982 rows 872 cols
[2025-05-30 14:48:49] [INFO ] Computed 99 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:48:49] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-05-30 14:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:48:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 14:48:52] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3350 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:48:52] [INFO ] Redundant transitions in 35 ms returned []
Running 1981 sub problems to find dead transitions.
[2025-05-30 14:48:52] [INFO ] Invariant cache hit.
[2025-05-30 14:48:52] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2854 variables, and 55 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 55/82 constraints, State Equation: 0/872 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1981/1981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1981 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2854 variables, and 55 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 55/82 constraints, State Equation: 0/872 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 1981 unsolved
Search for dead transitions found 0 dead transitions in 60690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64125 ms. Remains : 872/872 places, 1982/1982 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1009 steps (12 resets) in 13 ms. (72 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1567 reset in 340 ms.
Product exploration explored 100000 steps with 1558 reset in 354 ms.
Built C files in :
/tmp/ltsmin7281720809129469423
[2025-05-30 14:49:54] [INFO ] Too many transitions (1982) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:49:54] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7281720809129469423
Running compilation step : cd /tmp/ltsmin7281720809129469423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7281720809129469423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7281720809129469423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1982/1982 transitions.
Applied a total of 0 rules in 42 ms. Remains 872 /872 variables (removed 0) and now considering 1982/1982 (removed 0) transitions.
[2025-05-30 14:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:49:58] [INFO ] Implicit Places using invariants in 584 ms returned []
[2025-05-30 14:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:49:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 14:50:01] [INFO ] Implicit Places using invariants and state equation in 2793 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:50:01] [INFO ] Redundant transitions in 53 ms returned []
Running 1981 sub problems to find dead transitions.
[2025-05-30 14:50:01] [INFO ] Invariant cache hit.
[2025-05-30 14:50:01] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2854 variables, and 55 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 55/82 constraints, State Equation: 0/872 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1981/1981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1981 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/2854 variables, and 55 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 55/82 constraints, State Equation: 0/872 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60722ms problems are : Problem set: 0 solved, 1981 unsolved
Search for dead transitions found 0 dead transitions in 60725ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64213 ms. Remains : 872/872 places, 1982/1982 transitions.
Built C files in :
/tmp/ltsmin9810575744277166409
[2025-05-30 14:51:02] [INFO ] Too many transitions (1982) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:51:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9810575744277166409
Running compilation step : cd /tmp/ltsmin9810575744277166409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9810575744277166409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9810575744277166409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 14:51:05] [INFO ] Flatten gal took : 58 ms
[2025-05-30 14:51:05] [INFO ] Flatten gal took : 62 ms
[2025-05-30 14:51:05] [INFO ] Time to serialize gal into /tmp/LTL13704118732416419802.gal : 9 ms
[2025-05-30 14:51:05] [INFO ] Time to serialize properties into /tmp/LTL9185714792661203501.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13704118732416419802.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14872515037367947331.hoa' '-atoms' '/tmp/LTL9185714792661203501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9185714792661203501.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14872515037367947331.hoa
Detected timeout of ITS tools.
[2025-05-30 14:51:20] [INFO ] Flatten gal took : 75 ms
[2025-05-30 14:51:20] [INFO ] Flatten gal took : 60 ms
[2025-05-30 14:51:20] [INFO ] Time to serialize gal into /tmp/LTL17544766463201569289.gal : 10 ms
[2025-05-30 14:51:20] [INFO ] Time to serialize properties into /tmp/LTL6265539442001313773.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17544766463201569289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6265539442001313773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p513==1)||(p290==1))")||(("((p1699!=1)&&(p945==0))")&&(X(("(p1699!=1)")U(("(p513!=1)")||(G("(p1699!=1)"))))))))))
Formula 0 simplified : FG(!"((p513==1)||(p290==1))" & (!"((p1699!=1)&&(p945==0))" | X(!"(p1699!=1)" M !"(p513!=1)")))
Detected timeout of ITS tools.
[2025-05-30 14:51:35] [INFO ] Flatten gal took : 62 ms
[2025-05-30 14:51:35] [INFO ] Applying decomposition
[2025-05-30 14:51:35] [INFO ] Flatten gal took : 60 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/graph6717403188781307354.txt' '-o' '/tmp/graph6717403188781307354.bin' '-w' '/tmp/graph6717403188781307354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6717403188781307354.bin' '-l' '-1' '-v' '-w' '/tmp/graph6717403188781307354.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:51:35] [INFO ] Decomposing Gal with order
[2025-05-30 14:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:51:36] [INFO ] Removed a total of 3877 redundant transitions.
[2025-05-30 14:51:36] [INFO ] Flatten gal took : 104 ms
[2025-05-30 14:51:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 32 ms.
[2025-05-30 14:51:36] [INFO ] Time to serialize gal into /tmp/LTL9129391741936485362.gal : 28 ms
[2025-05-30 14:51:36] [INFO ] Time to serialize properties into /tmp/LTL9748331457989473534.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9129391741936485362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9748331457989473534.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i5.u53.p513==1)||(i4.u43.p290==1))")||(("((i16.u170.p1699!=1)&&(i8.u96.p945==0))")&&(X(("(i16.u170.p1699!=1)")U(("(i5.u53.p...200
Formula 0 simplified : FG(!"((i5.u53.p513==1)||(i4.u43.p290==1))" & (!"((i16.u170.p1699!=1)&&(i8.u96.p945==0))" | X(!"(i16.u170.p1699!=1)" M !"(i5.u53.p513...163
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10a-LTLFireability-07 finished in 272061 ms.
[2025-05-30 14:51:51] [INFO ] Flatten gal took : 92 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16267436803857410086
[2025-05-30 14:51:51] [INFO ] Too many transitions (3062) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:51:51] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16267436803857410086
Running compilation step : cd /tmp/ltsmin16267436803857410086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 14:51:51] [INFO ] Applying decomposition
[2025-05-30 14:51:51] [INFO ] Flatten gal took : 76 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/graph9654429372422231101.txt' '-o' '/tmp/graph9654429372422231101.bin' '-w' '/tmp/graph9654429372422231101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9654429372422231101.bin' '-l' '-1' '-v' '-w' '/tmp/graph9654429372422231101.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:51:51] [INFO ] Decomposing Gal with order
[2025-05-30 14:51:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:51:51] [INFO ] Removed a total of 4201 redundant transitions.
[2025-05-30 14:51:52] [INFO ] Flatten gal took : 153 ms
[2025-05-30 14:51:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 36 ms.
[2025-05-30 14:51:52] [INFO ] Time to serialize gal into /tmp/LTLFireability11524411435682810629.gal : 24 ms
[2025-05-30 14:51:52] [INFO ] Time to serialize properties into /tmp/LTLFireability5618045326800910540.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11524411435682810629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5618045326800910540.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i5.u146.p513==1)||(i2.u78.p290==1))")||(("((i16.u464.p1699!=1)&&(i9.u264.p945==0))")&&(X(("(i16.u464.p1699!=1)")U(("(i5.u14...203
Formula 0 simplified : FG(!"((i5.u146.p513==1)||(i2.u78.p290==1))" & (!"((i16.u464.p1699!=1)&&(i9.u264.p945==0))" | X(!"(i16.u464.p1699!=1)" M !"(i5.u146.p...166
Compilation finished in 7851 ms.
Running link step : cd /tmp/ltsmin16267436803857410086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin16267436803857410086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))&&(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 15:15:39] [INFO ] Applying decomposition
[2025-05-30 15:15:39] [INFO ] Flatten gal took : 212 ms
[2025-05-30 15:15:39] [INFO ] Decomposing Gal with order
[2025-05-30 15:15:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:15:39] [INFO ] Removed a total of 3508 redundant transitions.
[2025-05-30 15:15:40] [INFO ] Flatten gal took : 385 ms
[2025-05-30 15:15:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1288 labels/synchronizations in 188 ms.
[2025-05-30 15:15:40] [INFO ] Time to serialize gal into /tmp/LTLFireability5338352611684802454.gal : 46 ms
[2025-05-30 15:15:40] [INFO ] Time to serialize properties into /tmp/LTLFireability15543372894050762689.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5338352611684802454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15543372894050762689.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i21.u83.p513==1)||(i13.u425.p290==1))")||(("((i70.i3.u295.p1699!=1)&&(i37.i5.u162.p945==0))")&&(X(("(i70.i3.u295.p1699!=1)"...218
Formula 0 simplified : FG(!"((i21.u83.p513==1)||(i13.u425.p290==1))" & (!"((i70.i3.u295.p1699!=1)&&(i37.i5.u162.p945==0))" | X(!"(i70.i3.u295.p1699!=1)" M ...178
Detected timeout of ITS tools.
[2025-05-30 15:40:10] [INFO ] Flatten gal took : 33535 ms

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="ASLink-PT-10a"
export BK_EXAMINATION="LTLFireability"
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 ASLink-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;