Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1020K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 597K 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-06a-LTLCardinality-00
FORMULA_NAME ASLink-PT-06a-LTLCardinality-01
FORMULA_NAME ASLink-PT-06a-LTLCardinality-02
FORMULA_NAME ASLink-PT-06a-LTLCardinality-03
FORMULA_NAME ASLink-PT-06a-LTLCardinality-04
FORMULA_NAME ASLink-PT-06a-LTLCardinality-05
FORMULA_NAME ASLink-PT-06a-LTLCardinality-06
FORMULA_NAME ASLink-PT-06a-LTLCardinality-07
FORMULA_NAME ASLink-PT-06a-LTLCardinality-08
FORMULA_NAME ASLink-PT-06a-LTLCardinality-09
FORMULA_NAME ASLink-PT-06a-LTLCardinality-10
FORMULA_NAME ASLink-PT-06a-LTLCardinality-11
FORMULA_NAME ASLink-PT-06a-LTLCardinality-12
FORMULA_NAME ASLink-PT-06a-LTLCardinality-13
FORMULA_NAME ASLink-PT-06a-LTLCardinality-14
FORMULA_NAME ASLink-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748587284766

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 06:41:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 06:41:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:41:26] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-05-30 06:41:26] [INFO ] Transformed 1406 places.
[2025-05-30 06:41:26] [INFO ] Transformed 2100 transitions.
[2025-05-30 06:41:26] [INFO ] Found NUPN structural information;
[2025-05-30 06:41:26] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-06a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-06a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1370 transition count 2078
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 1359 transition count 2029
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 1358 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 1358 transition count 2027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1357 transition count 2019
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1357 transition count 2019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1356 transition count 2011
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1356 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1355 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1355 transition count 2003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1354 transition count 1995
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1354 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1353 transition count 1987
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1353 transition count 1987
Applied a total of 71 rules in 629 ms. Remains 1353 /1406 variables (removed 53) and now considering 1987/2078 (removed 91) transitions.
// Phase 1: matrix 1987 rows 1353 cols
[2025-05-30 06:41:27] [INFO ] Computed 233 invariants in 160 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:28] [INFO ] Implicit Places using invariants in 1456 ms returned [1, 19, 20, 23, 33, 51, 69, 199, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 779, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1143, 1155, 1160, 1161, 1162, 1191, 1193, 1196, 1214, 1215, 1216, 1217, 1234, 1242, 1250, 1256, 1262, 1268, 1274, 1282, 1288, 1294, 1302]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1495 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1287/1406 places, 1987/2078 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1274 transition count 1974
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1274 transition count 1974
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1264 transition count 1964
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1264 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1259 transition count 1959
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1259 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1257 transition count 1957
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1257 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1255 transition count 1955
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1255 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1254 transition count 1954
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1254 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1253 transition count 1953
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1253 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1252 transition count 1952
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1252 transition count 1952
Applied a total of 70 rules in 353 ms. Remains 1252 /1287 variables (removed 35) and now considering 1952/1987 (removed 35) transitions.
// Phase 1: matrix 1952 rows 1252 cols
[2025-05-30 06:41:28] [INFO ] Computed 167 invariants in 64 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:29] [INFO ] Implicit Places using invariants in 836 ms returned []
[2025-05-30 06:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:31] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 2990 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1252/1406 places, 1952/2078 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5482 ms. Remains : 1252/1406 places, 1952/2078 transitions.
Support contains 29 out of 1252 places after structural reductions.
[2025-05-30 06:41:33] [INFO ] Flatten gal took : 179 ms
[2025-05-30 06:41:33] [INFO ] Flatten gal took : 111 ms
[2025-05-30 06:41:34] [INFO ] Input system was already deterministic with 1952 transitions.
RANDOM walk for 40000 steps (225 resets) in 1129 ms. (35 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40004 steps (29 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (26 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (29 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (28 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
[2025-05-30 06:41:34] [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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 290/308 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 220/528 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 716/1244 variables, 128/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 8/1252 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1252 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1952/3204 variables, 1252/1419 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3204 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/3204 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3204/3204 variables, and 1419 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1252/1252 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SMT process timed out in 8232ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 1252 transition count 1721
Reduce places removed 231 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 237 rules applied. Total rules applied 468 place count 1021 transition count 1715
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 474 place count 1015 transition count 1715
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 162 Pre rules applied. Total rules applied 474 place count 1015 transition count 1553
Deduced a syphon composed of 162 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 377 rules applied. Total rules applied 851 place count 800 transition count 1553
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 869 place count 791 transition count 1544
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 878 place count 782 transition count 1544
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 878 place count 782 transition count 1520
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 926 place count 758 transition count 1520
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 932 place count 752 transition count 1507
Iterating global reduction 5 with 6 rules applied. Total rules applied 938 place count 752 transition count 1507
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 942 place count 752 transition count 1503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 943 place count 751 transition count 1503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 943 place count 751 transition count 1502
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 945 place count 750 transition count 1502
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 946 place count 749 transition count 1494
Iterating global reduction 7 with 1 rules applied. Total rules applied 947 place count 749 transition count 1494
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 948 place count 748 transition count 1486
Iterating global reduction 7 with 1 rules applied. Total rules applied 949 place count 748 transition count 1486
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 950 place count 747 transition count 1478
Iterating global reduction 7 with 1 rules applied. Total rules applied 951 place count 747 transition count 1478
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 952 place count 746 transition count 1470
Iterating global reduction 7 with 1 rules applied. Total rules applied 953 place count 746 transition count 1470
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 954 place count 745 transition count 1462
Iterating global reduction 7 with 1 rules applied. Total rules applied 955 place count 745 transition count 1462
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 956 place count 744 transition count 1454
Iterating global reduction 7 with 1 rules applied. Total rules applied 957 place count 744 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 958 place count 743 transition count 1446
Iterating global reduction 7 with 1 rules applied. Total rules applied 959 place count 743 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 960 place count 742 transition count 1438
Iterating global reduction 7 with 1 rules applied. Total rules applied 961 place count 742 transition count 1438
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 962 place count 741 transition count 1430
Iterating global reduction 7 with 1 rules applied. Total rules applied 963 place count 741 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 964 place count 740 transition count 1422
Iterating global reduction 7 with 1 rules applied. Total rules applied 965 place count 740 transition count 1422
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 7 with 124 rules applied. Total rules applied 1089 place count 678 transition count 1360
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 1094 place count 678 transition count 1355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1099 place count 673 transition count 1355
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1123 place count 673 transition count 1331
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1147 place count 649 transition count 1331
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1150 place count 649 transition count 1328
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 1169 place count 649 transition count 1328
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1173 place count 649 transition count 1328
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1174 place count 649 transition count 1327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1175 place count 648 transition count 1326
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1181 place count 642 transition count 1326
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1181 place count 642 transition count 1314
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 29 rules applied. Total rules applied 1210 place count 625 transition count 1314
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1215 place count 620 transition count 1309
Iterating global reduction 10 with 5 rules applied. Total rules applied 1220 place count 620 transition count 1309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1225 place count 620 transition count 1304
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1227 place count 620 transition count 1302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1229 place count 618 transition count 1302
Applied a total of 1229 rules in 678 ms. Remains 618 /1252 variables (removed 634) and now considering 1302/1952 (removed 650) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 618/1252 places, 1302/1952 transitions.
RANDOM walk for 40000 steps (576 resets) in 377 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (110 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (114 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (116 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (111 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (119 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (102 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (121 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (110 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 336586 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :6 out of 8
Probabilistic random walk after 336586 steps, saw 244458 distinct states, run finished after 3005 ms. (steps per millisecond=112 ) properties seen :6
// Phase 1: matrix 1302 rows 618 cols
[2025-05-30 06:41:47] [INFO ] Computed 94 invariants in 11 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/135 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/169 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 233/402 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/432 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/433 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 155/588 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/589 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/589 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 29/618 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/618 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1302/1920 variables, 618/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1920 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1920 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1920/1920 variables, and 712 constraints, problems are : Problem set: 0 solved, 2 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 618/618 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) 16/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/135 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/169 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 233/402 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/432 variables, 6/66 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 06:41:48] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/433 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 155/588 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/589 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/589 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 29/618 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/618 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1302/1920 variables, 618/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1920 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1920 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1920 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1920/1920 variables, and 715 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 618/618 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 643 ms.
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1302/1302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1298
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 614 transition count 1297
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 614 transition count 1294
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 610 transition count 1294
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 609 transition count 1294
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 28 place count 603 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 602 transition count 1288
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 602 transition count 1288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 602 transition count 1287
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 602 transition count 1286
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 34 place count 601 transition count 1285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 601 transition count 1284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 36 place count 600 transition count 1284
Applied a total of 36 rules in 110 ms. Remains 600 /618 variables (removed 18) and now considering 1284/1302 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 600/618 places, 1284/1302 transitions.
RANDOM walk for 40000 steps (658 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (135 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (130 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 336732 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :1 out of 2
Probabilistic random walk after 336732 steps, saw 141060 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :1
// Phase 1: matrix 1284 rows 600 cols
[2025-05-30 06:41:53] [INFO ] Computed 91 invariants in 16 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 154/186 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/191 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/371 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/409 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/546 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/554 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/555 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 45/600 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/600 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1284/1884 variables, 600/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1884 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1884 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1884/1884 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 154/186 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/191 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/371 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/409 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/546 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/554 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/555 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 45/600 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/600 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1284/1884 variables, 600/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1884 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1884 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1884 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1884/1884 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1284/1284 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 600 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 599 transition count 1283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 599 transition count 1282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 598 transition count 1282
Applied a total of 4 rules in 32 ms. Remains 598 /600 variables (removed 2) and now considering 1282/1284 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 598/600 places, 1282/1284 transitions.
RANDOM walk for 40000 steps (630 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (124 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360569 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360569 steps, saw 150907 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1282 rows 598 cols
[2025-05-30 06:41:57] [INFO ] Computed 91 invariants in 17 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/182 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/188 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 182/370 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/394 variables, 6/57 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 06:41:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 150/544 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/552 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/553 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 45/598 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1282/1880 variables, 598/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1880 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1880 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1880/1880 variables, and 690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 598/598 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/182 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/188 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 182/370 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/394 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 150/544 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/552 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/553 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 45/598 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1282/1880 variables, 598/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1880 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1880 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1880 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1880/1880 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 598/598 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 219 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 6 ms.
FORMULA ASLink-PT-06a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
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(X(X((!G(!X(p0)) U p1)))))'
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1251 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1251 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1250 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1250 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1249 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1249 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1248 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1248 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1247 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1247 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1246 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1246 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1245 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1245 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1244 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1244 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1243 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1243 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1242 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1242 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1241 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1241 transition count 1864
Applied a total of 22 rules in 352 ms. Remains 1241 /1252 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2025-05-30 06:41:59] [INFO ] Computed 167 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:42:00] [INFO ] Implicit Places using invariants in 769 ms returned []
[2025-05-30 06:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:42:02] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 16.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 9.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 11.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 5.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 4.0)
(s201 3.0)
(s202 1.0)
(s203 2.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 11.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 11.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 7.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 8.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 12.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 2.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 16.0)
(s369 1.0)
(s370 16.0)
(s371 1.0)
(s372 3.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 3.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 2.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 11.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 9.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 3.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60702ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60714ms
Starting structural reductions in LTL mode, iteration 1 : 1241/1252 places, 1864/1952 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64262 ms. Remains : 1241/1252 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-04
Product exploration explored 100000 steps with 691 reset in 358 ms.
Product exploration explored 100000 steps with 700 reset in 354 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 4089 steps (19 resets) in 34 ms. (116 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 35 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
[2025-05-30 06:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:43:06] [INFO ] Implicit Places using invariants in 769 ms returned []
[2025-05-30 06:43:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:43:08] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 3205 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 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 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in LTL mode , in 1 iterations and 63813 ms. Remains : 1241/1241 places, 1864/1864 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 2355 steps (16 resets) in 27 ms. (84 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 660 reset in 240 ms.
Product exploration explored 100000 steps with 630 reset in 253 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1241 transition count 1864
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 242 place count 1241 transition count 1893
Deduced a syphon composed of 330 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 330 place count 1241 transition count 1893
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 336 place count 1238 transition count 1893
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 370 place count 1204 transition count 1859
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 404 place count 1204 transition count 1859
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 404 place count 1204 transition count 1859
Deduced a syphon composed of 302 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 1204 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 1203 transition count 1858
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 1203 transition count 1858
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 457 places in 2 ms
Iterating global reduction 2 with 156 rules applied. Total rules applied 563 place count 1203 transition count 1878
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 644 place count 1122 transition count 1797
Deduced a syphon composed of 376 places in 2 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 725 place count 1122 transition count 1797
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 383 places in 2 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 732 place count 1122 transition count 1837
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 384 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 733 place count 1122 transition count 1841
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 735 place count 1120 transition count 1835
Deduced a syphon composed of 382 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 737 place count 1120 transition count 1835
Deduced a syphon composed of 382 places in 2 ms
Applied a total of 737 rules in 543 ms. Remains 1120 /1241 variables (removed 121) and now considering 1835/1864 (removed 29) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:44:12] [INFO ] Redundant transitions in 148 ms returned []
Running 1834 sub problems to find dead transitions.
// Phase 1: matrix 1835 rows 1120 cols
[2025-05-30 06:44:12] [INFO ] Computed 164 invariants in 19 ms
[2025-05-30 06:44:12] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1119 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 1834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1119/2955 variables, and 116 constraints, problems are : Problem set: 0 solved, 1834 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/41 constraints, Generalized P Invariants (flows): 116/123 constraints, State Equation: 0/1120 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 1834/1834 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1834 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1119 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 1834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1119/2955 variables, and 116 constraints, problems are : Problem set: 0 solved, 1834 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/41 constraints, Generalized P Invariants (flows): 116/123 constraints, State Equation: 0/1120 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 0/1834 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 1834 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1120/1241 places, 1835/1864 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61347 ms. Remains : 1120/1241 places, 1835/1864 transitions.
Built C files in :
/tmp/ltsmin10368522894874746745
[2025-05-30 06:45:12] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10368522894874746745
Running compilation step : cd /tmp/ltsmin10368522894874746745;'/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/ltsmin10368522894874746745;'/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/ltsmin10368522894874746745;'/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 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 40 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2025-05-30 06:45:15] [INFO ] Computed 167 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:45:16] [INFO ] Implicit Places using invariants in 758 ms returned []
[2025-05-30 06:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:45:18] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 2983 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Finished structural reductions in LTL mode , in 1 iterations and 63592 ms. Remains : 1241/1241 places, 1864/1864 transitions.
Built C files in :
/tmp/ltsmin15004852721207964053
[2025-05-30 06:46:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15004852721207964053
Running compilation step : cd /tmp/ltsmin15004852721207964053;'/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/ltsmin15004852721207964053;'/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/ltsmin15004852721207964053;'/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 06:46:22] [INFO ] Flatten gal took : 73 ms
[2025-05-30 06:46:22] [INFO ] Flatten gal took : 68 ms
[2025-05-30 06:46:22] [INFO ] Time to serialize gal into /tmp/LTL15169207840443040817.gal : 20 ms
[2025-05-30 06:46:22] [INFO ] Time to serialize properties into /tmp/LTL10270136287810467830.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/LTL15169207840443040817.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11129200726108958209.hoa' '-atoms' '/tmp/LTL10270136287810467830.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...320
Loading property file /tmp/LTL10270136287810467830.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11129200726108958209.hoa
Detected timeout of ITS tools.
[2025-05-30 06:46:37] [INFO ] Flatten gal took : 58 ms
[2025-05-30 06:46:37] [INFO ] Flatten gal took : 57 ms
[2025-05-30 06:46:37] [INFO ] Time to serialize gal into /tmp/LTL6587272755395869615.gal : 10 ms
[2025-05-30 06:46:37] [INFO ] Time to serialize properties into /tmp/LTL13765896232847191342.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/LTL6587272755395869615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13765896232847191342.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(X(X((!(G(!(X("((p1149==0)||(p791==1))")))))U("((p773==0)||(p38==1))"))))))
Formula 0 simplified : XXF(!"((p773==0)||(p38==1))" & X(!"((p773==0)||(p38==1))" W G!"((p1149==0)||(p791==1))"))
Detected timeout of ITS tools.
[2025-05-30 06:46:53] [INFO ] Flatten gal took : 54 ms
[2025-05-30 06:46:53] [INFO ] Applying decomposition
[2025-05-30 06:46:53] [INFO ] Flatten gal took : 54 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/graph3908865609452923090.txt' '-o' '/tmp/graph3908865609452923090.bin' '-w' '/tmp/graph3908865609452923090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3908865609452923090.bin' '-l' '-1' '-v' '-w' '/tmp/graph3908865609452923090.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:46:53] [INFO ] Decomposing Gal with order
[2025-05-30 06:46:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:46:53] [INFO ] Removed a total of 2530 redundant transitions.
[2025-05-30 06:46:53] [INFO ] Flatten gal took : 175 ms
[2025-05-30 06:46:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 49 ms.
[2025-05-30 06:46:53] [INFO ] Time to serialize gal into /tmp/LTL18440827120751132147.gal : 22 ms
[2025-05-30 06:46:53] [INFO ] Time to serialize properties into /tmp/LTL10330687115245396448.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/LTL18440827120751132147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10330687115245396448.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(X(X((!(G(!(X("((i15.u328.p1149==0)||(i9.u230.p791==1))")))))U("((i9.u225.p773==0)||(i2.u12.p38==1))"))))))
Formula 0 simplified : XXF(!"((i9.u225.p773==0)||(i2.u12.p38==1))" & X(!"((i9.u225.p773==0)||(i2.u12.p38==1))" W G!"((i15.u328.p1149==0)||(i9.u230.p791==1)...159
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLCardinality-04 finished in 309649 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(G(p0)))'
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1251 transition count 1712
Reduce places removed 245 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 251 rules applied. Total rules applied 490 place count 1006 transition count 1706
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 499 place count 1000 transition count 1703
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 502 place count 997 transition count 1703
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 502 place count 997 transition count 1529
Deduced a syphon composed of 174 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 4 with 401 rules applied. Total rules applied 903 place count 770 transition count 1529
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 37 rules applied. Total rules applied 940 place count 754 transition count 1508
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 961 place count 733 transition count 1508
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 961 place count 733 transition count 1483
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1011 place count 708 transition count 1483
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1023 place count 696 transition count 1464
Iterating global reduction 6 with 12 rules applied. Total rules applied 1035 place count 696 transition count 1464
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 10 rules applied. Total rules applied 1045 place count 696 transition count 1454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1046 place count 695 transition count 1454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1046 place count 695 transition count 1453
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 1048 place count 694 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1049 place count 693 transition count 1445
Iterating global reduction 8 with 1 rules applied. Total rules applied 1050 place count 693 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1051 place count 692 transition count 1437
Iterating global reduction 8 with 1 rules applied. Total rules applied 1052 place count 692 transition count 1437
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1053 place count 691 transition count 1429
Iterating global reduction 8 with 1 rules applied. Total rules applied 1054 place count 691 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1055 place count 690 transition count 1421
Iterating global reduction 8 with 1 rules applied. Total rules applied 1056 place count 690 transition count 1421
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1057 place count 689 transition count 1413
Iterating global reduction 8 with 1 rules applied. Total rules applied 1058 place count 689 transition count 1413
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1059 place count 688 transition count 1405
Iterating global reduction 8 with 1 rules applied. Total rules applied 1060 place count 688 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1061 place count 687 transition count 1397
Iterating global reduction 8 with 1 rules applied. Total rules applied 1062 place count 687 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1063 place count 686 transition count 1389
Iterating global reduction 8 with 1 rules applied. Total rules applied 1064 place count 686 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1065 place count 685 transition count 1381
Iterating global reduction 8 with 1 rules applied. Total rules applied 1066 place count 685 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1067 place count 684 transition count 1373
Iterating global reduction 8 with 1 rules applied. Total rules applied 1068 place count 684 transition count 1373
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 8 with 122 rules applied. Total rules applied 1190 place count 623 transition count 1312
Applied a total of 1190 rules in 272 ms. Remains 623 /1252 variables (removed 629) and now considering 1312/1952 (removed 640) transitions.
// Phase 1: matrix 1312 rows 623 cols
[2025-05-30 06:47:09] [INFO ] Computed 92 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:09] [INFO ] Implicit Places using invariants in 433 ms returned [72, 89, 95, 101, 160, 177, 183, 188, 190, 250, 268, 274, 279, 281, 341, 358, 364, 369, 371, 431, 448, 454, 459, 461, 521, 538, 544, 549, 555]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 435 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 594/1252 places, 1312/1952 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 582 transition count 1300
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 582 transition count 1300
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 570 transition count 1288
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 570 transition count 1288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 564 transition count 1282
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 564 transition count 1282
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 84 place count 552 transition count 1270
Applied a total of 84 rules in 72 ms. Remains 552 /594 variables (removed 42) and now considering 1270/1312 (removed 42) transitions.
// Phase 1: matrix 1270 rows 552 cols
[2025-05-30 06:47:09] [INFO ] Computed 63 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:10] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-05-30 06:47:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:11] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/1252 places, 1270/1952 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2220 ms. Remains : 552/1252 places, 1270/1952 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-05
Product exploration explored 100000 steps with 1379 reset in 184 ms.
Product exploration explored 100000 steps with 1355 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (532 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (101 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290873 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290873 steps, saw 123101 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-05-30 06:47:14] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/286 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/549 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/552 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1270/1822 variables, 552/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1822 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1822 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 552/552 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/286 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/549 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/552 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1270/1822 variables, 552/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1822 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1822/1822 variables, and 616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1270/1270 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 552 transition count 1247
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 51 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 69 place count 529 transition count 1224
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 87 place count 511 transition count 1224
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 88 place count 511 transition count 1224
Applied a total of 88 rules in 75 ms. Remains 511 /552 variables (removed 41) and now considering 1224/1270 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 511/552 places, 1224/1270 transitions.
RANDOM walk for 40000 steps (634 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 361877 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361877 steps, saw 188415 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1224 rows 511 cols
[2025-05-30 06:47:19] [INFO ] Computed 63 invariants in 16 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/251 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/508 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/511 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1224/1735 variables, 511/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1735 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1735/1735 variables, and 574 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 511/511 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/251 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/508 variables, 39/61 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 06:47:20] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 40 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/511 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1224/1735 variables, 511/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1735 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1735/1735 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1407ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 180 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1224/1224 transitions.
Applied a total of 0 rules in 17 ms. Remains 511 /511 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 511/511 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1224/1224 transitions.
Applied a total of 0 rules in 16 ms. Remains 511 /511 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-05-30 06:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:21] [INFO ] Implicit Places using invariants in 362 ms returned [89, 90, 160, 161, 232, 233, 303, 304, 374, 375, 510]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 372 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/511 places, 1224/1224 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 404 ms. Remains : 500/511 places, 1224/1224 transitions.
RANDOM walk for 40000 steps (680 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (134 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370443 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370443 steps, saw 193139 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 1224 rows 500 cols
[2025-05-30 06:47:24] [INFO ] Computed 52 invariants in 19 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 256/296 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/339 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 161/500 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1224/1724 variables, 500/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1724 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1724 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 500/500 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 256/296 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/339 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 161/500 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1224/1724 variables, 500/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1724 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1724 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1724 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 970ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1224/1224 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 500/500 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1224/1224 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-05-30 06:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:25] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-05-30 06:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:26] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:47:26] [INFO ] Redundant transitions in 22 ms returned []
Running 1193 sub problems to find dead transitions.
[2025-05-30 06:47:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/1724 variables, and 46 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 38/41 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/1724 variables, and 52 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61645 ms. Remains : 500/500 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 06:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 06:48:27] [INFO ] After 69ms 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 06:48:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-30 06:48:27] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 14 ms returned sat
[2025-05-30 06:48:27] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 06:48:27] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 06:48:27] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 690 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1270/1270 transitions.
Applied a total of 0 rules in 23 ms. Remains 552 /552 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
// Phase 1: matrix 1270 rows 552 cols
[2025-05-30 06:48:27] [INFO ] Computed 63 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:48:28] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-05-30 06:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:48:29] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:48:29] [INFO ] Redundant transitions in 19 ms returned []
Running 1234 sub problems to find dead transitions.
[2025-05-30 06:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1234 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 551/1822 variables, and 57 constraints, problems are : Problem set: 0 solved, 1234 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 49/52 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1234/1234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 3 (OVERLAPS) 1/552 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1822 variables, and 63 constraints, problems are : Problem set: 0 solved, 1234 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 1234 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61884 ms. Remains : 552/552 places, 1270/1270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (537 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (108 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290934 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290934 steps, saw 123129 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-05-30 06:49:32] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/286 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/549 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/552 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1270/1822 variables, 552/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1822 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1822 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 552/552 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/286 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/549 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/552 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1270/1822 variables, 552/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1822 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1822/1822 variables, and 616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1018ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 172 ms.
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1270/1270 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 552 transition count 1247
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 51 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 69 place count 529 transition count 1224
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 87 place count 511 transition count 1224
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 88 place count 511 transition count 1224
Applied a total of 88 rules in 70 ms. Remains 511 /552 variables (removed 41) and now considering 1224/1270 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 511/552 places, 1224/1270 transitions.
RANDOM walk for 40000 steps (677 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (132 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 364766 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 364766 steps, saw 189864 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
// Phase 1: matrix 1224 rows 511 cols
[2025-05-30 06:49:37] [INFO ] Computed 63 invariants in 16 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/251 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/508 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/511 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1224/1735 variables, 511/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1735 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1735/1735 variables, and 574 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 511/511 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/251 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/508 variables, 39/61 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 06:49:37] [INFO ] Deduced a trap composed of 76 places in 224 ms of which 41 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/511 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1224/1735 variables, 511/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1735 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1735/1735 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1368ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 169 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1224/1224 transitions.
Applied a total of 0 rules in 15 ms. Remains 511 /511 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 511/511 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1224/1224 transitions.
Applied a total of 0 rules in 15 ms. Remains 511 /511 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-05-30 06:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:49:39] [INFO ] Implicit Places using invariants in 357 ms returned [89, 90, 160, 161, 232, 233, 303, 304, 374, 375, 510]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 362 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/511 places, 1224/1224 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 392 ms. Remains : 500/511 places, 1224/1224 transitions.
RANDOM walk for 40000 steps (642 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (135 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372275 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372275 steps, saw 194299 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 1224 rows 500 cols
[2025-05-30 06:49:42] [INFO ] Computed 52 invariants in 17 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 256/296 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/339 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 161/500 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1224/1724 variables, 500/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1724 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1724 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 500/500 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 256/296 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/339 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 161/500 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1224/1724 variables, 500/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1724 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1724 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1724 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1224/1224 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 500/500 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1224/1224 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-05-30 06:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:49:43] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-05-30 06:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:49:44] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:49:44] [INFO ] Redundant transitions in 18 ms returned []
Running 1193 sub problems to find dead transitions.
[2025-05-30 06:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1193 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 499/1724 variables, and 46 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 38/41 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/1724 variables, and 52 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61598 ms. Remains : 500/500 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 06:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 06:50:45] [INFO ] After 63ms 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 06:50:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-30 06:50:45] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 19 ms returned sat
[2025-05-30 06:50:45] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 06:50:45] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 06:50:45] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 678 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1378 reset in 234 ms.
Product exploration explored 100000 steps with 1384 reset in 253 ms.
Built C files in :
/tmp/ltsmin9688574494024847712
[2025-05-30 06:50:46] [INFO ] Computing symmetric may disable matrix : 1270 transitions.
[2025-05-30 06:50:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:50:46] [INFO ] Computing symmetric may enable matrix : 1270 transitions.
[2025-05-30 06:50:46] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:50:46] [INFO ] Computing Do-Not-Accords matrix : 1270 transitions.
[2025-05-30 06:50:46] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:50:46] [INFO ] Built C files in 327ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9688574494024847712
Running compilation step : cd /tmp/ltsmin9688574494024847712;'/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/ltsmin9688574494024847712;'/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/ltsmin9688574494024847712;'/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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1270/1270 transitions.
Applied a total of 0 rules in 17 ms. Remains 552 /552 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
// Phase 1: matrix 1270 rows 552 cols
[2025-05-30 06:50:49] [INFO ] Computed 63 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:50:50] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-05-30 06:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:50:51] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:50:51] [INFO ] Redundant transitions in 22 ms returned []
Running 1234 sub problems to find dead transitions.
[2025-05-30 06:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1822 variables, and 57 constraints, problems are : Problem set: 0 solved, 1234 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 49/52 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1234/1234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
SMT process timed out in 60346ms, After SMT, problems are : Problem set: 0 solved, 1234 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61831 ms. Remains : 552/552 places, 1270/1270 transitions.
Built C files in :
/tmp/ltsmin3333391909714037357
[2025-05-30 06:51:51] [INFO ] Computing symmetric may disable matrix : 1270 transitions.
[2025-05-30 06:51:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:51:51] [INFO ] Computing symmetric may enable matrix : 1270 transitions.
[2025-05-30 06:51:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:51:51] [INFO ] Computing Do-Not-Accords matrix : 1270 transitions.
[2025-05-30 06:51:51] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:51:51] [INFO ] Built C files in 326ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3333391909714037357
Running compilation step : cd /tmp/ltsmin3333391909714037357;'/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/ltsmin3333391909714037357;'/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/ltsmin3333391909714037357;'/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 06:51:54] [INFO ] Flatten gal took : 42 ms
[2025-05-30 06:51:55] [INFO ] Flatten gal took : 40 ms
[2025-05-30 06:51:55] [INFO ] Time to serialize gal into /tmp/LTL6981370108611063811.gal : 7 ms
[2025-05-30 06:51:55] [INFO ] Time to serialize properties into /tmp/LTL1410319194377503093.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/LTL6981370108611063811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5775523290020983712.hoa' '-atoms' '/tmp/LTL1410319194377503093.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/LTL1410319194377503093.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5775523290020983712.hoa
Detected timeout of ITS tools.
[2025-05-30 06:52:10] [INFO ] Flatten gal took : 36 ms
[2025-05-30 06:52:10] [INFO ] Flatten gal took : 37 ms
[2025-05-30 06:52:10] [INFO ] Time to serialize gal into /tmp/LTL11382058718261005748.gal : 6 ms
[2025-05-30 06:52:10] [INFO ] Time to serialize properties into /tmp/LTL3691765696251273462.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/LTL11382058718261005748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3691765696251273462.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 : !((F(G("(((p492==0)||(p1166==1))||((p1389!=0)&&(p175!=1)))"))))
Formula 0 simplified : GF!"(((p492==0)||(p1166==1))||((p1389!=0)&&(p175!=1)))"
Detected timeout of ITS tools.
[2025-05-30 06:52:25] [INFO ] Flatten gal took : 39 ms
[2025-05-30 06:52:25] [INFO ] Applying decomposition
[2025-05-30 06:52:25] [INFO ] Flatten gal took : 32 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/graph12238297855735319885.txt' '-o' '/tmp/graph12238297855735319885.bin' '-w' '/tmp/graph12238297855735319885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12238297855735319885.bin' '-l' '-1' '-v' '-w' '/tmp/graph12238297855735319885.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:52:25] [INFO ] Decomposing Gal with order
[2025-05-30 06:52:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:52:25] [INFO ] Removed a total of 2540 redundant transitions.
[2025-05-30 06:52:25] [INFO ] Flatten gal took : 66 ms
[2025-05-30 06:52:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 18 ms.
[2025-05-30 06:52:25] [INFO ] Time to serialize gal into /tmp/LTL17477061698836696767.gal : 7 ms
[2025-05-30 06:52:25] [INFO ] Time to serialize properties into /tmp/LTL12173372935199706131.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/LTL17477061698836696767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12173372935199706131.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 : !((F(G("(((i5.u64.p492==0)||(i11.u120.p1166==1))||((i11.u141.p1389!=0)&&(i2.u26.p175!=1)))"))))
Formula 0 simplified : GF!"(((i5.u64.p492==0)||(i11.u120.p1166==1))||((i11.u141.p1389!=0)&&(i2.u26.p175!=1)))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLCardinality-05 finished in 331628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X(X((p0&&(p1 U (p2||G(p1))))))))))'
Support contains 5 out of 1252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1251 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1251 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1250 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1250 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1249 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1249 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1248 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1248 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1247 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1247 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1246 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1246 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1245 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1245 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1244 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1244 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1243 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1243 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1242 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1242 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1241 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1241 transition count 1864
Applied a total of 22 rules in 468 ms. Remains 1241 /1252 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2025-05-30 06:52:41] [INFO ] Computed 167 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:52:41] [INFO ] Implicit Places using invariants in 721 ms returned []
[2025-05-30 06:52:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:52:44] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned []
Implicit Place search using SMT with State Equation took 3085 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 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 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Starting structural reductions in LTL mode, iteration 1 : 1241/1252 places, 1864/1952 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64119 ms. Remains : 1241/1252 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 452 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-09
Product exploration explored 100000 steps with 540 reset in 386 ms.
Product exploration explored 100000 steps with 569 reset in 316 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 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (206 resets) in 190 ms. (209 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40002 steps (26 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (29 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (25 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
[2025-05-30 06:53:46] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 436/509 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 724/1233 variables, 128/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3105 variables, 1241/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3105 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3105 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3105/3105 variables, and 1408 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 436/509 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 724/1233 variables, 128/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3105 variables, 1241/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3105 variables, 4/1412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:53:49] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:53:49] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3105 variables, 2/1414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3105 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3105 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3105/3105 variables, and 1414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3228 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4417ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2664 ms.
Support contains 5 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1241 transition count 1623
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 1000 transition count 1622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 999 transition count 1622
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 165 Pre rules applied. Total rules applied 484 place count 999 transition count 1457
Deduced a syphon composed of 165 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 383 rules applied. Total rules applied 867 place count 781 transition count 1457
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 19 rules applied. Total rules applied 886 place count 771 transition count 1448
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 895 place count 762 transition count 1448
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 895 place count 762 transition count 1424
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 943 place count 738 transition count 1424
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 948 place count 733 transition count 1419
Iterating global reduction 5 with 5 rules applied. Total rules applied 953 place count 733 transition count 1419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 957 place count 733 transition count 1415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 958 place count 732 transition count 1415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 958 place count 732 transition count 1414
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 960 place count 731 transition count 1414
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 136 rules applied. Total rules applied 1096 place count 663 transition count 1346
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1102 place count 663 transition count 1340
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1108 place count 657 transition count 1340
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1132 place count 657 transition count 1316
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1157 place count 632 transition count 1316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1163 place count 632 transition count 1310
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 1183 place count 632 transition count 1310
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1184 place count 631 transition count 1309
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1190 place count 625 transition count 1309
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1190 place count 625 transition count 1297
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 1220 place count 607 transition count 1297
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1226 place count 601 transition count 1291
Iterating global reduction 10 with 6 rules applied. Total rules applied 1232 place count 601 transition count 1291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1238 place count 601 transition count 1285
Applied a total of 1238 rules in 218 ms. Remains 601 /1241 variables (removed 640) and now considering 1285/1864 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 601/1241 places, 1285/1864 transitions.
RANDOM walk for 40000 steps (627 resets) in 179 ms. (222 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (125 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (126 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (103 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
// Phase 1: matrix 1285 rows 601 cols
[2025-05-30 06:53:54] [INFO ] Computed 91 invariants in 12 ms
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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/46 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 133/179 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/201 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 240/441 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/445 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 127/572 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/573 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/573 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 28/601 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1285/1886 variables, 601/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1886 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1886 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1886/1886 variables, and 692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/46 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:53:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 133/179 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22/201 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 240/441 variables, 38/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/445 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 127/572 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/572 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/573 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/573 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 28/601 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1285/1886 variables, 601/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1886 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1886 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1886 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1886/1886 variables, and 696 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1930ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1357 ms.
Support contains 5 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1285/1285 transitions.
Applied a total of 0 rules in 19 ms. Remains 601 /601 variables (removed 0) and now considering 1285/1285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 601/601 places, 1285/1285 transitions.
RANDOM walk for 40000 steps (632 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (130 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (133 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (101 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5630 steps, run visited all 3 properties in 22 ms. (steps per millisecond=255 )
Probabilistic random walk after 5630 steps, saw 5356 distinct states, run finished after 25 ms. (steps per millisecond=225 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 p2))), (F (NOT (AND (OR p1 p2) p0))), (F (NOT (OR p1 p0 p2))), (F (NOT (AND p1 p0 (NOT p2)))), (F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 338 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Support contains 5 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 42 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2025-05-30 06:53:58] [INFO ] Computed 167 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:53:59] [INFO ] Implicit Places using invariants in 727 ms returned []
[2025-05-30 06:53:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:54:01] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1053 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 16.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 9.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 11.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 5.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 4.0)
(s201 3.0)
(s202 1.0)
(s203 2.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 11.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 11.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 7.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 8.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 12.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 2.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 16.0)
(s369 1.0)
(s370 16.0)
(s371 1.0)
(s372 3.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 3.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 2.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 11.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 9.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 2.0)
(s522 0.0)
(s523 2.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 2.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 3.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 0.0)
(s562 3.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 2.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 16.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 11.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 7.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 8.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 12.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 2.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 3.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 3.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 2.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 16.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 9.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 7.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 5.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 2.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 6.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 2.0)
(s929 1.0)
(s930 1.0)
(s931 3.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 32.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 0.0)
(s953 1.0)
(s954 0.0)
(s955 1.0)
(s956 0.0)
(s957 1.0)
(s958 0.0)
(s959 1.0)
(s960 0.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 11.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 6.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 12.0)
(s1053 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60529ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Finished structural reductions in LTL mode , in 1 iterations and 63590 ms. Remains : 1241/1241 places, 1864/1864 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 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (224 resets) in 215 ms. (185 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (27 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (24 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
[2025-05-30 06:55:02] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 436/509 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 724/1233 variables, 128/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3105 variables, 1241/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3105 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3105 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3105/3105 variables, and 1408 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 436/509 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 724/1233 variables, 128/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3105 variables, 1241/1408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3105 variables, 4/1412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3105 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/3105 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3105/3105 variables, and 1412 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2976 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4430ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4782 ms.
Support contains 5 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1241 transition count 1623
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 1000 transition count 1622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 999 transition count 1622
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 165 Pre rules applied. Total rules applied 484 place count 999 transition count 1457
Deduced a syphon composed of 165 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 383 rules applied. Total rules applied 867 place count 781 transition count 1457
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 19 rules applied. Total rules applied 886 place count 771 transition count 1448
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 895 place count 762 transition count 1448
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 895 place count 762 transition count 1424
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 943 place count 738 transition count 1424
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 948 place count 733 transition count 1419
Iterating global reduction 5 with 5 rules applied. Total rules applied 953 place count 733 transition count 1419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 957 place count 733 transition count 1415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 958 place count 732 transition count 1415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 958 place count 732 transition count 1414
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 960 place count 731 transition count 1414
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 136 rules applied. Total rules applied 1096 place count 663 transition count 1346
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1102 place count 663 transition count 1340
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1108 place count 657 transition count 1340
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1132 place count 657 transition count 1316
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1157 place count 632 transition count 1316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1163 place count 632 transition count 1310
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 1183 place count 632 transition count 1310
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1184 place count 631 transition count 1309
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1190 place count 625 transition count 1309
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1190 place count 625 transition count 1297
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 1220 place count 607 transition count 1297
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1226 place count 601 transition count 1291
Iterating global reduction 10 with 6 rules applied. Total rules applied 1232 place count 601 transition count 1291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1238 place count 601 transition count 1285
Applied a total of 1238 rules in 234 ms. Remains 601 /1241 variables (removed 640) and now considering 1285/1864 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 601/1241 places, 1285/1864 transitions.
RANDOM walk for 40000 steps (623 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (125 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (126 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (120 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 443218 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :3 out of 4
Probabilistic random walk after 443218 steps, saw 104481 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :3
// Phase 1: matrix 1285 rows 601 cols
[2025-05-30 06:55:15] [INFO ] Computed 91 invariants in 14 ms
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) 63/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/86 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 209/296 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/316 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/538 variables, 30/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/557 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/601 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1285/1886 variables, 601/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1886 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1886 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1886/1886 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 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) 63/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/86 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 209/296 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/316 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/538 variables, 30/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/557 variables, 4/83 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 06:55:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/601 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1285/1886 variables, 601/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1886 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1886 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1886 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1886/1886 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 357 ms.
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1285/1285 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 600 transition count 1284
Applied a total of 2 rules in 31 ms. Remains 600 /601 variables (removed 1) and now considering 1284/1285 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 600/601 places, 1284/1285 transitions.
RANDOM walk for 40000 steps (657 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (129 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 453306 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 453306 steps, saw 106751 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
// Phase 1: matrix 1284 rows 600 cols
[2025-05-30 06:55:20] [INFO ] Computed 91 invariants in 15 ms
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) 65/68 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/86 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/341 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/380 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 191/571 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/572 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 28/600 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/600 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1284/1884 variables, 600/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1884 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1884 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1884/1884 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 600/600 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) 65/68 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/86 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/341 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/380 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 191/571 variables, 32/84 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 06:55:20] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/572 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/572 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 28/600 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/600 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1284/1884 variables, 600/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1884 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1884 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1884 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1884/1884 variables, and 693 constraints, problems are : Problem set: 0 solved, 1 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 538 ms.
Support contains 3 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1284/1284 transitions.
Applied a total of 0 rules in 17 ms. Remains 600 /600 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 600/600 places, 1284/1284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1284/1284 transitions.
Applied a total of 0 rules in 17 ms. Remains 600 /600 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2025-05-30 06:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:22] [INFO ] Implicit Places using invariants in 521 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, 437, 444, 447, 449, 450, 455, 456, 508, 525, 531, 534, 536, 537]
[2025-05-30 06:55:22] [INFO ] Actually due to overlaps returned [187, 274, 361, 450, 537, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 437, 444, 449, 525, 531, 536, 71, 100, 158, 245, 332, 419, 508]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 523 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 570/600 places, 1284/1284 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 545 transition count 1259
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 545 transition count 1259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 540 transition count 1254
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 540 transition count 1254
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 84 place count 528 transition count 1242
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 101 place count 528 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 118 place count 511 transition count 1225
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 511 transition count 1219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 505 transition count 1219
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 131 place count 505 transition count 1219
Applied a total of 131 rules in 103 ms. Remains 505 /570 variables (removed 65) and now considering 1219/1284 (removed 65) transitions.
// Phase 1: matrix 1219 rows 505 cols
[2025-05-30 06:55:22] [INFO ] Computed 61 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:22] [INFO ] Implicit Places using invariants in 383 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 376, 377]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 385 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 495/600 places, 1219/1284 transitions.
Applied a total of 0 rules in 16 ms. Remains 495 /495 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1045 ms. Remains : 495/600 places, 1219/1284 transitions.
RANDOM walk for 40000 steps (710 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (151 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 141064 steps, run visited all 1 properties in 1142 ms. (steps per millisecond=123 )
Probabilistic random walk after 141064 steps, saw 79815 distinct states, run finished after 1143 ms. (steps per millisecond=123 ) properties seen :1
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (OR p1 p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p1 p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 413 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 541 reset in 269 ms.
Product exploration explored 100000 steps with 530 reset in 337 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Support contains 5 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 241 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1241 transition count 1864
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 241 place count 1241 transition count 1893
Deduced a syphon composed of 330 places in 2 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 330 place count 1241 transition count 1893
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 336 place count 1238 transition count 1893
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 371 place count 1203 transition count 1858
Deduced a syphon composed of 300 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 406 place count 1203 transition count 1858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 406 place count 1203 transition count 1858
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 1203 transition count 1858
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 408 place count 1202 transition count 1857
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 1202 transition count 1857
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 456 places in 2 ms
Iterating global reduction 2 with 156 rules applied. Total rules applied 565 place count 1202 transition count 1878
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 645 place count 1122 transition count 1798
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 725 place count 1122 transition count 1798
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 383 places in 2 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 732 place count 1122 transition count 1838
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 384 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 733 place count 1122 transition count 1842
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 735 place count 1120 transition count 1836
Deduced a syphon composed of 382 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 737 place count 1120 transition count 1836
Deduced a syphon composed of 382 places in 1 ms
Applied a total of 737 rules in 288 ms. Remains 1120 /1241 variables (removed 121) and now considering 1836/1864 (removed 28) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:55:27] [INFO ] Redundant transitions in 36 ms returned []
Running 1835 sub problems to find dead transitions.
// Phase 1: matrix 1836 rows 1120 cols
[2025-05-30 06:55:27] [INFO ] Computed 164 invariants in 19 ms
[2025-05-30 06:55:27] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 1835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1119/2956 variables, and 119 constraints, problems are : Problem set: 0 solved, 1835 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/39 constraints, Generalized P Invariants (flows): 119/125 constraints, State Equation: 0/1120 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 1835/1835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1835 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 1835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1119/2956 variables, and 119 constraints, problems are : Problem set: 0 solved, 1835 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/39 constraints, Generalized P Invariants (flows): 119/125 constraints, State Equation: 0/1120 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/1835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 1835 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1120/1241 places, 1836/1864 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60958 ms. Remains : 1120/1241 places, 1836/1864 transitions.
Built C files in :
/tmp/ltsmin1015802537438699849
[2025-05-30 06:56:27] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1015802537438699849
Running compilation step : cd /tmp/ltsmin1015802537438699849;'/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/ltsmin1015802537438699849;'/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/ltsmin1015802537438699849;'/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 5 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 40 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2025-05-30 06:56:31] [INFO ] Computed 167 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:56:31] [INFO ] Implicit Places using invariants in 746 ms returned []
[2025-05-30 06:56:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:56:34] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 3097 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:56: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/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Finished structural reductions in LTL mode , in 1 iterations and 63684 ms. Remains : 1241/1241 places, 1864/1864 transitions.
Built C files in :
/tmp/ltsmin10211037706500001985
[2025-05-30 06:57:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10211037706500001985
Running compilation step : cd /tmp/ltsmin10211037706500001985;'/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/ltsmin10211037706500001985;'/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/ltsmin10211037706500001985;'/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 06:57:37] [INFO ] Flatten gal took : 49 ms
[2025-05-30 06:57:37] [INFO ] Flatten gal took : 47 ms
[2025-05-30 06:57:37] [INFO ] Time to serialize gal into /tmp/LTL616384909618000028.gal : 11 ms
[2025-05-30 06:57:37] [INFO ] Time to serialize properties into /tmp/LTL3235570551374089393.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/LTL616384909618000028.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2672430022025251992.hoa' '-atoms' '/tmp/LTL3235570551374089393.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/LTL3235570551374089393.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2672430022025251992.hoa
Detected timeout of ITS tools.
[2025-05-30 06:57:52] [INFO ] Flatten gal took : 48 ms
[2025-05-30 06:57:53] [INFO ] Flatten gal took : 49 ms
[2025-05-30 06:57:53] [INFO ] Time to serialize gal into /tmp/LTL2823456607575447988.gal : 8 ms
[2025-05-30 06:57:53] [INFO ] Time to serialize properties into /tmp/LTL3996457209039221637.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/LTL2823456607575447988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3996457209039221637.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 : !((X(X((G("((p207==0)||(p1253==1))"))U(X(X((("(p926!=1)")U(("((!((p905==0)||(p69==1)))&&(p926!=1))")||(G("(p926!=1)"))))&&("((p207==0)...177
Formula 0 simplified : XX(F!"((p207==0)||(p1253==1))" R XX(!"((p207==0)||(p1253==1))" | (!"(p926!=1)" M !"((!((p905==0)||(p69==1)))&&(p926!=1))")))
Detected timeout of ITS tools.
[2025-05-30 06:58:08] [INFO ] Flatten gal took : 44 ms
[2025-05-30 06:58:08] [INFO ] Applying decomposition
[2025-05-30 06:58:08] [INFO ] Flatten gal took : 44 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/graph4048150253479021696.txt' '-o' '/tmp/graph4048150253479021696.bin' '-w' '/tmp/graph4048150253479021696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4048150253479021696.bin' '-l' '-1' '-v' '-w' '/tmp/graph4048150253479021696.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:58:08] [INFO ] Decomposing Gal with order
[2025-05-30 06:58:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:58:08] [INFO ] Removed a total of 2498 redundant transitions.
[2025-05-30 06:58:08] [INFO ] Flatten gal took : 89 ms
[2025-05-30 06:58:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 22 ms.
[2025-05-30 06:58:08] [INFO ] Time to serialize gal into /tmp/LTL13725127735751450790.gal : 12 ms
[2025-05-30 06:58:08] [INFO ] Time to serialize properties into /tmp/LTL787713102518981073.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/LTL13725127735751450790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL787713102518981073.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i0.i0.u8.p207==0)||(i16.i0.u341.p1253==1))"))U(X(X((("(i11.i1.u260.p926!=1)")U(("((!((i11.i3.u251.p905==0)||(i1.i2.u63.p6...277
Formula 0 simplified : XX(F!"((i0.i0.u8.p207==0)||(i16.i0.u341.p1253==1))" R XX(!"((i0.i0.u8.p207==0)||(i16.i0.u341.p1253==1))" | (!"(i11.i1.u260.p926!=1)"...235
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLCardinality-09 finished in 343036 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(G((p0 U p1))))'
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1251 transition count 1708
Reduce places removed 248 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 253 rules applied. Total rules applied 496 place count 1003 transition count 1703
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 501 place count 998 transition count 1703
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 501 place count 998 transition count 1528
Deduced a syphon composed of 175 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 3 with 403 rules applied. Total rules applied 904 place count 770 transition count 1528
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 32 rules applied. Total rules applied 936 place count 754 transition count 1512
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 17 rules applied. Total rules applied 953 place count 738 transition count 1511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 954 place count 737 transition count 1511
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 954 place count 737 transition count 1486
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1004 place count 712 transition count 1486
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1014 place count 702 transition count 1469
Iterating global reduction 6 with 10 rules applied. Total rules applied 1024 place count 702 transition count 1469
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 1031 place count 702 transition count 1462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1032 place count 701 transition count 1462
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1032 place count 701 transition count 1461
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 1034 place count 700 transition count 1461
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1035 place count 699 transition count 1453
Iterating global reduction 8 with 1 rules applied. Total rules applied 1036 place count 699 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1037 place count 698 transition count 1445
Iterating global reduction 8 with 1 rules applied. Total rules applied 1038 place count 698 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1039 place count 697 transition count 1437
Iterating global reduction 8 with 1 rules applied. Total rules applied 1040 place count 697 transition count 1437
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1041 place count 696 transition count 1429
Iterating global reduction 8 with 1 rules applied. Total rules applied 1042 place count 696 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1043 place count 695 transition count 1421
Iterating global reduction 8 with 1 rules applied. Total rules applied 1044 place count 695 transition count 1421
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1045 place count 694 transition count 1413
Iterating global reduction 8 with 1 rules applied. Total rules applied 1046 place count 694 transition count 1413
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1047 place count 693 transition count 1405
Iterating global reduction 8 with 1 rules applied. Total rules applied 1048 place count 693 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1049 place count 692 transition count 1397
Iterating global reduction 8 with 1 rules applied. Total rules applied 1050 place count 692 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1051 place count 691 transition count 1389
Iterating global reduction 8 with 1 rules applied. Total rules applied 1052 place count 691 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1053 place count 690 transition count 1381
Iterating global reduction 8 with 1 rules applied. Total rules applied 1054 place count 690 transition count 1381
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 8 with 126 rules applied. Total rules applied 1180 place count 627 transition count 1318
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 1182 place count 627 transition count 1318
Applied a total of 1182 rules in 284 ms. Remains 627 /1252 variables (removed 625) and now considering 1318/1952 (removed 634) transitions.
// Phase 1: matrix 1318 rows 627 cols
[2025-05-30 06:58:23] [INFO ] Computed 93 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:24] [INFO ] Implicit Places using invariants in 448 ms returned [72, 89, 95, 100, 159, 177, 183, 188, 191, 251, 268, 274, 279, 281, 341, 358, 364, 369, 371, 431, 448, 454, 459, 461, 539, 545, 550, 624]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 450 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/1252 places, 1318/1952 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 599 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 598 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 586 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 586 transition count 1305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 574 transition count 1293
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 574 transition count 1293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 568 transition count 1287
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 568 transition count 1287
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 84 place count 557 transition count 1276
Applied a total of 84 rules in 82 ms. Remains 557 /599 variables (removed 42) and now considering 1276/1318 (removed 42) transitions.
// Phase 1: matrix 1276 rows 557 cols
[2025-05-30 06:58:24] [INFO ] Computed 65 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:24] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-05-30 06:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:25] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 557/1252 places, 1276/1952 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2247 ms. Remains : 557/1252 places, 1276/1952 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-11
Stuttering criterion allowed to conclude after 9180 steps with 131 reset in 71 ms.
FORMULA ASLink-PT-06a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-11 finished in 2433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Applied a total of 0 rules in 91 ms. Remains 1252 /1252 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1252 cols
[2025-05-30 06:58:26] [INFO ] Computed 167 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:27] [INFO ] Implicit Places using invariants in 883 ms returned []
[2025-05-30 06:58:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:29] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 3207 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-30 06:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1251/3204 variables, and 117 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1252 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1251/3204 variables, and 117 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1252 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60603ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60606ms
Finished structural reductions in LTL mode , in 1 iterations and 63911 ms. Remains : 1252/1252 places, 1952/1952 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-12
Stuttering criterion allowed to conclude after 312 steps with 1 reset in 3 ms.
FORMULA ASLink-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-12 finished in 64063 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)||X(F((X(G(p1))&&F(p2)))))))'
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1251 transition count 1710
Reduce places removed 247 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 253 rules applied. Total rules applied 494 place count 1004 transition count 1704
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 501 place count 998 transition count 1703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 502 place count 997 transition count 1703
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 502 place count 997 transition count 1529
Deduced a syphon composed of 174 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 902 place count 771 transition count 1529
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 38 rules applied. Total rules applied 940 place count 754 transition count 1508
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 961 place count 733 transition count 1508
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 961 place count 733 transition count 1484
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 1009 place count 709 transition count 1484
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1021 place count 697 transition count 1465
Iterating global reduction 6 with 12 rules applied. Total rules applied 1033 place count 697 transition count 1465
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 10 rules applied. Total rules applied 1043 place count 697 transition count 1455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1044 place count 696 transition count 1455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1044 place count 696 transition count 1454
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 1046 place count 695 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1047 place count 694 transition count 1446
Iterating global reduction 8 with 1 rules applied. Total rules applied 1048 place count 694 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1049 place count 693 transition count 1438
Iterating global reduction 8 with 1 rules applied. Total rules applied 1050 place count 693 transition count 1438
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1051 place count 692 transition count 1430
Iterating global reduction 8 with 1 rules applied. Total rules applied 1052 place count 692 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1053 place count 691 transition count 1422
Iterating global reduction 8 with 1 rules applied. Total rules applied 1054 place count 691 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1055 place count 690 transition count 1414
Iterating global reduction 8 with 1 rules applied. Total rules applied 1056 place count 690 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1057 place count 689 transition count 1406
Iterating global reduction 8 with 1 rules applied. Total rules applied 1058 place count 689 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1059 place count 688 transition count 1398
Iterating global reduction 8 with 1 rules applied. Total rules applied 1060 place count 688 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1061 place count 687 transition count 1390
Iterating global reduction 8 with 1 rules applied. Total rules applied 1062 place count 687 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1063 place count 686 transition count 1382
Iterating global reduction 8 with 1 rules applied. Total rules applied 1064 place count 686 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1065 place count 685 transition count 1374
Iterating global reduction 8 with 1 rules applied. Total rules applied 1066 place count 685 transition count 1374
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 128 rules applied. Total rules applied 1194 place count 621 transition count 1310
Applied a total of 1194 rules in 247 ms. Remains 621 /1252 variables (removed 631) and now considering 1310/1952 (removed 642) transitions.
// Phase 1: matrix 1310 rows 621 cols
[2025-05-30 06:59:30] [INFO ] Computed 92 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:59:30] [INFO ] Implicit Places using invariants in 461 ms returned [72, 92, 98, 103, 162, 180, 186, 191, 193, 253, 270, 276, 281, 283, 343, 361, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 618]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 462 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1252 places, 1310/1952 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 591 transition count 1309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 590 transition count 1309
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 579 transition count 1298
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 579 transition count 1298
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 569 transition count 1288
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 569 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 565 transition count 1284
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 565 transition count 1284
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 76 place count 553 transition count 1272
Applied a total of 76 rules in 74 ms. Remains 553 /591 variables (removed 38) and now considering 1272/1310 (removed 38) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2025-05-30 06:59:30] [INFO ] Computed 62 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:59:31] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-05-30 06:59:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:59:32] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1252 places, 1272/1952 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2188 ms. Remains : 553/1252 places, 1272/1952 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-13
Stuttering criterion allowed to conclude after 111 steps with 3 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-13 finished in 2389 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 1252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1251 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1251 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1250 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1250 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1249 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1249 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1248 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1248 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1247 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1247 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1246 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1246 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1245 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1245 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1244 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1244 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1243 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1243 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1242 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1242 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1241 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1241 transition count 1864
Applied a total of 22 rules in 457 ms. Remains 1241 /1252 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2025-05-30 06:59:32] [INFO ] Computed 167 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:59:33] [INFO ] Implicit Places using invariants in 718 ms returned []
[2025-05-30 06:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:59:35] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-05-30 06:59:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 1863 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 1240/3105 variables, and 117 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 117/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Starting structural reductions in LTL mode, iteration 1 : 1241/1252 places, 1864/1952 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64050 ms. Remains : 1241/1252 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 182 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-15 finished in 64148 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(X(X((!G(!X(p0)) U p1)))))'
Found a Lengthening insensitive property : ASLink-PT-06a-LTLCardinality-04
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1252 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1252/1252 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1251 transition count 1710
Reduce places removed 246 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 251 rules applied. Total rules applied 492 place count 1005 transition count 1705
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 499 place count 1000 transition count 1703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 501 place count 998 transition count 1703
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 501 place count 998 transition count 1529
Deduced a syphon composed of 174 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 4 with 401 rules applied. Total rules applied 902 place count 771 transition count 1529
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 34 rules applied. Total rules applied 936 place count 756 transition count 1510
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 955 place count 737 transition count 1510
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 955 place count 737 transition count 1485
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1005 place count 712 transition count 1485
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1016 place count 701 transition count 1467
Iterating global reduction 6 with 11 rules applied. Total rules applied 1027 place count 701 transition count 1467
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 1036 place count 701 transition count 1458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1037 place count 700 transition count 1458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1037 place count 700 transition count 1457
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 1039 place count 699 transition count 1457
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1040 place count 698 transition count 1449
Iterating global reduction 8 with 1 rules applied. Total rules applied 1041 place count 698 transition count 1449
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1042 place count 697 transition count 1441
Iterating global reduction 8 with 1 rules applied. Total rules applied 1043 place count 697 transition count 1441
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1044 place count 696 transition count 1433
Iterating global reduction 8 with 1 rules applied. Total rules applied 1045 place count 696 transition count 1433
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1046 place count 695 transition count 1425
Iterating global reduction 8 with 1 rules applied. Total rules applied 1047 place count 695 transition count 1425
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1048 place count 694 transition count 1417
Iterating global reduction 8 with 1 rules applied. Total rules applied 1049 place count 694 transition count 1417
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1050 place count 693 transition count 1409
Iterating global reduction 8 with 1 rules applied. Total rules applied 1051 place count 693 transition count 1409
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1052 place count 692 transition count 1401
Iterating global reduction 8 with 1 rules applied. Total rules applied 1053 place count 692 transition count 1401
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1054 place count 691 transition count 1393
Iterating global reduction 8 with 1 rules applied. Total rules applied 1055 place count 691 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1056 place count 690 transition count 1385
Iterating global reduction 8 with 1 rules applied. Total rules applied 1057 place count 690 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1058 place count 689 transition count 1377
Iterating global reduction 8 with 1 rules applied. Total rules applied 1059 place count 689 transition count 1377
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 8 with 124 rules applied. Total rules applied 1183 place count 627 transition count 1315
Applied a total of 1183 rules in 265 ms. Remains 627 /1252 variables (removed 625) and now considering 1315/1952 (removed 637) transitions.
// Phase 1: matrix 1315 rows 627 cols
[2025-05-30 07:00:37] [INFO ] Computed 94 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:37] [INFO ] Implicit Places using invariants in 459 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 357, 363, 368, 440, 457, 463, 468, 470, 530, 547, 553, 559, 561, 624]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 461 ms to find 28 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 599/1252 places, 1315/1952 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 599 transition count 1314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 598 transition count 1314
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 586 transition count 1302
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 586 transition count 1302
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 574 transition count 1290
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 574 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 568 transition count 1284
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 568 transition count 1284
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 84 place count 557 transition count 1273
Applied a total of 84 rules in 79 ms. Remains 557 /599 variables (removed 42) and now considering 1273/1315 (removed 42) transitions.
// Phase 1: matrix 1273 rows 557 cols
[2025-05-30 07:00:37] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:38] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-05-30 07:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:39] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 557/1252 places, 1273/1952 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2234 ms. Remains : 557/1252 places, 1273/1952 transitions.
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-04
Product exploration explored 100000 steps with 1551 reset in 219 ms.
Product exploration explored 100000 steps with 1612 reset in 260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 3188 steps (39 resets) in 37 ms. (83 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1273/1273 transitions.
Applied a total of 0 rules in 16 ms. Remains 557 /557 variables (removed 0) and now considering 1273/1273 (removed 0) transitions.
[2025-05-30 07:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:41] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-05-30 07:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:42] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
Running 1237 sub problems to find dead transitions.
[2025-05-30 07:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1830 variables, and 60 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 51/54 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/1830 variables, and 60 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 51/54 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in LTL mode , in 1 iterations and 61820 ms. Remains : 557/557 places, 1273/1273 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 945 steps (10 resets) in 9 ms. (94 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1608 reset in 209 ms.
Product exploration explored 100000 steps with 1608 reset in 221 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1273/1273 transitions.
Applied a total of 0 rules in 25 ms. Remains 557 /557 variables (removed 0) and now considering 1273/1273 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:01:44] [INFO ] Redundant transitions in 18 ms returned []
Running 1237 sub problems to find dead transitions.
[2025-05-30 07:01:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1830 variables, and 60 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 51/54 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/1830 variables, and 60 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 51/54 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60411 ms. Remains : 557/557 places, 1273/1273 transitions.
Built C files in :
/tmp/ltsmin17478276132713184841
[2025-05-30 07:02:44] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17478276132713184841
Running compilation step : cd /tmp/ltsmin17478276132713184841;'/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'
Compilation finished in 2355 ms.
Running link step : cd /tmp/ltsmin17478276132713184841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin17478276132713184841;'/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' '--hoa' '/tmp/stateBased2897836922978457365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1273/1273 transitions.
Applied a total of 0 rules in 16 ms. Remains 557 /557 variables (removed 0) and now considering 1273/1273 (removed 0) transitions.
[2025-05-30 07:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:03:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-05-30 07:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:03:01] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Running 1237 sub problems to find dead transitions.
[2025-05-30 07:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1830 variables, and 60 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 51/54 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/1830 variables, and 60 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 51/54 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Finished structural reductions in LTL mode , in 1 iterations and 61839 ms. Remains : 557/557 places, 1273/1273 transitions.
Built C files in :
/tmp/ltsmin13527496153260973700
[2025-05-30 07:04:01] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13527496153260973700
Running compilation step : cd /tmp/ltsmin13527496153260973700;'/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'
Compilation finished in 2222 ms.
Running link step : cd /tmp/ltsmin13527496153260973700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13527496153260973700;'/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' '--hoa' '/tmp/stateBased16514895908068298908.hoa' '--buchi-type=spotba'
LTSmin run took 325 ms.
Treatment of property ASLink-PT-06a-LTLCardinality-04 finished in 207760 ms.
FORMULA ASLink-PT-06a-LTLCardinality-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(G(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' '!(X(X((G(p0) U X(X((p0&&(p1 U (p2||G(p1))))))))))'
[2025-05-30 07:04:04] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5678475060498106835
[2025-05-30 07:04:04] [INFO ] Too many transitions (1952) to apply POR reductions. Disabling POR matrices.
[2025-05-30 07:04:04] [INFO ] Applying decomposition
[2025-05-30 07:04:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5678475060498106835
Running compilation step : cd /tmp/ltsmin5678475060498106835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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 07:04:04] [INFO ] Flatten gal took : 48 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/graph12108202048302389628.txt' '-o' '/tmp/graph12108202048302389628.bin' '-w' '/tmp/graph12108202048302389628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12108202048302389628.bin' '-l' '-1' '-v' '-w' '/tmp/graph12108202048302389628.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:04:04] [INFO ] Decomposing Gal with order
[2025-05-30 07:04:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:04:05] [INFO ] Removed a total of 2755 redundant transitions.
[2025-05-30 07:04:05] [INFO ] Flatten gal took : 84 ms
[2025-05-30 07:04:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 14 ms.
[2025-05-30 07:04:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality7598439258221465859.gal : 14 ms
[2025-05-30 07:04:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality3890198541769171856.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/LTLCardinality7598439258221465859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3890198541769171856.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...276
Read 2 LTL properties
Checking formula 0 : !((F(G("(((i6.i0.u137.p492==0)||(i15.i0.u328.p1166==1))||((i17.u385.p1389!=0)&&(i1.i3.u58.p175!=1)))"))))
Formula 0 simplified : GF!"(((i6.i0.u137.p492==0)||(i15.i0.u328.p1166==1))||((i17.u385.p1389!=0)&&(i1.i3.u58.p175!=1)))"
Compilation finished in 3889 ms.
Running link step : cd /tmp/ltsmin5678475060498106835;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5678475060498106835;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin5678475060498106835;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5678475060498106835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp3==true)) U X(X(((LTLAPp3==true)&&((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin5678475060498106835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp3==true)) U X(X(((LTLAPp3==true)&&((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5678475060498106835;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 07:31:37] [INFO ] Applying decomposition
[2025-05-30 07:31:38] [INFO ] Flatten gal took : 138 ms
[2025-05-30 07:31:38] [INFO ] Decomposing Gal with order
[2025-05-30 07:31:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:31:38] [INFO ] Removed a total of 2256 redundant transitions.
[2025-05-30 07:31:38] [INFO ] Flatten gal took : 224 ms
[2025-05-30 07:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 807 labels/synchronizations in 112 ms.
[2025-05-30 07:31:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality16351226278190176788.gal : 24 ms
[2025-05-30 07:31:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality3407088949596857442.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/LTLCardinality16351226278190176788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3407088949596857442.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 2 LTL properties
Checking formula 0 : !((F(G("(((i20.i1.u260.p492==0)||(i44.u203.p1166==1))||((i51.u251.p1389!=0)&&(i5.u23.p175!=1)))"))))
Formula 0 simplified : GF!"(((i20.i1.u260.p492==0)||(i44.u203.p1166==1))||((i51.u251.p1389!=0)&&(i5.u23.p175!=1)))"

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-06a"
export BK_EXAMINATION="LTLCardinality"
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-06a, examination is LTLCardinality"
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-174853729100363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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