Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 677K 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-07a-LTLFireability-00
FORMULA_NAME ASLink-PT-07a-LTLFireability-01
FORMULA_NAME ASLink-PT-07a-LTLFireability-02
FORMULA_NAME ASLink-PT-07a-LTLFireability-03
FORMULA_NAME ASLink-PT-07a-LTLFireability-04
FORMULA_NAME ASLink-PT-07a-LTLFireability-05
FORMULA_NAME ASLink-PT-07a-LTLFireability-06
FORMULA_NAME ASLink-PT-07a-LTLFireability-07
FORMULA_NAME ASLink-PT-07a-LTLFireability-08
FORMULA_NAME ASLink-PT-07a-LTLFireability-09
FORMULA_NAME ASLink-PT-07a-LTLFireability-10
FORMULA_NAME ASLink-PT-07a-LTLFireability-11
FORMULA_NAME ASLink-PT-07a-LTLFireability-12
FORMULA_NAME ASLink-PT-07a-LTLFireability-13
FORMULA_NAME ASLink-PT-07a-LTLFireability-14
FORMULA_NAME ASLink-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748594507106

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 08:41:48] [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 08:41:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 08:41:48] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-05-30 08:41:48] [INFO ] Transformed 1601 places.
[2025-05-30 08:41:48] [INFO ] Transformed 2373 transitions.
[2025-05-30 08:41:48] [INFO ] Found NUPN structural information;
[2025-05-30 08:41:48] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA ASLink-PT-07a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1559 transition count 2348
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 1549 transition count 2300
Ensure Unique test removed 1 places
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 1548 transition count 2300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 1548 transition count 2298
Applied a total of 65 rules in 270 ms. Remains 1548 /1601 variables (removed 53) and now considering 2298/2348 (removed 50) transitions.
// Phase 1: matrix 2298 rows 1548 cols
[2025-05-30 08:41:49] [INFO ] Computed 265 invariants in 133 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:41:50] [INFO ] Implicit Places using invariants in 1628 ms returned [1, 19, 20, 23, 52, 70, 215, 220, 221, 222, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 634, 763, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1332, 1344, 1349, 1350, 1385, 1387, 1390, 1408, 1409, 1410, 1411, 1429, 1437, 1445, 1451, 1457, 1463, 1469, 1477, 1483, 1489, 1497]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 1668 ms to find 69 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1479/1601 places, 2298/2348 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1466 transition count 2285
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1466 transition count 2285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1456 transition count 2275
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1456 transition count 2275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1451 transition count 2270
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1451 transition count 2270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1449 transition count 2268
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1449 transition count 2268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1447 transition count 2266
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1447 transition count 2266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1446 transition count 2265
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1446 transition count 2265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1445 transition count 2264
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1445 transition count 2264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1444 transition count 2263
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1444 transition count 2263
Applied a total of 70 rules in 549 ms. Remains 1444 /1479 variables (removed 35) and now considering 2263/2298 (removed 35) transitions.
// Phase 1: matrix 2263 rows 1444 cols
[2025-05-30 08:41:51] [INFO ] Computed 196 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:41:52] [INFO ] Implicit Places using invariants in 851 ms returned []
[2025-05-30 08:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:41:56] [INFO ] Implicit Places using invariants and state equation in 4491 ms returned []
Implicit Place search using SMT with State Equation took 5350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1444/1601 places, 2263/2348 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7851 ms. Remains : 1444/1601 places, 2263/2348 transitions.
Support contains 64 out of 1444 places after structural reductions.
[2025-05-30 08:41:57] [INFO ] Flatten gal took : 183 ms
[2025-05-30 08:41:57] [INFO ] Flatten gal took : 120 ms
[2025-05-30 08:41:57] [INFO ] Input system was already deterministic with 2263 transitions.
Reduction of identical properties reduced properties to check from 40 to 39
RANDOM walk for 40000 steps (194 resets) in 1681 ms. (23 steps per ms) remains 19/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
[2025-05-30 08:41:58] [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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 203/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 327/567 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 852/1419 variables, 143/187 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 25/1444 variables, 9/196 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2263/3707 variables, 1444/1640 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3707 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3707/3707 variables, and 1640 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5470 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1444/1444 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 203/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 327/567 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 852/1419 variables, 143/187 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:05] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:05] [INFO ] Deduced a trap composed of 26 places in 417 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:05] [INFO ] Deduced a trap composed of 99 places in 463 ms of which 102 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 25/1444 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1444/3707 variables, and 199 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 0/1444 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10548ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 1444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 245 transitions
Trivial Post-agglo rules discarded 245 transitions
Performed 245 trivial Post agglomeration. Transition count delta: 245
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1444 transition count 2018
Reduce places removed 245 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 250 rules applied. Total rules applied 495 place count 1199 transition count 2013
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 500 place count 1194 transition count 2013
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 500 place count 1194 transition count 1825
Deduced a syphon composed of 188 places in 2 ms
Ensure Unique test removed 60 places
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 936 place count 946 transition count 1825
Discarding 10 places :
Implicit places reduction removed 10 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 3 with 11 rules applied. Total rules applied 947 place count 936 transition count 1824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 948 place count 935 transition count 1824
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 948 place count 935 transition count 1797
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1002 place count 908 transition count 1797
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1008 place count 902 transition count 1784
Iterating global reduction 5 with 6 rules applied. Total rules applied 1014 place count 902 transition count 1784
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 1 rules applied. Total rules applied 1015 place count 902 transition count 1783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1016 place count 901 transition count 1783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1016 place count 901 transition count 1782
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1018 place count 900 transition count 1782
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1022 place count 896 transition count 1771
Iterating global reduction 7 with 4 rules applied. Total rules applied 1026 place count 896 transition count 1771
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1029 place count 893 transition count 1768
Iterating global reduction 7 with 3 rules applied. Total rules applied 1032 place count 893 transition count 1768
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1035 place count 893 transition count 1765
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 6 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 8 with 150 rules applied. Total rules applied 1185 place count 818 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1186 place count 817 transition count 1689
Iterating global reduction 8 with 1 rules applied. Total rules applied 1187 place count 817 transition count 1689
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 1194 place count 817 transition count 1682
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1201 place count 810 transition count 1682
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1231 place count 810 transition count 1652
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 1261 place count 780 transition count 1652
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1264 place count 780 transition count 1649
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 1283 place count 780 transition count 1649
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1286 place count 780 transition count 1649
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1287 place count 780 transition count 1648
Applied a total of 1287 rules in 707 ms. Remains 780 /1444 variables (removed 664) and now considering 1648/2263 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 780/1444 places, 1648/2263 transitions.
RANDOM walk for 40000 steps (484 resets) in 1210 ms. (33 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 223346 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :4 out of 19
Probabilistic random walk after 223346 steps, saw 63566 distinct states, run finished after 3007 ms. (steps per millisecond=74 ) properties seen :4
// Phase 1: matrix 1648 rows 780 cols
[2025-05-30 08:42:12] [INFO ] Computed 126 invariants in 18 ms
[2025-05-30 08:42:12] [INFO ] State equation strengthened by 31 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 62/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 147/239 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 450/689 variables, 79/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:13] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:13] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:13] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:14] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 91/780 variables, 17/130 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1648/2428 variables, 780/910 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2428 variables, 31/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2428 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/2428 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2428/2428 variables, and 941 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4098 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 780/780 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 62/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 147/239 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 450/689 variables, 79/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:42:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 91/780 variables, 17/131 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 11 (OVERLAPS) 1648/2428 variables, 780/911 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2428 variables, 31/942 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2428 variables, 5/947 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2428 variables, 0/947 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2428 variables, 0/947 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2428/2428 variables, and 947 constraints, problems are : Problem set: 10 solved, 5 unsolved in 16812 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 780/780 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 5/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20965ms problems are : Problem set: 10 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6397 ms.
Support contains 11 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1648/1648 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 779 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 779 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 778 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 778 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 777 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 777 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 776 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 776 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 775 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 775 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 774 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 774 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 773 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 773 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 772 transition count 1584
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 772 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 771 transition count 1576
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 771 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 770 transition count 1568
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 770 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 769 transition count 1560
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 769 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 768 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 768 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 767 transition count 1544
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 767 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 766 transition count 1536
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 766 transition count 1536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 763 transition count 1533
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 763 transition count 1532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 762 transition count 1532
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 762 transition count 1532
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 762 transition count 1532
Applied a total of 38 rules in 420 ms. Remains 762 /780 variables (removed 18) and now considering 1532/1648 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 762/780 places, 1532/1648 transitions.
RANDOM walk for 40000 steps (514 resets) in 437 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (68 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 239912 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :3 out of 5
Probabilistic random walk after 239912 steps, saw 134547 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :3
// Phase 1: matrix 1532 rows 762 cols
[2025-05-30 08:42:44] [INFO ] Computed 126 invariants in 22 ms
[2025-05-30 08:42:44] [INFO ] State equation strengthened by 32 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) 189/198 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 497/695 variables, 87/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/762 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1532/2294 variables, 762/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2294 variables, 32/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2294 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2294 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2294/2294 variables, and 920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 762/762 constraints, ReadFeed: 32/32 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 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) 189/198 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 497/695 variables, 87/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/762 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1532/2294 variables, 762/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2294 variables, 32/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2294 variables, 2/922 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2294 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2294 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2294/2294 variables, and 922 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 762/762 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2596ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 5 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1532/1532 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 762 transition count 1531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 761 transition count 1531
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 761 transition count 1529
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 759 transition count 1529
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 759 transition count 1528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 758 transition count 1528
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 758 transition count 1527
Applied a total of 9 rules in 104 ms. Remains 758 /762 variables (removed 4) and now considering 1527/1532 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 758/762 places, 1527/1532 transitions.
RANDOM walk for 40000 steps (489 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (82 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 304539 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 304539 steps, saw 80456 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 1527 rows 758 cols
[2025-05-30 08:42:50] [INFO ] Computed 126 invariants in 17 ms
[2025-05-30 08:42:50] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/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) 182/191 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/669 variables, 81/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 89/758 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/758 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1527/2285 variables, 758/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2285 variables, 31/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2285 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2285 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2285/2285 variables, and 915 constraints, problems are : Problem set: 0 solved, 2 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 758/758 constraints, ReadFeed: 31/31 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 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) 182/191 variables, 28/29 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 08:42:50] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 478/669 variables, 81/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 89/758 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/758 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1527/2285 variables, 758/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2285 variables, 31/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2285 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2285 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2285 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2285/2285 variables, and 918 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 758/758 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3119ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 801 ms.
Support contains 5 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1527/1527 transitions.
Applied a total of 0 rules in 29 ms. Remains 758 /758 variables (removed 0) and now considering 1527/1527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 758/758 places, 1527/1527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1527/1527 transitions.
Applied a total of 0 rules in 28 ms. Remains 758 /758 variables (removed 0) and now considering 1527/1527 (removed 0) transitions.
[2025-05-30 08:42:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:54] [INFO ] Implicit Places using invariants in 637 ms returned [98, 104, 107, 109, 110, 117, 118, 125, 126, 127, 197, 203, 206, 208, 211, 218, 219, 292, 298, 301, 303, 306, 313, 314, 315, 333, 389, 397, 403, 406, 413, 414, 415, 484, 490, 493, 495, 498, 505, 506, 507, 576, 582, 585, 587, 590, 597, 598, 599, 668, 674, 677, 682, 685, 698, 699, 754]
[2025-05-30 08:42:54] [INFO ] Actually due to overlaps returned [125, 218, 313, 413, 505, 597, 126, 219, 314, 333, 414, 506, 598, 699, 127, 315, 415, 507, 599, 698, 98, 104, 109, 118, 197, 203, 208, 292, 298, 303, 484, 490, 495, 576, 582, 587, 668, 674, 682, 110, 117, 211, 306, 389, 397, 403, 406, 498, 590, 685, 754]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 639 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 707/758 places, 1527/1527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 707 transition count 1519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 699 transition count 1519
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 16 place count 699 transition count 1507
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 40 place count 687 transition count 1507
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 72 place count 655 transition count 1475
Iterating global reduction 2 with 32 rules applied. Total rules applied 104 place count 655 transition count 1475
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 655 transition count 1469
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 647 transition count 1461
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 647 transition count 1461
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 646 transition count 1460
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 646 transition count 1460
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 154 place count 633 transition count 1447
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 175 place count 633 transition count 1426
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 196 place count 612 transition count 1426
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 612 transition count 1426
Applied a total of 197 rules in 158 ms. Remains 612 /707 variables (removed 95) and now considering 1426/1527 (removed 101) transitions.
// Phase 1: matrix 1426 rows 612 cols
[2025-05-30 08:42:54] [INFO ] Computed 75 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:55] [INFO ] Implicit Places using invariants in 430 ms returned [75, 98, 234, 251, 307, 324, 380, 397, 453, 470, 526, 544, 549]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 432 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 599/758 places, 1426/1527 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 598 transition count 1425
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 598 transition count 1425
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 592 transition count 1419
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 592 transition count 1414
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 24 place count 587 transition count 1414
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 587 transition count 1414
Applied a total of 25 rules in 100 ms. Remains 587 /599 variables (removed 12) and now considering 1414/1426 (removed 12) transitions.
// Phase 1: matrix 1414 rows 587 cols
[2025-05-30 08:42:55] [INFO ] Computed 62 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:55] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-05-30 08:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 08:42:57] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 587/758 places, 1414/1527 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3086 ms. Remains : 587/758 places, 1414/1527 transitions.
RANDOM walk for 40000 steps (613 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (117 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 231328 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 231328 steps, saw 167495 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2025-05-30 08:43:00] [INFO ] Invariant cache hit.
[2025-05-30 08:43:00] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/119 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 414/533 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 54/587 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1414/2001 variables, 587/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2001 variables, 6/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2001 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2001 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2001/2001 variables, and 655 constraints, problems are : Problem set: 0 solved, 2 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 587/587 constraints, ReadFeed: 6/6 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) 41/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/119 variables, 10/13 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 08:43:00] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 414/533 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 54/587 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1414/2001 variables, 587/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2001 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2001 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2001 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2001 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2001/2001 variables, and 658 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 587/587 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2129ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1420 ms.
Support contains 5 out of 587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 587/587 places, 1414/1414 transitions.
Applied a total of 0 rules in 22 ms. Remains 587 /587 variables (removed 0) and now considering 1414/1414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 587/587 places, 1414/1414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 587/587 places, 1414/1414 transitions.
Applied a total of 0 rules in 21 ms. Remains 587 /587 variables (removed 0) and now considering 1414/1414 (removed 0) transitions.
[2025-05-30 08:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:43:04] [INFO ] Implicit Places using invariants in 406 ms returned []
[2025-05-30 08:43:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:43:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 08:43:05] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:43:05] [INFO ] Redundant transitions in 144 ms returned []
Running 1413 sub problems to find dead transitions.
[2025-05-30 08:43:05] [INFO ] Invariant cache hit.
[2025-05-30 08:43:05] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/2001 variables, and 33 constraints, problems are : Problem set: 0 solved, 1413 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/587 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1413/1413 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1413 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1413 unsolved
At refinement iteration 2 (OVERLAPS) 1/587 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/587 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:44:01] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/2001 variables, and 63 constraints, problems are : Problem set: 0 solved, 1413 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 0/587 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1413 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 1413 unsolved
Search for dead transitions found 0 dead transitions in 60572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62544 ms. Remains : 587/587 places, 1414/1414 transitions.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-07a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-07a-LTLFireability-00 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' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 3 out of 1444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 258 transitions
Trivial Post-agglo rules discarded 258 transitions
Performed 258 trivial Post agglomeration. Transition count delta: 258
Iterating post reduction 0 with 258 rules applied. Total rules applied 258 place count 1443 transition count 2004
Reduce places removed 265 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 271 rules applied. Total rules applied 529 place count 1178 transition count 1998
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 536 place count 1172 transition count 1997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 1171 transition count 1997
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 537 place count 1171 transition count 1791
Deduced a syphon composed of 206 places in 1 ms
Ensure Unique test removed 60 places
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 4 with 472 rules applied. Total rules applied 1009 place count 905 transition count 1791
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 33 rules applied. Total rules applied 1042 place count 887 transition count 1776
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1057 place count 872 transition count 1776
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 1057 place count 872 transition count 1748
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1113 place count 844 transition count 1748
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1126 place count 831 transition count 1728
Iterating global reduction 6 with 13 rules applied. Total rules applied 1139 place count 831 transition count 1728
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 8 rules applied. Total rules applied 1147 place count 831 transition count 1720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1148 place count 830 transition count 1720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1148 place count 830 transition count 1719
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1150 place count 829 transition count 1719
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1154 place count 825 transition count 1708
Iterating global reduction 8 with 4 rules applied. Total rules applied 1158 place count 825 transition count 1708
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1162 place count 821 transition count 1697
Iterating global reduction 8 with 4 rules applied. Total rules applied 1166 place count 821 transition count 1697
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1169 place count 821 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1170 place count 820 transition count 1686
Iterating global reduction 9 with 1 rules applied. Total rules applied 1171 place count 820 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1172 place count 819 transition count 1678
Iterating global reduction 9 with 1 rules applied. Total rules applied 1173 place count 819 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1174 place count 818 transition count 1670
Iterating global reduction 9 with 1 rules applied. Total rules applied 1175 place count 818 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1176 place count 817 transition count 1662
Iterating global reduction 9 with 1 rules applied. Total rules applied 1177 place count 817 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1178 place count 816 transition count 1654
Iterating global reduction 9 with 1 rules applied. Total rules applied 1179 place count 816 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1180 place count 815 transition count 1646
Iterating global reduction 9 with 1 rules applied. Total rules applied 1181 place count 815 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1182 place count 814 transition count 1638
Iterating global reduction 9 with 1 rules applied. Total rules applied 1183 place count 814 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1184 place count 813 transition count 1630
Iterating global reduction 9 with 1 rules applied. Total rules applied 1185 place count 813 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1186 place count 812 transition count 1622
Iterating global reduction 9 with 1 rules applied. Total rules applied 1187 place count 812 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1188 place count 811 transition count 1614
Iterating global reduction 9 with 1 rules applied. Total rules applied 1189 place count 811 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1190 place count 810 transition count 1606
Iterating global reduction 9 with 1 rules applied. Total rules applied 1191 place count 810 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1192 place count 809 transition count 1598
Iterating global reduction 9 with 1 rules applied. Total rules applied 1193 place count 809 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1194 place count 808 transition count 1590
Iterating global reduction 9 with 1 rules applied. Total rules applied 1195 place count 808 transition count 1590
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 9 with 146 rules applied. Total rules applied 1341 place count 735 transition count 1517
Applied a total of 1341 rules in 491 ms. Remains 735 /1444 variables (removed 709) and now considering 1517/2263 (removed 746) transitions.
// Phase 1: matrix 1517 rows 735 cols
[2025-05-30 08:44:07] [INFO ] Computed 111 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:07] [INFO ] Implicit Places using invariants in 525 ms returned [75, 96, 102, 107, 108, 113, 171, 188, 194, 199, 201, 261, 278, 284, 289, 291, 317, 352, 373, 381, 387, 389, 449, 466, 472, 478, 482, 542, 559, 565, 570, 572, 632, 649, 655, 660, 662, 674, 731]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 528 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 696/1444 places, 1517/2263 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 696 transition count 1507
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 686 transition count 1507
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 34 place count 672 transition count 1493
Iterating global reduction 2 with 14 rules applied. Total rules applied 48 place count 672 transition count 1493
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 61 place count 659 transition count 1480
Iterating global reduction 2 with 13 rules applied. Total rules applied 74 place count 659 transition count 1480
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 652 transition count 1473
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 652 transition count 1473
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 124 place count 634 transition count 1455
Applied a total of 124 rules in 96 ms. Remains 634 /696 variables (removed 62) and now considering 1455/1517 (removed 62) transitions.
// Phase 1: matrix 1455 rows 634 cols
[2025-05-30 08:44:07] [INFO ] Computed 72 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:08] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-05-30 08:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:09] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1748 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 634/1444 places, 1455/2263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2863 ms. Remains : 634/1444 places, 1455/2263 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-01 finished in 3191 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((p0||X(X(X(p1))))))'
Support contains 4 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1441 transition count 2248
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1441 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1440 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1440 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1439 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1439 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1438 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1438 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1437 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1437 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1436 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1436 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1435 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1435 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1434 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1434 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1433 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1433 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1432 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1432 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1431 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1431 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1430 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1430 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1429 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1429 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1428 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1428 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1427 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1427 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1426 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1426 transition count 2128
Applied a total of 36 rules in 892 ms. Remains 1426 /1444 variables (removed 18) and now considering 2128/2263 (removed 135) transitions.
// Phase 1: matrix 2128 rows 1426 cols
[2025-05-30 08:44:10] [INFO ] Computed 196 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:11] [INFO ] Implicit Places using invariants in 883 ms returned [29, 192, 591, 1299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 885 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1444 places, 2128/2263 transitions.
Applied a total of 0 rules in 51 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1828 ms. Remains : 1422/1444 places, 2128/2263 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-02
Product exploration explored 100000 steps with 19965 reset in 625 ms.
Product exploration explored 100000 steps with 19941 reset in 653 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 (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (201 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (23 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (21 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228778 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228778 steps, saw 77127 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 2128 rows 1422 cols
[2025-05-30 08:44:16] [INFO ] Computed 192 invariants in 25 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 494/594 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 820/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3550/3550 variables, and 1614 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 494/594 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 820/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 2/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3550 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3550 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3550/3550 variables, and 1616 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2230 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3281ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 4 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1422 transition count 1847
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 1141 transition count 1847
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 188 Pre rules applied. Total rules applied 562 place count 1141 transition count 1659
Deduced a syphon composed of 188 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 437 rules applied. Total rules applied 999 place count 892 transition count 1659
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1019 place count 881 transition count 1650
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1028 place count 872 transition count 1650
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1028 place count 872 transition count 1622
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1084 place count 844 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1089 place count 839 transition count 1617
Iterating global reduction 4 with 5 rules applied. Total rules applied 1094 place count 839 transition count 1617
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 1098 place count 839 transition count 1613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1099 place count 838 transition count 1613
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1099 place count 838 transition count 1612
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1101 place count 837 transition count 1612
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 1257 place count 759 transition count 1534
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1264 place count 759 transition count 1527
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1271 place count 752 transition count 1527
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1299 place count 752 transition count 1499
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1328 place count 723 transition count 1499
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1335 place count 723 transition count 1492
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1357 place count 723 transition count 1492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1358 place count 722 transition count 1491
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1365 place count 715 transition count 1491
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1365 place count 715 transition count 1477
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1400 place count 694 transition count 1477
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1407 place count 687 transition count 1470
Iterating global reduction 9 with 7 rules applied. Total rules applied 1414 place count 687 transition count 1470
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1421 place count 687 transition count 1463
Applied a total of 1421 rules in 292 ms. Remains 687 /1422 variables (removed 735) and now considering 1463/2128 (removed 665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 687/1422 places, 1463/2128 transitions.
RANDOM walk for 40000 steps (649 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (106 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 342497 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 2
Probabilistic random walk after 342497 steps, saw 88142 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
// Phase 1: matrix 1463 rows 687 cols
[2025-05-30 08:44:23] [INFO ] Computed 105 invariants in 16 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 36/113 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 217/330 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/352 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 108/460 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/464 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 85/549 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/552 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 81/633 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/641 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/642 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/642 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 45/687 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/687 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1463/2150 variables, 687/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2150 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/2150 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2150/2150 variables, and 792 constraints, problems are : Problem set: 0 solved, 2 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 687/687 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/113 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 217/330 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/352 variables, 5/51 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 08:44:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 108/460 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/464 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 85/549 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/549 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/552 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 81/633 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/633 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/641 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/642 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/642 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 45/687 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/687 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 1463/2150 variables, 687/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2150 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2150 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/2150 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2150/2150 variables, and 795 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 687/687 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2547ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 4 out of 687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 687 /687 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 687/687 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1463/1463 transitions.
Applied a total of 0 rules in 23 ms. Remains 687 /687 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-05-30 08:44:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:27] [INFO ] Implicit Places using invariants in 557 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 438, 444, 447, 449, 450, 455, 456, 508, 525, 531, 534, 536, 537, 542, 543, 595, 612, 618, 621, 623, 624]
[2025-05-30 08:44:27] [INFO ] Actually due to overlaps returned [187, 274, 361, 450, 537, 624, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 438, 444, 449, 525, 531, 536, 612, 618, 623, 71, 100, 158, 245, 332, 419, 508, 595]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 560 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 652/687 places, 1463/1463 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 623 transition count 1434
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 623 transition count 1434
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 616 transition count 1427
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 616 transition count 1427
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 100 place count 602 transition count 1413
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 121 place count 602 transition count 1392
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 142 place count 581 transition count 1392
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 149 place count 581 transition count 1385
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 156 place count 574 transition count 1385
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 157 place count 574 transition count 1385
Applied a total of 157 rules in 134 ms. Remains 574 /652 variables (removed 78) and now considering 1385/1463 (removed 78) transitions.
// Phase 1: matrix 1385 rows 574 cols
[2025-05-30 08:44:27] [INFO ] Computed 70 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:27] [INFO ] Implicit Places using invariants in 454 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 374, 375, 445, 446]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 456 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 562/687 places, 1385/1463 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1194 ms. Remains : 562/687 places, 1385/1463 transitions.
RANDOM walk for 40000 steps (702 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (135 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (137 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 247772 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 247772 steps, saw 159179 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
// Phase 1: matrix 1385 rows 562 cols
[2025-05-30 08:44:30] [INFO ] Computed 58 invariants in 10 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 186/225 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/251 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 180/431 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/435 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 112/547 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/551 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/562 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 186/225 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/251 variables, 7/21 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 08:44:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 180/431 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 112/547 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/551 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/562 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/562 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1385/1947 variables, 562/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1947 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1947 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1947 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 623 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1721ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 185 ms.
Support contains 4 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2025-05-30 08:44:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:33] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-30 08:44:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:34] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:44:34] [INFO ] Redundant transitions in 26 ms returned []
Running 1351 sub problems to find dead transitions.
[2025-05-30 08:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62000 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-05-30 08:45:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 08:45:34] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-30 08:45:34] [INFO ] [Real]Absence check using 12 positive and 46 generalized place invariants in 21 ms returned sat
[2025-05-30 08:45:35] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 08:45:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-30 08:45:35] [INFO ] [Nat]Absence check using 12 positive and 46 generalized place invariants in 17 ms returned sat
[2025-05-30 08:45:36] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 08:45:36] [INFO ] After 992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 08:45:36] [INFO ] After 1231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1773 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 52 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2025-05-30 08:45:36] [INFO ] Computed 192 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:45:37] [INFO ] Implicit Places using invariants in 848 ms returned []
[2025-05-30 08:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:45:41] [INFO ] Implicit Places using invariants and state equation in 3581 ms returned []
Implicit Place search using SMT with State Equation took 4431 ms to find 0 implicit places.
Running 2127 sub problems to find dead transitions.
[2025-05-30 08:45:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 2127/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 0/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 2127 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Finished structural reductions in LTL mode , in 1 iterations and 65183 ms. Remains : 1422/1422 places, 2128/2128 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (206 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (23 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (22 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 235345 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 235345 steps, saw 79346 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2025-05-30 08:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 494/594 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 820/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3550/3550 variables, and 1614 constraints, problems are : Problem set: 0 solved, 2 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 494/594 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 820/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 2/1616 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 08:46:48] [INFO ] Deduced a trap composed of 91 places in 297 ms of which 64 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3550 variables, 1/1617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3550 variables, 0/1617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3550 variables, 0/1617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3550/3550 variables, and 1617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2565 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3521ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 665 ms.
Support contains 4 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1422 transition count 1847
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 1141 transition count 1847
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 188 Pre rules applied. Total rules applied 562 place count 1141 transition count 1659
Deduced a syphon composed of 188 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 437 rules applied. Total rules applied 999 place count 892 transition count 1659
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1019 place count 881 transition count 1650
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1028 place count 872 transition count 1650
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1028 place count 872 transition count 1622
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1084 place count 844 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1089 place count 839 transition count 1617
Iterating global reduction 4 with 5 rules applied. Total rules applied 1094 place count 839 transition count 1617
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 1098 place count 839 transition count 1613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1099 place count 838 transition count 1613
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1099 place count 838 transition count 1612
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1101 place count 837 transition count 1612
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 1257 place count 759 transition count 1534
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1264 place count 759 transition count 1527
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1271 place count 752 transition count 1527
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1299 place count 752 transition count 1499
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1328 place count 723 transition count 1499
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1335 place count 723 transition count 1492
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1357 place count 723 transition count 1492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1358 place count 722 transition count 1491
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1365 place count 715 transition count 1491
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1365 place count 715 transition count 1477
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1400 place count 694 transition count 1477
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1407 place count 687 transition count 1470
Iterating global reduction 9 with 7 rules applied. Total rules applied 1414 place count 687 transition count 1470
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1421 place count 687 transition count 1463
Applied a total of 1421 rules in 266 ms. Remains 687 /1422 variables (removed 735) and now considering 1463/2128 (removed 665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 687/1422 places, 1463/2128 transitions.
RANDOM walk for 40000 steps (609 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (110 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 332721 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 332721 steps, saw 86306 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 1463 rows 687 cols
[2025-05-30 08:46:53] [INFO ] Computed 105 invariants in 17 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 36/113 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 217/330 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/352 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 108/460 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/464 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 85/549 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/552 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 81/633 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/641 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/642 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/642 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 45/687 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/687 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1463/2150 variables, 687/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2150 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/2150 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2150/2150 variables, and 792 constraints, problems are : Problem set: 0 solved, 2 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 687/687 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/113 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 217/330 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/352 variables, 5/51 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 08:46:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 108/460 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/464 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 85/549 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/549 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/552 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 81/633 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/633 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/641 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/642 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/642 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 45/687 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/687 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 1463/2150 variables, 687/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2150 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2150 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/2150 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2150/2150 variables, and 795 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 687/687 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2637ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 4 out of 687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1463/1463 transitions.
Applied a total of 0 rules in 22 ms. Remains 687 /687 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 687/687 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1463/1463 transitions.
Applied a total of 0 rules in 21 ms. Remains 687 /687 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-05-30 08:46:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:56] [INFO ] Implicit Places using invariants in 586 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 438, 444, 447, 449, 450, 455, 456, 508, 525, 531, 534, 536, 537, 542, 543, 595, 612, 618, 621, 623, 624]
[2025-05-30 08:46:56] [INFO ] Actually due to overlaps returned [187, 274, 361, 450, 537, 624, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 438, 444, 449, 525, 531, 536, 612, 618, 623, 71, 100, 158, 245, 332, 419, 508, 595]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 588 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 652/687 places, 1463/1463 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 623 transition count 1434
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 623 transition count 1434
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 616 transition count 1427
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 616 transition count 1427
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 100 place count 602 transition count 1413
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 121 place count 602 transition count 1392
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 142 place count 581 transition count 1392
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 149 place count 581 transition count 1385
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 156 place count 574 transition count 1385
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 157 place count 574 transition count 1385
Applied a total of 157 rules in 125 ms. Remains 574 /652 variables (removed 78) and now considering 1385/1463 (removed 78) transitions.
// Phase 1: matrix 1385 rows 574 cols
[2025-05-30 08:46:56] [INFO ] Computed 70 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:57] [INFO ] Implicit Places using invariants in 417 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 374, 375, 445, 446]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 418 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 562/687 places, 1385/1463 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1172 ms. Remains : 562/687 places, 1385/1463 transitions.
RANDOM walk for 40000 steps (668 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (139 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 254164 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 254164 steps, saw 163777 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 1385 rows 562 cols
[2025-05-30 08:47:00] [INFO ] Computed 58 invariants in 9 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 186/225 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/251 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 180/431 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/435 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 112/547 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/551 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/562 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 186/225 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/251 variables, 7/21 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 08:47:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 180/431 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 112/547 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/551 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/562 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/562 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1385/1947 variables, 562/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1947 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1947 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1947 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 623 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1642ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 184 ms.
Support contains 4 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2025-05-30 08:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:47:02] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-05-30 08:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:47:03] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:47:03] [INFO ] Redundant transitions in 87 ms returned []
Running 1351 sub problems to find dead transitions.
[2025-05-30 08:47:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61940 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-05-30 08:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 08:48:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-30 08:48:04] [INFO ] [Real]Absence check using 12 positive and 46 generalized place invariants in 18 ms returned sat
[2025-05-30 08:48:04] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 08:48:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-30 08:48:04] [INFO ] [Nat]Absence check using 12 positive and 46 generalized place invariants in 16 ms returned sat
[2025-05-30 08:48:05] [INFO ] After 832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 08:48:05] [INFO ] After 980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 08:48:05] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1707 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 19998 reset in 528 ms.
Product exploration explored 100000 steps with 20006 reset in 551 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1422 transition count 2128
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 280 place count 1422 transition count 2160
Deduced a syphon composed of 381 places in 2 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 381 place count 1422 transition count 2160
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 387 place count 1419 transition count 2160
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 427 place count 1379 transition count 2120
Deduced a syphon composed of 346 places in 2 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 467 place count 1379 transition count 2120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 467 place count 1379 transition count 2120
Deduced a syphon composed of 347 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 468 place count 1379 transition count 2120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 469 place count 1378 transition count 2119
Deduced a syphon composed of 346 places in 8 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 470 place count 1378 transition count 2119
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 525 places in 1 ms
Iterating global reduction 2 with 179 rules applied. Total rules applied 649 place count 1378 transition count 2143
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 742 place count 1285 transition count 2050
Deduced a syphon composed of 432 places in 2 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 835 place count 1285 transition count 2050
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 440 places in 2 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 843 place count 1285 transition count 2094
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 441 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 844 place count 1285 transition count 2098
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 846 place count 1283 transition count 2092
Deduced a syphon composed of 439 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 848 place count 1283 transition count 2092
Deduced a syphon composed of 439 places in 2 ms
Applied a total of 848 rules in 589 ms. Remains 1283 /1422 variables (removed 139) and now considering 2092/2128 (removed 36) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:48:08] [INFO ] Redundant transitions in 156 ms returned []
Running 2091 sub problems to find dead transitions.
// Phase 1: matrix 2092 rows 1283 cols
[2025-05-30 08:48:08] [INFO ] Computed 189 invariants in 14 ms
[2025-05-30 08:48:08] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1282 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1282/3375 variables, and 135 constraints, problems are : Problem set: 0 solved, 2091 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 135/143 constraints, State Equation: 0/1283 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 2091/2091 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2091 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1282 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1282/3375 variables, and 135 constraints, problems are : Problem set: 0 solved, 2091 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 135/143 constraints, State Equation: 0/1283 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/2091 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60695ms problems are : Problem set: 0 solved, 2091 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1283/1422 places, 2092/2128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61455 ms. Remains : 1283/1422 places, 2092/2128 transitions.
Built C files in :
/tmp/ltsmin3560351127837948731
[2025-05-30 08:49:09] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3560351127837948731
Running compilation step : cd /tmp/ltsmin3560351127837948731;'/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/ltsmin3560351127837948731;'/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/ltsmin3560351127837948731;'/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 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 49 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2025-05-30 08:49:12] [INFO ] Computed 192 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:13] [INFO ] Implicit Places using invariants in 850 ms returned []
[2025-05-30 08:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:16] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 4380 ms to find 0 implicit places.
Running 2127 sub problems to find dead transitions.
[2025-05-30 08:49:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 2127/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 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 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 0/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60645ms problems are : Problem set: 0 solved, 2127 unsolved
Search for dead transitions found 0 dead transitions in 60650ms
Finished structural reductions in LTL mode , in 1 iterations and 65086 ms. Remains : 1422/1422 places, 2128/2128 transitions.
Built C files in :
/tmp/ltsmin7608662884937847223
[2025-05-30 08:50:17] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7608662884937847223
Running compilation step : cd /tmp/ltsmin7608662884937847223;'/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/ltsmin7608662884937847223;'/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/ltsmin7608662884937847223;'/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 08:50:20] [INFO ] Flatten gal took : 75 ms
[2025-05-30 08:50:20] [INFO ] Flatten gal took : 71 ms
[2025-05-30 08:50:20] [INFO ] Time to serialize gal into /tmp/LTL10677665483176742922.gal : 19 ms
[2025-05-30 08:50:20] [INFO ] Time to serialize properties into /tmp/LTL128076235612669846.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/LTL10677665483176742922.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7341836285513676263.hoa' '-atoms' '/tmp/LTL128076235612669846.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...317
Loading property file /tmp/LTL128076235612669846.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7341836285513676263.hoa
Detected timeout of ITS tools.
[2025-05-30 08:50:35] [INFO ] Flatten gal took : 76 ms
[2025-05-30 08:50:35] [INFO ] Flatten gal took : 68 ms
[2025-05-30 08:50:35] [INFO ] Time to serialize gal into /tmp/LTL4933072730788929771.gal : 15 ms
[2025-05-30 08:50:35] [INFO ] Time to serialize properties into /tmp/LTL6874265809923426274.ltl : 4 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/LTL4933072730788929771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6874265809923426274.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...275
Read 1 LTL properties
Checking formula 0 : !((G((X(X(X("(((p877==0)||(p882==0))||(((p1025==1)&&(p1244==1))&&((p877==1)&&(p882==1))))"))))||("((p877==1)&&(p882==1))"))))
Formula 0 simplified : F(!"((p877==1)&&(p882==1))" & XXX!"(((p877==0)||(p882==0))||(((p1025==1)&&(p1244==1))&&((p877==1)&&(p882==1))))")
Detected timeout of ITS tools.
[2025-05-30 08:50:51] [INFO ] Flatten gal took : 59 ms
[2025-05-30 08:50:51] [INFO ] Applying decomposition
[2025-05-30 08:50:51] [INFO ] Flatten gal took : 58 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/graph5309481369929600540.txt' '-o' '/tmp/graph5309481369929600540.bin' '-w' '/tmp/graph5309481369929600540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5309481369929600540.bin' '-l' '-1' '-v' '-w' '/tmp/graph5309481369929600540.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:50:51] [INFO ] Decomposing Gal with order
[2025-05-30 08:50:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:50:51] [INFO ] Removed a total of 2863 redundant transitions.
[2025-05-30 08:50:51] [INFO ] Flatten gal took : 187 ms
[2025-05-30 08:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 44 ms.
[2025-05-30 08:50:51] [INFO ] Time to serialize gal into /tmp/LTL2041347493788026105.gal : 24 ms
[2025-05-30 08:50:51] [INFO ] Time to serialize properties into /tmp/LTL10241929048950781373.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/LTL2041347493788026105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10241929048950781373.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((X(X(X("(((i9.i1.u244.p877==0)||(i9.i1.u243.p882==0))||(((i11.u286.p1025==1)&&(i11.u342.p1244==1))&&((i9.i1.u244.p877==1)&&(i9.i1...230
Formula 0 simplified : F(!"((i9.i1.u244.p877==1)&&(i9.i1.u243.p882==1))" & XXX!"(((i9.i1.u244.p877==0)||(i9.i1.u243.p882==0))||(((i11.u286.p1025==1)&&(i11....220
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLFireability-02 finished in 417085 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' '!(F(p0))'
Support contains 1 out of 1444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 259 place count 1443 transition count 2003
Reduce places removed 266 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 272 rules applied. Total rules applied 531 place count 1177 transition count 1997
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 537 place count 1171 transition count 1997
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 206 Pre rules applied. Total rules applied 537 place count 1171 transition count 1791
Deduced a syphon composed of 206 places in 2 ms
Ensure Unique test removed 60 places
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 1009 place count 905 transition count 1791
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 33 rules applied. Total rules applied 1042 place count 887 transition count 1776
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1057 place count 872 transition count 1776
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1057 place count 872 transition count 1748
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1113 place count 844 transition count 1748
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1127 place count 830 transition count 1722
Iterating global reduction 5 with 14 rules applied. Total rules applied 1141 place count 830 transition count 1722
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 9 rules applied. Total rules applied 1150 place count 829 transition count 1714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1151 place count 828 transition count 1714
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1151 place count 828 transition count 1713
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1153 place count 827 transition count 1713
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1157 place count 823 transition count 1702
Iterating global reduction 7 with 4 rules applied. Total rules applied 1161 place count 823 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1165 place count 819 transition count 1691
Iterating global reduction 7 with 4 rules applied. Total rules applied 1169 place count 819 transition count 1691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1172 place count 819 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1173 place count 818 transition count 1680
Iterating global reduction 8 with 1 rules applied. Total rules applied 1174 place count 818 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1175 place count 817 transition count 1672
Iterating global reduction 8 with 1 rules applied. Total rules applied 1176 place count 817 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1177 place count 816 transition count 1664
Iterating global reduction 8 with 1 rules applied. Total rules applied 1178 place count 816 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1179 place count 815 transition count 1656
Iterating global reduction 8 with 1 rules applied. Total rules applied 1180 place count 815 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1181 place count 814 transition count 1648
Iterating global reduction 8 with 1 rules applied. Total rules applied 1182 place count 814 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1183 place count 813 transition count 1640
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 813 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1185 place count 812 transition count 1632
Iterating global reduction 8 with 1 rules applied. Total rules applied 1186 place count 812 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1187 place count 811 transition count 1624
Iterating global reduction 8 with 1 rules applied. Total rules applied 1188 place count 811 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1189 place count 810 transition count 1616
Iterating global reduction 8 with 1 rules applied. Total rules applied 1190 place count 810 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1191 place count 809 transition count 1608
Iterating global reduction 8 with 1 rules applied. Total rules applied 1192 place count 809 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1193 place count 808 transition count 1600
Iterating global reduction 8 with 1 rules applied. Total rules applied 1194 place count 808 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1195 place count 807 transition count 1592
Iterating global reduction 8 with 1 rules applied. Total rules applied 1196 place count 807 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1197 place count 806 transition count 1584
Iterating global reduction 8 with 1 rules applied. Total rules applied 1198 place count 806 transition count 1584
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 8 with 150 rules applied. Total rules applied 1348 place count 731 transition count 1509
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1349 place count 730 transition count 1508
Iterating global reduction 8 with 1 rules applied. Total rules applied 1350 place count 730 transition count 1508
Applied a total of 1350 rules in 434 ms. Remains 730 /1444 variables (removed 714) and now considering 1508/2263 (removed 755) transitions.
// Phase 1: matrix 1508 rows 730 cols
[2025-05-30 08:51:07] [INFO ] Computed 110 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:07] [INFO ] Implicit Places using invariants in 505 ms returned [21, 74, 95, 101, 106, 108, 166, 183, 189, 194, 196, 256, 273, 279, 284, 286, 312, 347, 368, 376, 382, 384, 444, 461, 467, 472, 474, 534, 551, 557, 562, 564, 624, 633, 644, 650, 655, 657, 669, 726]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 508 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 690/1444 places, 1508/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 690 transition count 1494
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 676 transition count 1494
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 42 place count 662 transition count 1480
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 662 transition count 1480
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 70 place count 648 transition count 1466
Iterating global reduction 2 with 14 rules applied. Total rules applied 84 place count 648 transition count 1466
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 641 transition count 1459
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 641 transition count 1459
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 136 place count 622 transition count 1440
Applied a total of 136 rules in 85 ms. Remains 622 /690 variables (removed 68) and now considering 1440/1508 (removed 68) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2025-05-30 08:51:07] [INFO ] Computed 70 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:08] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-05-30 08:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:09] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 622/1444 places, 1440/2263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2628 ms. Remains : 622/1444 places, 1440/2263 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-03
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-03 finished in 2692 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(F(p0)))'
Support contains 2 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1442 transition count 2256
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1442 transition count 2256
Applied a total of 4 rules in 80 ms. Remains 1442 /1444 variables (removed 2) and now considering 2256/2263 (removed 7) transitions.
// Phase 1: matrix 2256 rows 1442 cols
[2025-05-30 08:51:09] [INFO ] Computed 196 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:10] [INFO ] Implicit Places using invariants in 867 ms returned [29, 192, 591, 1299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 868 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1438/1444 places, 2256/2263 transitions.
Applied a total of 0 rules in 41 ms. Remains 1438 /1438 variables (removed 0) and now considering 2256/2256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 991 ms. Remains : 1438/1444 places, 2256/2263 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-04
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-04 finished in 1090 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' '!(F((X(p1)&&p0)))'
Support contains 5 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1441 transition count 2248
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1441 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1440 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1440 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1439 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1439 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1438 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1438 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1437 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1437 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1436 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1436 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1435 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1435 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1434 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1434 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1433 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1433 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1432 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1432 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1431 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1431 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1430 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1430 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1429 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1429 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1428 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1428 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1427 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1427 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1426 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1426 transition count 2128
Applied a total of 36 rules in 665 ms. Remains 1426 /1444 variables (removed 18) and now considering 2128/2263 (removed 135) transitions.
// Phase 1: matrix 2128 rows 1426 cols
[2025-05-30 08:51:11] [INFO ] Computed 196 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:12] [INFO ] Implicit Places using invariants in 833 ms returned [29, 192, 591, 1299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 835 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1444 places, 2128/2263 transitions.
Applied a total of 0 rules in 41 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1541 ms. Remains : 1422/1444 places, 2128/2263 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-05
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-05 finished in 1637 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(p0))'
Support contains 3 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1441 transition count 2248
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1441 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1440 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1440 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1439 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1439 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1438 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1438 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1437 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1437 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1436 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1436 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1435 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1435 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1434 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1434 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1433 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1433 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1432 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1432 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1431 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1431 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1430 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1430 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1429 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1429 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1428 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1428 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1427 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1427 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1426 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1426 transition count 2128
Applied a total of 36 rules in 672 ms. Remains 1426 /1444 variables (removed 18) and now considering 2128/2263 (removed 135) transitions.
[2025-05-30 08:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:13] [INFO ] Implicit Places using invariants in 816 ms returned [29, 192, 591, 1299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 818 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1444 places, 2128/2263 transitions.
Applied a total of 0 rules in 40 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1531 ms. Remains : 1422/1444 places, 2128/2263 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 870 ms.
Product exploration explored 100000 steps with 50000 reset in 831 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 : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-07a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-07a-LTLFireability-06 finished in 3381 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' '!((F(p0)&&X(X((G(p1)||X(F(p2)))))))'
Support contains 6 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1441 transition count 2248
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1441 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1440 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1440 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1439 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1439 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1438 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1438 transition count 2224
Applied a total of 12 rules in 193 ms. Remains 1438 /1444 variables (removed 6) and now considering 2224/2263 (removed 39) transitions.
// Phase 1: matrix 2224 rows 1438 cols
[2025-05-30 08:51:15] [INFO ] Computed 196 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:16] [INFO ] Implicit Places using invariants in 836 ms returned [29, 192, 1299]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 838 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1435/1444 places, 2224/2263 transitions.
Applied a total of 0 rules in 41 ms. Remains 1435 /1435 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1073 ms. Remains : 1435/1444 places, 2224/2263 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-07
Stuttering criterion allowed to conclude after 113 steps with 2 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-07 finished in 1325 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(!p0)&&F(G((!p0||X(p0)))))))'
Support contains 2 out of 1444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 260 place count 1444 transition count 2003
Reduce places removed 260 places and 0 transitions.
Iterating post reduction 1 with 260 rules applied. Total rules applied 520 place count 1184 transition count 2003
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 191 Pre rules applied. Total rules applied 520 place count 1184 transition count 1812
Deduced a syphon composed of 191 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 443 rules applied. Total rules applied 963 place count 932 transition count 1812
Discarding 10 places :
Implicit places reduction removed 10 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 2 with 11 rules applied. Total rules applied 974 place count 922 transition count 1811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 975 place count 921 transition count 1811
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 975 place count 921 transition count 1783
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1031 place count 893 transition count 1783
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1038 place count 886 transition count 1764
Iterating global reduction 4 with 7 rules applied. Total rules applied 1045 place count 886 transition count 1764
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 4 with 2 rules applied. Total rules applied 1047 place count 885 transition count 1763
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1048 place count 884 transition count 1763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1048 place count 884 transition count 1762
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1050 place count 883 transition count 1762
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1054 place count 879 transition count 1751
Iterating global reduction 6 with 4 rules applied. Total rules applied 1058 place count 879 transition count 1751
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1062 place count 875 transition count 1740
Iterating global reduction 6 with 4 rules applied. Total rules applied 1066 place count 875 transition count 1740
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1069 place count 875 transition count 1737
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1070 place count 874 transition count 1729
Iterating global reduction 7 with 1 rules applied. Total rules applied 1071 place count 874 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1072 place count 873 transition count 1721
Iterating global reduction 7 with 1 rules applied. Total rules applied 1073 place count 873 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1074 place count 872 transition count 1713
Iterating global reduction 7 with 1 rules applied. Total rules applied 1075 place count 872 transition count 1713
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1076 place count 871 transition count 1705
Iterating global reduction 7 with 1 rules applied. Total rules applied 1077 place count 871 transition count 1705
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1078 place count 870 transition count 1697
Iterating global reduction 7 with 1 rules applied. Total rules applied 1079 place count 870 transition count 1697
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1080 place count 869 transition count 1689
Iterating global reduction 7 with 1 rules applied. Total rules applied 1081 place count 869 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1082 place count 868 transition count 1681
Iterating global reduction 7 with 1 rules applied. Total rules applied 1083 place count 868 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1084 place count 867 transition count 1673
Iterating global reduction 7 with 1 rules applied. Total rules applied 1085 place count 867 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1086 place count 866 transition count 1665
Iterating global reduction 7 with 1 rules applied. Total rules applied 1087 place count 866 transition count 1665
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1088 place count 865 transition count 1657
Iterating global reduction 7 with 1 rules applied. Total rules applied 1089 place count 865 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1090 place count 864 transition count 1649
Iterating global reduction 7 with 1 rules applied. Total rules applied 1091 place count 864 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1092 place count 863 transition count 1641
Iterating global reduction 7 with 1 rules applied. Total rules applied 1093 place count 863 transition count 1641
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1094 place count 862 transition count 1633
Iterating global reduction 7 with 1 rules applied. Total rules applied 1095 place count 862 transition count 1633
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 160 rules applied. Total rules applied 1255 place count 782 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1256 place count 781 transition count 1552
Iterating global reduction 7 with 1 rules applied. Total rules applied 1257 place count 781 transition count 1552
Applied a total of 1257 rules in 455 ms. Remains 781 /1444 variables (removed 663) and now considering 1552/2263 (removed 711) transitions.
// Phase 1: matrix 1552 rows 781 cols
[2025-05-30 08:51:17] [INFO ] Computed 124 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:18] [INFO ] Implicit Places using invariants in 554 ms returned [23, 98, 104, 109, 126, 196, 202, 207, 223, 293, 299, 304, 320, 338, 395, 403, 409, 425, 495, 501, 506, 522, 592, 598, 603, 619, 689, 695, 700, 719, 720, 777]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 555 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/1444 places, 1552/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 749 transition count 1538
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 735 transition count 1538
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 735 transition count 1524
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 721 transition count 1524
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 720 transition count 1524
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 71 place count 706 transition count 1510
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 706 transition count 1510
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 99 place count 692 transition count 1496
Iterating global reduction 3 with 14 rules applied. Total rules applied 113 place count 692 transition count 1496
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 685 transition count 1489
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 685 transition count 1489
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 165 place count 666 transition count 1470
Applied a total of 165 rules in 95 ms. Remains 666 /749 variables (removed 83) and now considering 1470/1552 (removed 82) transitions.
// Phase 1: matrix 1470 rows 666 cols
[2025-05-30 08:51:18] [INFO ] Computed 91 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:18] [INFO ] Implicit Places using invariants in 443 ms returned [95, 179, 182, 263, 266, 347, 350, 431, 434, 515, 518, 599, 602]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 444 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 653/1444 places, 1470/2263 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 0 with 7 rules applied. Total rules applied 7 place count 653 transition count 1463
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 646 transition count 1463
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 21 place count 639 transition count 1456
Iterating global reduction 2 with 7 rules applied. Total rules applied 28 place count 639 transition count 1456
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 35 place count 639 transition count 1449
Applied a total of 35 rules in 41 ms. Remains 639 /653 variables (removed 14) and now considering 1449/1470 (removed 21) transitions.
// Phase 1: matrix 1449 rows 639 cols
[2025-05-30 08:51:18] [INFO ] Computed 78 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:19] [INFO ] Implicit Places using invariants in 410 ms returned [74, 155, 235, 315, 395, 475, 555]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 411 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 632/1444 places, 1449/2263 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 625 transition count 1442
Applied a total of 14 rules in 35 ms. Remains 625 /632 variables (removed 7) and now considering 1442/1449 (removed 7) transitions.
// Phase 1: matrix 1442 rows 625 cols
[2025-05-30 08:51:19] [INFO ] Computed 71 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:19] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-05-30 08:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:51:20] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 625/1444 places, 1442/2263 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3909 ms. Remains : 625/1444 places, 1442/2263 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, p0, false, false]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-09
Product exploration explored 100000 steps with 1328 reset in 334 ms.
Product exploration explored 100000 steps with 1323 reset in 302 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 4 states, 7 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[p0, p0, false, false]
RANDOM walk for 40000 steps (534 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (100 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8910 steps, run visited all 1 properties in 24 ms. (steps per millisecond=371 )
Probabilistic random walk after 8910 steps, saw 8603 distinct states, run finished after 31 ms. (steps per millisecond=287 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 4 states, 7 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[p0, p0, false, false]
Stuttering acceptance computed with spot in 156 ms :[p0, p0, false, false]
Support contains 2 out of 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 1442/1442 transitions.
Applied a total of 0 rules in 23 ms. Remains 625 /625 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2025-05-30 08:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:22] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-05-30 08:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:51:24] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:51:24] [INFO ] Redundant transitions in 31 ms returned []
Running 1441 sub problems to find dead transitions.
[2025-05-30 08:51:24] [INFO ] Invariant cache hit.
[2025-05-30 08:51:24] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/2067 variables, and 38 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 38/58 constraints, State Equation: 0/625 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (OVERLAPS) 1/625 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/2067 variables, and 71 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 0/625 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62307 ms. Remains : 625/625 places, 1442/1442 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 4 states, 7 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, p0, false, false]
RANDOM walk for 40000 steps (554 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (100 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8910 steps, run visited all 1 properties in 27 ms. (steps per millisecond=330 )
Probabilistic random walk after 8910 steps, saw 8603 distinct states, run finished after 27 ms. (steps per millisecond=330 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 4 states, 7 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[p0, p0, false, false]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, false, false]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, false, false]
Product exploration explored 100000 steps with 1298 reset in 246 ms.
Product exploration explored 100000 steps with 1271 reset in 261 ms.
Built C files in :
/tmp/ltsmin7242303742609889404
[2025-05-30 08:52:26] [INFO ] Computing symmetric may disable matrix : 1442 transitions.
[2025-05-30 08:52:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:52:26] [INFO ] Computing symmetric may enable matrix : 1442 transitions.
[2025-05-30 08:52:26] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:52:26] [INFO ] Computing Do-Not-Accords matrix : 1442 transitions.
[2025-05-30 08:52:26] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:52:26] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7242303742609889404
Running compilation step : cd /tmp/ltsmin7242303742609889404;'/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/ltsmin7242303742609889404;'/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/ltsmin7242303742609889404;'/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 2 out of 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 1442/1442 transitions.
Applied a total of 0 rules in 19 ms. Remains 625 /625 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2025-05-30 08:52:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:52:30] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-05-30 08:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:52:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:52:31] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:52:31] [INFO ] Redundant transitions in 31 ms returned []
Running 1441 sub problems to find dead transitions.
[2025-05-30 08:52:31] [INFO ] Invariant cache hit.
[2025-05-30 08:52:31] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/2067 variables, and 38 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 38/58 constraints, State Equation: 0/625 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 2 (OVERLAPS) 1/625 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/2067 variables, and 71 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 0/625 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62348 ms. Remains : 625/625 places, 1442/1442 transitions.
Built C files in :
/tmp/ltsmin10370361347120903379
[2025-05-30 08:53:31] [INFO ] Computing symmetric may disable matrix : 1442 transitions.
[2025-05-30 08:53:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:53:31] [INFO ] Computing symmetric may enable matrix : 1442 transitions.
[2025-05-30 08:53:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:53:32] [INFO ] Computing Do-Not-Accords matrix : 1442 transitions.
[2025-05-30 08:53:32] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:53:32] [INFO ] Built C files in 439ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10370361347120903379
Running compilation step : cd /tmp/ltsmin10370361347120903379;'/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/ltsmin10370361347120903379;'/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/ltsmin10370361347120903379;'/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 08:53:35] [INFO ] Flatten gal took : 41 ms
[2025-05-30 08:53:35] [INFO ] Flatten gal took : 42 ms
[2025-05-30 08:53:35] [INFO ] Time to serialize gal into /tmp/LTL654730791043124267.gal : 7 ms
[2025-05-30 08:53:35] [INFO ] Time to serialize properties into /tmp/LTL2486045102492562412.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/LTL654730791043124267.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6871660566326840671.hoa' '-atoms' '/tmp/LTL2486045102492562412.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...316
Loading property file /tmp/LTL2486045102492562412.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6871660566326840671.hoa
Detected timeout of ITS tools.
[2025-05-30 08:53:50] [INFO ] Flatten gal took : 39 ms
[2025-05-30 08:53:50] [INFO ] Flatten gal took : 37 ms
[2025-05-30 08:53:50] [INFO ] Time to serialize gal into /tmp/LTL13870442546281455411.gal : 6 ms
[2025-05-30 08:53:50] [INFO ] Time to serialize properties into /tmp/LTL3517907384022664275.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/LTL13870442546281455411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3517907384022664275.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("((p25!=1)||(p204!=1))"))&&(F(G(("((p25!=1)||(p204!=1))")||(X("((p25==1)&&(p204==1))"))))))))
Formula 0 simplified : F(G!"((p25!=1)||(p204!=1))" | GF(!"((p25!=1)||(p204!=1))" & X!"((p25==1)&&(p204==1))"))
Detected timeout of ITS tools.
[2025-05-30 08:54:05] [INFO ] Flatten gal took : 36 ms
[2025-05-30 08:54:05] [INFO ] Applying decomposition
[2025-05-30 08:54:05] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4324972689739807248.txt' '-o' '/tmp/graph4324972689739807248.bin' '-w' '/tmp/graph4324972689739807248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4324972689739807248.bin' '-l' '-1' '-v' '-w' '/tmp/graph4324972689739807248.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:54:05] [INFO ] Decomposing Gal with order
[2025-05-30 08:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:54:06] [INFO ] Removed a total of 2878 redundant transitions.
[2025-05-30 08:54:06] [INFO ] Flatten gal took : 88 ms
[2025-05-30 08:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 19 ms.
[2025-05-30 08:54:06] [INFO ] Time to serialize gal into /tmp/LTL12132221125688852832.gal : 9 ms
[2025-05-30 08:54:06] [INFO ] Time to serialize properties into /tmp/LTL14007400314309977900.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/LTL12132221125688852832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14007400314309977900.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...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.u9.p25!=1)||(i1.u8.p204!=1))"))&&(F(G(("((i0.u9.p25!=1)||(i1.u8.p204!=1))")||(X("((i0.u9.p25==1)&&(i1.u8.p204==1))")))))...158
Formula 0 simplified : F(G!"((i0.u9.p25!=1)||(i1.u8.p204!=1))" | GF(!"((i0.u9.p25!=1)||(i1.u8.p204!=1))" & X!"((i0.u9.p25==1)&&(i1.u8.p204==1))"))
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLFireability-09 finished in 184233 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((p0&&F(G((p1&&(p2||X(p3))))))))'
Support contains 6 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1441 transition count 2248
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1441 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1440 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1440 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1439 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1439 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1438 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1438 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1437 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1437 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1436 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1436 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1435 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1435 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1434 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1434 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1433 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1433 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1432 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1432 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1431 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1431 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1430 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1430 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1429 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1429 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1428 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1428 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1427 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1427 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1426 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1426 transition count 2128
Applied a total of 36 rules in 685 ms. Remains 1426 /1444 variables (removed 18) and now considering 2128/2263 (removed 135) transitions.
// Phase 1: matrix 2128 rows 1426 cols
[2025-05-30 08:54:21] [INFO ] Computed 196 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:22] [INFO ] Implicit Places using invariants in 830 ms returned [29, 192, 591, 1299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 832 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1444 places, 2128/2263 transitions.
Applied a total of 0 rules in 45 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1562 ms. Remains : 1422/1444 places, 2128/2263 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-10
Stuttering criterion allowed to conclude after 323 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-10 finished in 1822 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((p0&&F(p1))))'
Support contains 3 out of 1444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 256 transitions
Trivial Post-agglo rules discarded 256 transitions
Performed 256 trivial Post agglomeration. Transition count delta: 256
Iterating post reduction 0 with 256 rules applied. Total rules applied 256 place count 1444 transition count 2007
Reduce places removed 256 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 257 rules applied. Total rules applied 513 place count 1188 transition count 2006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 514 place count 1187 transition count 2006
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 514 place count 1187 transition count 1815
Deduced a syphon composed of 191 places in 2 ms
Ensure Unique test removed 60 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 442 rules applied. Total rules applied 956 place count 936 transition count 1815
Discarding 10 places :
Implicit places reduction removed 10 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 3 with 11 rules applied. Total rules applied 967 place count 926 transition count 1814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 968 place count 925 transition count 1814
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 968 place count 925 transition count 1787
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1022 place count 898 transition count 1787
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1029 place count 891 transition count 1768
Iterating global reduction 5 with 7 rules applied. Total rules applied 1036 place count 891 transition count 1768
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 2 rules applied. Total rules applied 1038 place count 890 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1039 place count 889 transition count 1767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1039 place count 889 transition count 1766
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1041 place count 888 transition count 1766
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1045 place count 884 transition count 1755
Iterating global reduction 7 with 4 rules applied. Total rules applied 1049 place count 884 transition count 1755
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1053 place count 880 transition count 1744
Iterating global reduction 7 with 4 rules applied. Total rules applied 1057 place count 880 transition count 1744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1060 place count 880 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1061 place count 879 transition count 1733
Iterating global reduction 8 with 1 rules applied. Total rules applied 1062 place count 879 transition count 1733
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1063 place count 878 transition count 1725
Iterating global reduction 8 with 1 rules applied. Total rules applied 1064 place count 878 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1065 place count 877 transition count 1717
Iterating global reduction 8 with 1 rules applied. Total rules applied 1066 place count 877 transition count 1717
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1067 place count 876 transition count 1709
Iterating global reduction 8 with 1 rules applied. Total rules applied 1068 place count 876 transition count 1709
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1069 place count 875 transition count 1701
Iterating global reduction 8 with 1 rules applied. Total rules applied 1070 place count 875 transition count 1701
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1071 place count 874 transition count 1693
Iterating global reduction 8 with 1 rules applied. Total rules applied 1072 place count 874 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1073 place count 873 transition count 1685
Iterating global reduction 8 with 1 rules applied. Total rules applied 1074 place count 873 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1075 place count 872 transition count 1677
Iterating global reduction 8 with 1 rules applied. Total rules applied 1076 place count 872 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1077 place count 871 transition count 1669
Iterating global reduction 8 with 1 rules applied. Total rules applied 1078 place count 871 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1079 place count 870 transition count 1661
Iterating global reduction 8 with 1 rules applied. Total rules applied 1080 place count 870 transition count 1661
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1081 place count 869 transition count 1653
Iterating global reduction 8 with 1 rules applied. Total rules applied 1082 place count 869 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1083 place count 868 transition count 1645
Iterating global reduction 8 with 1 rules applied. Total rules applied 1084 place count 868 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1085 place count 867 transition count 1637
Iterating global reduction 8 with 1 rules applied. Total rules applied 1086 place count 867 transition count 1637
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 158 rules applied. Total rules applied 1244 place count 788 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1245 place count 787 transition count 1557
Iterating global reduction 8 with 1 rules applied. Total rules applied 1246 place count 787 transition count 1557
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1248 place count 787 transition count 1557
Applied a total of 1248 rules in 458 ms. Remains 787 /1444 variables (removed 657) and now considering 1557/2263 (removed 706) transitions.
// Phase 1: matrix 1557 rows 787 cols
[2025-05-30 08:54:23] [INFO ] Computed 125 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:24] [INFO ] Implicit Places using invariants in 565 ms returned [22, 97, 103, 108, 114, 125, 196, 202, 207, 296, 302, 307, 323, 341, 398, 406, 412, 428, 498, 504, 509, 525, 595, 601, 606, 622, 692, 698, 706, 725, 726, 783]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 567 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 755/1444 places, 1557/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 755 transition count 1543
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 741 transition count 1543
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 28 place count 741 transition count 1531
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 52 place count 729 transition count 1531
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 728 transition count 1531
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 728 transition count 1530
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 727 transition count 1530
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 68 place count 714 transition count 1517
Iterating global reduction 3 with 13 rules applied. Total rules applied 81 place count 714 transition count 1517
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 94 place count 701 transition count 1504
Iterating global reduction 3 with 13 rules applied. Total rules applied 107 place count 701 transition count 1504
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 694 transition count 1497
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 694 transition count 1497
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 159 place count 675 transition count 1478
Applied a total of 159 rules in 97 ms. Remains 675 /755 variables (removed 80) and now considering 1478/1557 (removed 79) transitions.
// Phase 1: matrix 1478 rows 675 cols
[2025-05-30 08:54:24] [INFO ] Computed 92 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:24] [INFO ] Implicit Places using invariants in 463 ms returned [94, 267, 270, 351, 354, 435, 438, 519, 522, 608, 611]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 464 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 664/1444 places, 1478/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 664 transition count 1472
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 658 transition count 1472
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 652 transition count 1466
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 652 transition count 1466
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 652 transition count 1460
Applied a total of 30 rules in 41 ms. Remains 652 /664 variables (removed 12) and now considering 1460/1478 (removed 18) transitions.
// Phase 1: matrix 1460 rows 652 cols
[2025-05-30 08:54:24] [INFO ] Computed 81 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:25] [INFO ] Implicit Places using invariants in 414 ms returned [73, 243, 323, 403, 483, 563]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 416 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 646/1444 places, 1460/2263 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 640 transition count 1454
Applied a total of 12 rules in 35 ms. Remains 640 /646 variables (removed 6) and now considering 1454/1460 (removed 6) transitions.
// Phase 1: matrix 1454 rows 640 cols
[2025-05-30 08:54:25] [INFO ] Computed 75 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:25] [INFO ] Implicit Places using invariants in 404 ms returned []
[2025-05-30 08:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 08:54:27] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 640/1444 places, 1454/2263 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3967 ms. Remains : 640/1444 places, 1454/2263 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-11
Product exploration explored 100000 steps with 1504 reset in 297 ms.
Product exploration explored 100000 steps with 1449 reset in 360 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 40000 steps (473 resets) in 189 ms. (210 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2025-05-30 08:54:28] [INFO ] Invariant cache hit.
[2025-05-30 08:54:28] [INFO ] State equation strengthened by 6 read => feed constraints.
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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 490/613 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/640 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1454/2094 variables, 640/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2094 variables, 6/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2094 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2094 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2094/2094 variables, and 721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 640/640 constraints, ReadFeed: 6/6 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/123 variables, 10/13 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 08:54:28] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 490/613 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/640 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1454/2094 variables, 640/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2094 variables, 6/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2094 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2094 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2094 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2094/2094 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 640/640 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1792ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 3 out of 640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1454/1454 transitions.
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 640 transition count 1427
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 60 place count 613 transition count 1421
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 613 transition count 1400
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 102 place count 592 transition count 1400
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 592 transition count 1400
Applied a total of 104 rules in 93 ms. Remains 592 /640 variables (removed 48) and now considering 1400/1454 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 592/640 places, 1400/1454 transitions.
RANDOM walk for 40000 steps (644 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (103 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290442 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290442 steps, saw 199634 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
// Phase 1: matrix 1400 rows 592 cols
[2025-05-30 08:54:33] [INFO ] Computed 75 invariants in 16 ms
[2025-05-30 08:54:33] [INFO ] State equation strengthened by 7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/119 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/480 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/592 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1400/1992 variables, 592/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1992 variables, 7/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1992 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1992 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1992/1992 variables, and 674 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 592/592 constraints, ReadFeed: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/119 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/480 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/592 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1400/1992 variables, 592/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1992 variables, 7/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1992 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1992 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1992 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1992/1992 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 592/592 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1854ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1400/1400 transitions.
Applied a total of 0 rules in 18 ms. Remains 592 /592 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 592/592 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1400/1400 transitions.
Applied a total of 0 rules in 19 ms. Remains 592 /592 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2025-05-30 08:54:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:35] [INFO ] Implicit Places using invariants in 449 ms returned [89, 90, 162, 169, 170, 244, 245, 315, 316, 386, 387, 457, 458, 525]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 450 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 578/592 places, 1400/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 577 transition count 1399
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 577 transition count 1399
Applied a total of 2 rules in 31 ms. Remains 577 /578 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 577 cols
[2025-05-30 08:54:35] [INFO ] Computed 61 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:36] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-05-30 08:54:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:54:37] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 577/592 places, 1399/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2346 ms. Remains : 577/592 places, 1399/1400 transitions.
RANDOM walk for 40000 steps (652 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (92 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286774 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 286774 steps, saw 197132 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-05-30 08:54:40] [INFO ] Invariant cache hit.
[2025-05-30 08:54:40] [INFO ] State equation strengthened by 7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/131 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/523 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/577 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1399/1976 variables, 577/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1976 variables, 7/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1976 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1976 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1976/1976 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 577/577 constraints, ReadFeed: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/131 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/523 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/577 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1399/1976 variables, 577/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1976 variables, 7/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1976 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1976 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1976 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1976/1976 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 577/577 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1814ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 193 ms.
Support contains 3 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1399/1399 transitions.
Applied a total of 0 rules in 17 ms. Remains 577 /577 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 577/577 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1399/1399 transitions.
Applied a total of 0 rules in 17 ms. Remains 577 /577 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2025-05-30 08:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:43] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-05-30 08:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:54:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:54:44] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:54:44] [INFO ] Redundant transitions in 29 ms returned []
Running 1398 sub problems to find dead transitions.
[2025-05-30 08:54:44] [INFO ] Invariant cache hit.
[2025-05-30 08:54:44] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/1976 variables, and 32 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 32/46 constraints, State Equation: 0/577 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 2 (OVERLAPS) 1/577 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/1976 variables, and 61 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/577 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62388 ms. Remains : 577/577 places, 1399/1399 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 577 /577 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 08:55:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 08:55:45] [INFO ] After 80ms 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 08:55:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-05-30 08:55:45] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 17 ms returned sat
[2025-05-30 08:55:46] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 08:55:46] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 08:55:46] [INFO ] After 1051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1161 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 1454/1454 transitions.
Applied a total of 0 rules in 26 ms. Remains 640 /640 variables (removed 0) and now considering 1454/1454 (removed 0) transitions.
// Phase 1: matrix 1454 rows 640 cols
[2025-05-30 08:55:46] [INFO ] Computed 75 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:55:47] [INFO ] Implicit Places using invariants in 416 ms returned []
[2025-05-30 08:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:55:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 08:55:48] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:55:48] [INFO ] Redundant transitions in 32 ms returned []
Running 1453 sub problems to find dead transitions.
[2025-05-30 08:55:48] [INFO ] Invariant cache hit.
[2025-05-30 08:55:48] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 15.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/2094 variables, and 44 constraints, problems are : Problem set: 0 solved, 1453 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 44/62 constraints, State Equation: 0/640 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1453/1453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
At refinement iteration 2 (OVERLAPS) 1/640 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2094 variables, and 75 constraints, problems are : Problem set: 0 solved, 1453 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 0/640 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 1453 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62455 ms. Remains : 640/640 places, 1454/1454 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 40000 steps (507 resets) in 126 ms. (314 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2025-05-30 08:56:49] [INFO ] Invariant cache hit.
[2025-05-30 08:56:49] [INFO ] State equation strengthened by 6 read => feed constraints.
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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 490/613 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/640 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1454/2094 variables, 640/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2094 variables, 6/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2094 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2094 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2094/2094 variables, and 721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 640/640 constraints, ReadFeed: 6/6 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/123 variables, 10/13 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 08:56:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 490/613 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/640 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1454/2094 variables, 640/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2094 variables, 6/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2094 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2094 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2094 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2094/2094 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 640/640 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1765ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 242 ms.
Support contains 3 out of 640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1454/1454 transitions.
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 640 transition count 1427
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 60 place count 613 transition count 1421
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 613 transition count 1400
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 102 place count 592 transition count 1400
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 592 transition count 1400
Applied a total of 104 rules in 78 ms. Remains 592 /640 variables (removed 48) and now considering 1400/1454 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 592/640 places, 1400/1454 transitions.
RANDOM walk for 40000 steps (677 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (98 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286168 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 286168 steps, saw 196693 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 1400 rows 592 cols
[2025-05-30 08:56:54] [INFO ] Computed 75 invariants in 17 ms
[2025-05-30 08:56:54] [INFO ] State equation strengthened by 7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/119 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/480 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/592 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1400/1992 variables, 592/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1992 variables, 7/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1992 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1992 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1992/1992 variables, and 674 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 592/592 constraints, ReadFeed: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/119 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/480 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/592 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1400/1992 variables, 592/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1992 variables, 7/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1992 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1992 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1992 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1992/1992 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 592/592 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1834ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 217 ms.
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1400/1400 transitions.
Applied a total of 0 rules in 19 ms. Remains 592 /592 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 592/592 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1400/1400 transitions.
Applied a total of 0 rules in 20 ms. Remains 592 /592 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2025-05-30 08:56:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:56:57] [INFO ] Implicit Places using invariants in 434 ms returned [89, 90, 162, 169, 170, 244, 245, 315, 316, 386, 387, 457, 458, 525]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 435 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 578/592 places, 1400/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 577 transition count 1399
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 577 transition count 1399
Applied a total of 2 rules in 32 ms. Remains 577 /578 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 577 cols
[2025-05-30 08:56:57] [INFO ] Computed 61 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:56:57] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-05-30 08:56:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:56:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:56:58] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 577/592 places, 1399/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2315 ms. Remains : 577/592 places, 1399/1400 transitions.
RANDOM walk for 40000 steps (655 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (102 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 292005 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 292005 steps, saw 200660 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2025-05-30 08:57:02] [INFO ] Invariant cache hit.
[2025-05-30 08:57:02] [INFO ] State equation strengthened by 7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/131 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/523 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/577 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1399/1976 variables, 577/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1976 variables, 7/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1976 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1976 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1976/1976 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 577/577 constraints, ReadFeed: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/131 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/523 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/577 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1399/1976 variables, 577/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1976 variables, 7/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1976 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1976 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1976 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1976/1976 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 577/577 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 3 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1399/1399 transitions.
Applied a total of 0 rules in 19 ms. Remains 577 /577 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 577/577 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1399/1399 transitions.
Applied a total of 0 rules in 19 ms. Remains 577 /577 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2025-05-30 08:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:57:04] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-05-30 08:57:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:57:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:57:05] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:57:06] [INFO ] Redundant transitions in 29 ms returned []
Running 1398 sub problems to find dead transitions.
[2025-05-30 08:57:06] [INFO ] Invariant cache hit.
[2025-05-30 08:57:06] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/1976 variables, and 32 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 32/46 constraints, State Equation: 0/577 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 2 (OVERLAPS) 1/577 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/1976 variables, and 61 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/577 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60449ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62321 ms. Remains : 577/577 places, 1399/1399 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 18 ms. Remains 577 /577 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 08:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 08:58:06] [INFO ] After 74ms 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 08:58:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-05-30 08:58:06] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 16 ms returned sat
[2025-05-30 08:58:07] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 08:58:07] [INFO ] After 814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 08:58:07] [INFO ] After 963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1065 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 1459 reset in 260 ms.
Product exploration explored 100000 steps with 1410 reset in 278 ms.
Built C files in :
/tmp/ltsmin4821656175914666574
[2025-05-30 08:58:08] [INFO ] Computing symmetric may disable matrix : 1454 transitions.
[2025-05-30 08:58:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:58:08] [INFO ] Computing symmetric may enable matrix : 1454 transitions.
[2025-05-30 08:58:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:58:08] [INFO ] Computing Do-Not-Accords matrix : 1454 transitions.
[2025-05-30 08:58:08] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:58:08] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4821656175914666574
Running compilation step : cd /tmp/ltsmin4821656175914666574;'/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/ltsmin4821656175914666574;'/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/ltsmin4821656175914666574;'/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 3 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 1454/1454 transitions.
Applied a total of 0 rules in 20 ms. Remains 640 /640 variables (removed 0) and now considering 1454/1454 (removed 0) transitions.
// Phase 1: matrix 1454 rows 640 cols
[2025-05-30 08:58:11] [INFO ] Computed 75 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:58:12] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-05-30 08:58:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:58:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 08:58:13] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:58:13] [INFO ] Redundant transitions in 27 ms returned []
Running 1453 sub problems to find dead transitions.
[2025-05-30 08:58:13] [INFO ] Invariant cache hit.
[2025-05-30 08:58:13] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/2094 variables, and 44 constraints, problems are : Problem set: 0 solved, 1453 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 44/62 constraints, State Equation: 0/640 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1453/1453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
At refinement iteration 2 (OVERLAPS) 1/640 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2094 variables, and 75 constraints, problems are : Problem set: 0 solved, 1453 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 0/640 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1453 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62378 ms. Remains : 640/640 places, 1454/1454 transitions.
Built C files in :
/tmp/ltsmin7145865117309115287
[2025-05-30 08:59:14] [INFO ] Computing symmetric may disable matrix : 1454 transitions.
[2025-05-30 08:59:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:59:14] [INFO ] Computing symmetric may enable matrix : 1454 transitions.
[2025-05-30 08:59:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:59:14] [INFO ] Computing Do-Not-Accords matrix : 1454 transitions.
[2025-05-30 08:59:14] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:59:14] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7145865117309115287
Running compilation step : cd /tmp/ltsmin7145865117309115287;'/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/ltsmin7145865117309115287;'/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/ltsmin7145865117309115287;'/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 08:59:17] [INFO ] Flatten gal took : 37 ms
[2025-05-30 08:59:17] [INFO ] Flatten gal took : 37 ms
[2025-05-30 08:59:17] [INFO ] Time to serialize gal into /tmp/LTL2311201945973056508.gal : 6 ms
[2025-05-30 08:59:17] [INFO ] Time to serialize properties into /tmp/LTL6669156929121876649.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/LTL2311201945973056508.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11060449639250332551.hoa' '-atoms' '/tmp/LTL6669156929121876649.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...318
Loading property file /tmp/LTL6669156929121876649.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11060449639250332551.hoa
Detected timeout of ITS tools.
[2025-05-30 08:59:32] [INFO ] Flatten gal took : 36 ms
[2025-05-30 08:59:32] [INFO ] Flatten gal took : 37 ms
[2025-05-30 08:59:32] [INFO ] Time to serialize gal into /tmp/LTL13120151548029312580.gal : 6 ms
[2025-05-30 08:59:32] [INFO ] Time to serialize properties into /tmp/LTL10975501206534960455.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/LTL13120151548029312580.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10975501206534960455.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(p1349==0)"))&&("(((p1349==0)||(p392==0))||(p421==0))"))))
Formula 0 simplified : F(!"(((p1349==0)||(p392==0))||(p421==0))" | G!"(p1349==0)")
Detected timeout of ITS tools.
[2025-05-30 08:59:48] [INFO ] Flatten gal took : 37 ms
[2025-05-30 08:59:48] [INFO ] Applying decomposition
[2025-05-30 08:59:48] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13016830338625516572.txt' '-o' '/tmp/graph13016830338625516572.bin' '-w' '/tmp/graph13016830338625516572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13016830338625516572.bin' '-l' '-1' '-v' '-w' '/tmp/graph13016830338625516572.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:59:48] [INFO ] Decomposing Gal with order
[2025-05-30 08:59:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:59:48] [INFO ] Removed a total of 2867 redundant transitions.
[2025-05-30 08:59:48] [INFO ] Flatten gal took : 67 ms
[2025-05-30 08:59:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 11 ms.
[2025-05-30 08:59:48] [INFO ] Time to serialize gal into /tmp/LTL10184727595909018172.gal : 9 ms
[2025-05-30 08:59:48] [INFO ] Time to serialize properties into /tmp/LTL11162129264093658599.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/LTL10184727595909018172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11162129264093658599.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...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(i13.u138.p1349==0)"))&&("(((i13.u138.p1349==0)||(i3.i1.u48.p392==0))||(i3.i1.u47.p421==0))"))))
Formula 0 simplified : F(!"(((i13.u138.p1349==0)||(i3.i1.u48.p392==0))||(i3.i1.u47.p421==0))" | G!"(i13.u138.p1349==0)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLFireability-11 finished in 340278 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' '!(F((p0&&X(p0))))'
Support contains 1 out of 1444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1441 transition count 2248
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1441 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1440 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1440 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1439 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1439 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1438 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1438 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1437 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1437 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1436 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1436 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1435 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1435 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1434 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1434 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1433 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1433 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1432 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1432 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1431 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1431 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1430 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1430 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1429 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1429 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1428 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1428 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1427 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1427 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1426 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1426 transition count 2128
Applied a total of 36 rules in 665 ms. Remains 1426 /1444 variables (removed 18) and now considering 2128/2263 (removed 135) transitions.
// Phase 1: matrix 2128 rows 1426 cols
[2025-05-30 09:00:04] [INFO ] Computed 196 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:00:04] [INFO ] Implicit Places using invariants in 847 ms returned [29, 192, 591, 1299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 849 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1444 places, 2128/2263 transitions.
Applied a total of 0 rules in 40 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1556 ms. Remains : 1422/1444 places, 2128/2263 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-12
Stuttering criterion allowed to conclude after 225 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-07a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-12 finished in 1645 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(p0)))'
Support contains 2 out of 1444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1444/1444 places, 2263/2263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 1443 transition count 2007
Reduce places removed 262 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 267 rules applied. Total rules applied 522 place count 1181 transition count 2002
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 11 rules applied. Total rules applied 533 place count 1176 transition count 1996
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 539 place count 1170 transition count 1996
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 207 Pre rules applied. Total rules applied 539 place count 1170 transition count 1789
Deduced a syphon composed of 207 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 4 with 475 rules applied. Total rules applied 1014 place count 902 transition count 1789
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 33 rules applied. Total rules applied 1047 place count 884 transition count 1774
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1062 place count 869 transition count 1774
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1062 place count 869 transition count 1745
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1120 place count 840 transition count 1745
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1134 place count 826 transition count 1719
Iterating global reduction 6 with 14 rules applied. Total rules applied 1148 place count 826 transition count 1719
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 9 rules applied. Total rules applied 1157 place count 825 transition count 1711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1158 place count 824 transition count 1711
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1158 place count 824 transition count 1710
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1160 place count 823 transition count 1710
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1164 place count 819 transition count 1699
Iterating global reduction 8 with 4 rules applied. Total rules applied 1168 place count 819 transition count 1699
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1172 place count 815 transition count 1688
Iterating global reduction 8 with 4 rules applied. Total rules applied 1176 place count 815 transition count 1688
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1179 place count 815 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1180 place count 814 transition count 1677
Iterating global reduction 9 with 1 rules applied. Total rules applied 1181 place count 814 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1182 place count 813 transition count 1669
Iterating global reduction 9 with 1 rules applied. Total rules applied 1183 place count 813 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1184 place count 812 transition count 1661
Iterating global reduction 9 with 1 rules applied. Total rules applied 1185 place count 812 transition count 1661
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1186 place count 811 transition count 1653
Iterating global reduction 9 with 1 rules applied. Total rules applied 1187 place count 811 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1188 place count 810 transition count 1645
Iterating global reduction 9 with 1 rules applied. Total rules applied 1189 place count 810 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1190 place count 809 transition count 1637
Iterating global reduction 9 with 1 rules applied. Total rules applied 1191 place count 809 transition count 1637
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1192 place count 808 transition count 1629
Iterating global reduction 9 with 1 rules applied. Total rules applied 1193 place count 808 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1194 place count 807 transition count 1621
Iterating global reduction 9 with 1 rules applied. Total rules applied 1195 place count 807 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1196 place count 806 transition count 1613
Iterating global reduction 9 with 1 rules applied. Total rules applied 1197 place count 806 transition count 1613
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1198 place count 805 transition count 1605
Iterating global reduction 9 with 1 rules applied. Total rules applied 1199 place count 805 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1200 place count 804 transition count 1597
Iterating global reduction 9 with 1 rules applied. Total rules applied 1201 place count 804 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1202 place count 803 transition count 1589
Iterating global reduction 9 with 1 rules applied. Total rules applied 1203 place count 803 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1204 place count 802 transition count 1581
Iterating global reduction 9 with 1 rules applied. Total rules applied 1205 place count 802 transition count 1581
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 9 with 148 rules applied. Total rules applied 1353 place count 728 transition count 1507
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1354 place count 727 transition count 1506
Iterating global reduction 9 with 1 rules applied. Total rules applied 1355 place count 727 transition count 1506
Applied a total of 1355 rules in 425 ms. Remains 727 /1444 variables (removed 717) and now considering 1506/2263 (removed 757) transitions.
// Phase 1: matrix 1506 rows 727 cols
[2025-05-30 09:00:05] [INFO ] Computed 109 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:00:05] [INFO ] Implicit Places using invariants in 501 ms returned [21, 74, 95, 101, 106, 108, 166, 183, 189, 194, 196, 256, 273, 279, 284, 286, 312, 347, 368, 376, 382, 384, 444, 461, 467, 472, 474, 534, 551, 557, 562, 564, 624, 641, 647, 652, 654, 666, 723]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 502 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 688/1444 places, 1506/2263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 688 transition count 1492
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 674 transition count 1492
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 42 place count 660 transition count 1478
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 660 transition count 1478
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 70 place count 646 transition count 1464
Iterating global reduction 2 with 14 rules applied. Total rules applied 84 place count 646 transition count 1464
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 639 transition count 1457
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 639 transition count 1457
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 136 place count 620 transition count 1438
Applied a total of 136 rules in 86 ms. Remains 620 /688 variables (removed 68) and now considering 1438/1506 (removed 68) transitions.
// Phase 1: matrix 1438 rows 620 cols
[2025-05-30 09:00:06] [INFO ] Computed 70 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:00:06] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-05-30 09:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:00:07] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 620/1444 places, 1438/2263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2572 ms. Remains : 620/1444 places, 1438/2263 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLFireability-13
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLFireability-13 finished in 2646 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((p0||X(X(X(p1))))))'
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(!p0)&&F(G((!p0||X(p0)))))))'
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((p0&&F(p1))))'
[2025-05-30 09:00:08] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7029170878493414725
[2025-05-30 09:00:08] [INFO ] Too many transitions (2263) to apply POR reductions. Disabling POR matrices.
[2025-05-30 09:00:08] [INFO ] Applying decomposition
[2025-05-30 09:00:08] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7029170878493414725
Running compilation step : cd /tmp/ltsmin7029170878493414725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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 09:00:08] [INFO ] Flatten gal took : 53 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/graph532533505623001052.txt' '-o' '/tmp/graph532533505623001052.bin' '-w' '/tmp/graph532533505623001052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph532533505623001052.bin' '-l' '-1' '-v' '-w' '/tmp/graph532533505623001052.weights' '-q' '0' '-e' '0.001'
[2025-05-30 09:00:08] [INFO ] Decomposing Gal with order
[2025-05-30 09:00:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 09:00:08] [INFO ] Removed a total of 3216 redundant transitions.
[2025-05-30 09:00:08] [INFO ] Flatten gal took : 162 ms
[2025-05-30 09:00:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 57 ms.
[2025-05-30 09:00:08] [INFO ] Time to serialize gal into /tmp/LTLFireability16937186525276436231.gal : 31 ms
[2025-05-30 09:00:08] [INFO ] Time to serialize properties into /tmp/LTLFireability4271909412851159762.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/LTLFireability16937186525276436231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4271909412851159762.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 3 LTL properties
Checking formula 0 : !((G(("((i9.i6.u239.p877==1)&&(i9.i0.u237.p882==1))")||(X(X(X("(((i9.i6.u239.p877==0)||(i9.i0.u237.p882==0))||(((i13.u283.p1025==1)&&(...230
Formula 0 simplified : F(!"((i9.i6.u239.p877==1)&&(i9.i0.u237.p882==1))" & XXX!"(((i9.i6.u239.p877==0)||(i9.i0.u237.p882==0))||(((i13.u283.p1025==1)&&(i13....220
Compilation finished in 4772 ms.
Running link step : cd /tmp/ltsmin7029170878493414725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin7029170878493414725;'/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' '[](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7029170878493414725;'/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' '[](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7029170878493414725;'/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' '[]((<>(!(LTLAPp2==true))&&<>([]((!(LTLAPp2==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7029170878493414725;'/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' '[]((<>(!(LTLAPp2==true))&&<>([]((!(LTLAPp2==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7029170878493414725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp3==true)&&<>((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7029170878493414725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp3==true)&&<>((LTLAPp4==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin7029170878493414725;'/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' '[](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 09:26:15] [INFO ] Applying decomposition
[2025-05-30 09:26:15] [INFO ] Flatten gal took : 176 ms
[2025-05-30 09:26:15] [INFO ] Decomposing Gal with order
[2025-05-30 09:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 09:26:15] [INFO ] Removed a total of 2629 redundant transitions.
[2025-05-30 09:26:16] [INFO ] Flatten gal took : 259 ms
[2025-05-30 09:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 929 labels/synchronizations in 135 ms.
[2025-05-30 09:26:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3627226182613537897.gal : 11 ms
[2025-05-30 09:26:16] [INFO ] Time to serialize properties into /tmp/LTLFireability17778567084224309306.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/LTLFireability3627226182613537897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17778567084224309306.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 3 LTL properties
Checking formula 0 : !((G(("((i37.u148.p877==1)&&(i37.i1.u331.p882==1))")||(X(X(X("(((i37.u148.p877==0)||(i37.i1.u331.p882==0))||(((u179.p1025==1)&&(u216.p...219
Formula 0 simplified : F(!"((i37.u148.p877==1)&&(i37.i1.u331.p882==1))" & XXX!"(((i37.u148.p877==0)||(i37.i1.u331.p882==0))||(((u179.p1025==1)&&(u216.p1244...209

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-07a"
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-07a, 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-174853729200380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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