Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K 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 357K 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-03a-LTLCardinality-00
FORMULA_NAME ASLink-PT-03a-LTLCardinality-01
FORMULA_NAME ASLink-PT-03a-LTLCardinality-02
FORMULA_NAME ASLink-PT-03a-LTLCardinality-03
FORMULA_NAME ASLink-PT-03a-LTLCardinality-04
FORMULA_NAME ASLink-PT-03a-LTLCardinality-05
FORMULA_NAME ASLink-PT-03a-LTLCardinality-06
FORMULA_NAME ASLink-PT-03a-LTLCardinality-07
FORMULA_NAME ASLink-PT-03a-LTLCardinality-08
FORMULA_NAME ASLink-PT-03a-LTLCardinality-09
FORMULA_NAME ASLink-PT-03a-LTLCardinality-10
FORMULA_NAME ASLink-PT-03a-LTLCardinality-11
FORMULA_NAME ASLink-PT-03a-LTLCardinality-12
FORMULA_NAME ASLink-PT-03a-LTLCardinality-13
FORMULA_NAME ASLink-PT-03a-LTLCardinality-14
FORMULA_NAME ASLink-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748570081268

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 01:54:42] [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 01:54:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:54:42] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-05-30 01:54:42] [INFO ] Transformed 821 places.
[2025-05-30 01:54:42] [INFO ] Transformed 1281 transitions.
[2025-05-30 01:54:42] [INFO ] Found NUPN structural information;
[2025-05-30 01:54:42] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-03a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 821 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 803 transition count 1268
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 795 transition count 1237
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 794 transition count 1237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 794 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 793 transition count 1227
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 793 transition count 1227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 792 transition count 1219
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 792 transition count 1219
Applied a total of 41 rules in 196 ms. Remains 792 /821 variables (removed 29) and now considering 1219/1268 (removed 49) transitions.
// Phase 1: matrix 1219 rows 792 cols
[2025-05-30 01:54:43] [INFO ] Computed 137 invariants in 74 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:54:44] [INFO ] Implicit Places using invariants in 981 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 408, 409, 427, 445, 574, 579, 591, 596, 597, 598, 632, 635, 653, 655, 656, 673, 689, 695, 701, 707, 713, 721, 727, 733, 741]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 41 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 751/821 places, 1219/1268 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 740 transition count 1208
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 740 transition count 1208
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 732 transition count 1200
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 732 transition count 1200
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 729 transition count 1197
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 729 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 728 transition count 1196
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 728 transition count 1196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 727 transition count 1195
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 727 transition count 1195
Applied a total of 48 rules in 106 ms. Remains 727 /751 variables (removed 24) and now considering 1195/1219 (removed 24) transitions.
// Phase 1: matrix 1195 rows 727 cols
[2025-05-30 01:54:44] [INFO ] Computed 96 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:54:44] [INFO ] Implicit Places using invariants in 491 ms returned []
[2025-05-30 01:54:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:54:46] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 727/821 places, 1195/1268 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3298 ms. Remains : 727/821 places, 1195/1268 transitions.
Support contains 35 out of 727 places after structural reductions.
[2025-05-30 01:54:46] [INFO ] Flatten gal took : 114 ms
[2025-05-30 01:54:46] [INFO ] Flatten gal took : 81 ms
[2025-05-30 01:54:46] [INFO ] Input system was already deterministic with 1195 transitions.
Support contains 33 out of 727 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (355 resets) in 1393 ms. (28 steps per ms) remains 8/18 properties
BEST_FIRST walk for 40002 steps (70 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (81 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (83 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (81 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (74 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (77 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (78 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
[2025-05-30 01:54:47] [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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 183/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 154/351 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 364/715 variables, 67/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 12/727 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1195/1922 variables, 727/823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1922 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1922 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1922/1922 variables, and 823 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 71/71 constraints, State Equation: 727/727 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
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 183/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 154/351 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:54:49] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 6 (OVERLAPS) 364/715 variables, 67/93 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:54:49] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:54:49] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:54:49] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 3/96 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 12/727 variables, 4/100 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/727 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1195/1922 variables, 727/827 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1922 variables, 7/834 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1922/1922 variables, and 834 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 71/71 constraints, State Equation: 727/727 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6352ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 727 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 727 transition count 1073
Reduce places removed 122 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 124 rules applied. Total rules applied 246 place count 605 transition count 1071
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 248 place count 603 transition count 1071
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 248 place count 603 transition count 991
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 26 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 434 place count 497 transition count 991
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 438 place count 494 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 439 place count 493 transition count 990
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 439 place count 493 transition count 982
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 455 place count 485 transition count 982
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 458 place count 482 transition count 972
Iterating global reduction 5 with 3 rules applied. Total rules applied 461 place count 482 transition count 972
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 462 place count 482 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 463 place count 481 transition count 971
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 463 place count 481 transition count 970
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 465 place count 480 transition count 970
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 466 place count 479 transition count 962
Iterating global reduction 7 with 1 rules applied. Total rules applied 467 place count 479 transition count 962
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 468 place count 478 transition count 954
Iterating global reduction 7 with 1 rules applied. Total rules applied 469 place count 478 transition count 954
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 470 place count 477 transition count 946
Iterating global reduction 7 with 1 rules applied. Total rules applied 471 place count 477 transition count 946
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 472 place count 476 transition count 938
Iterating global reduction 7 with 1 rules applied. Total rules applied 473 place count 476 transition count 938
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 474 place count 475 transition count 930
Iterating global reduction 7 with 1 rules applied. Total rules applied 475 place count 475 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 476 place count 474 transition count 922
Iterating global reduction 7 with 1 rules applied. Total rules applied 477 place count 474 transition count 922
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 478 place count 473 transition count 914
Iterating global reduction 7 with 1 rules applied. Total rules applied 479 place count 473 transition count 914
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 480 place count 472 transition count 906
Iterating global reduction 7 with 1 rules applied. Total rules applied 481 place count 472 transition count 906
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 482 place count 471 transition count 898
Iterating global reduction 7 with 1 rules applied. Total rules applied 483 place count 471 transition count 898
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 484 place count 470 transition count 890
Iterating global reduction 7 with 1 rules applied. Total rules applied 485 place count 470 transition count 890
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 486 place count 469 transition count 882
Iterating global reduction 7 with 1 rules applied. Total rules applied 487 place count 469 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 488 place count 468 transition count 874
Iterating global reduction 7 with 1 rules applied. Total rules applied 489 place count 468 transition count 874
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 490 place count 467 transition count 866
Iterating global reduction 7 with 1 rules applied. Total rules applied 491 place count 467 transition count 866
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 579 place count 423 transition count 822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 422 transition count 821
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 422 transition count 821
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 584 place count 422 transition count 818
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 587 place count 419 transition count 818
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 8 with 25 rules applied. Total rules applied 612 place count 419 transition count 793
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 638 place count 393 transition count 793
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 641 place count 393 transition count 790
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 642 place count 393 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 643 place count 392 transition count 789
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 651 place count 392 transition count 789
Applied a total of 651 rules in 409 ms. Remains 392 /727 variables (removed 335) and now considering 789/1195 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 392/727 places, 789/1195 transitions.
RANDOM walk for 40000 steps (679 resets) in 348 ms. (114 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (209 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (216 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (209 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (190 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
// Phase 1: matrix 789 rows 392 cols
[2025-05-30 01:54:54] [INFO ] Computed 66 invariants in 16 ms
[2025-05-30 01:54:54] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 113/130 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 245/375 variables, 45/63 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 01:54:54] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 17/392 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 789/1181 variables, 392/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1181 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1181 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1181 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1181/1181 variables, and 479 constraints, problems are : Problem set: 0 solved, 4 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 392/392 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 113/130 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 245/375 variables, 45/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 17/392 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 789/1181 variables, 392/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1181 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1181 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1181 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1181 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1181/1181 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8490 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 392/392 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9311ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8549 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 789/789 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 390 transition count 787
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 390 transition count 787
Applied a total of 6 rules in 33 ms. Remains 390 /392 variables (removed 2) and now considering 787/789 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 390/392 places, 787/789 transitions.
RANDOM walk for 40000 steps (722 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (189 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (198 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (209 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (187 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 447000 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :2 out of 4
Probabilistic random walk after 447000 steps, saw 166870 distinct states, run finished after 3008 ms. (steps per millisecond=148 ) properties seen :2
// Phase 1: matrix 787 rows 390 cols
[2025-05-30 01:55:15] [INFO ] Computed 66 invariants in 11 ms
[2025-05-30 01:55:15] [INFO ] State equation strengthened by 20 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/127 variables, 16/18 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 01:55:15] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 244/371 variables, 43/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 19/390 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 787/1177 variables, 390/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1177 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1177 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1177 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1177/1177 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 390/390 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/127 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/19 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 01:55:16] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 244/371 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 19/390 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 787/1177 variables, 390/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1177 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1177 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1177 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1177 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1177/1177 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 390/390 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1220ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 787/787 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 390 transition count 786
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 389 transition count 786
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 389 transition count 785
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 387 transition count 785
Applied a total of 5 rules in 20 ms. Remains 387 /390 variables (removed 3) and now considering 785/787 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 387/390 places, 785/787 transitions.
RANDOM walk for 40000 steps (717 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (213 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (201 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 500587 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 2
Probabilistic random walk after 500587 steps, saw 158252 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
// Phase 1: matrix 785 rows 387 cols
[2025-05-30 01:55:20] [INFO ] Computed 65 invariants in 15 ms
[2025-05-30 01:55:20] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/127 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 242/369 variables, 43/61 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 01:55:20] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:55:20] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 18/387 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 785/1172 variables, 387/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1172 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1172 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1172 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 474 constraints, problems are : Problem set: 0 solved, 2 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 387/387 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/127 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 242/369 variables, 43/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/63 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 01:55:21] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/387 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 785/1172 variables, 387/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1172 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1172 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1172 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1172 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1172/1172 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 387/387 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1862ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 297 ms.
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 785/785 transitions.
Applied a total of 0 rules in 12 ms. Remains 387 /387 variables (removed 0) and now considering 785/785 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 387/387 places, 785/785 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 785/785 transitions.
Applied a total of 0 rules in 11 ms. Remains 387 /387 variables (removed 0) and now considering 785/785 (removed 0) transitions.
[2025-05-30 01:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:22] [INFO ] Implicit Places using invariants in 333 ms returned [89, 95, 98, 100, 103, 111, 112, 113, 175, 185, 191, 194, 196, 199, 206, 207, 208, 209, 278, 284, 287, 289, 292, 305, 323, 343, 353, 374, 377, 380, 383, 386]
[2025-05-30 01:55:22] [INFO ] Actually due to overlaps returned [323, 111, 206, 112, 207, 209, 343, 113, 208, 305, 89, 95, 100, 278, 284, 289, 103, 199, 292, 353, 374, 377, 380, 383, 386]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 335 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 362/387 places, 785/785 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 362 transition count 784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 784
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 361 transition count 773
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 24 place count 350 transition count 773
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 40 place count 334 transition count 757
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 334 transition count 757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 334 transition count 751
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 331 transition count 748
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 331 transition count 748
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 330 transition count 747
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 330 transition count 747
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 329 transition count 746
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 329 transition count 746
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 90 place count 320 transition count 737
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 320 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 102 place count 314 transition count 731
Applied a total of 102 rules in 62 ms. Remains 314 /362 variables (removed 48) and now considering 731/785 (removed 54) transitions.
// Phase 1: matrix 731 rows 314 cols
[2025-05-30 01:55:22] [INFO ] Computed 40 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:23] [INFO ] Implicit Places using invariants in 241 ms returned [72, 89, 146, 156, 166, 172, 175, 177, 178, 234, 251]
[2025-05-30 01:55:23] [INFO ] Actually due to overlaps returned [178, 251, 166, 172, 177, 72, 89, 146, 156, 234]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 243 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 304/387 places, 731/785 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 299 transition count 726
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 299 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 298 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 298 transition count 725
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 295 transition count 722
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 295 transition count 719
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 292 transition count 719
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 292 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 289 transition count 716
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 31 place count 289 transition count 716
Applied a total of 31 rules in 55 ms. Remains 289 /304 variables (removed 15) and now considering 716/731 (removed 15) transitions.
// Phase 1: matrix 716 rows 289 cols
[2025-05-30 01:55:23] [INFO ] Computed 30 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:23] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 01:55:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 01:55:23] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 289/387 places, 716/785 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1576 ms. Remains : 289/387 places, 716/785 transitions.
RANDOM walk for 40000 steps (837 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (274 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (284 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 396987 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 396987 steps, saw 277508 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2025-05-30 01:55:27] [INFO ] Invariant cache hit.
[2025-05-30 01:55:27] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/97 variables, 6/8 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 01:55:27] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 180/277 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/289 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 716/1005 variables, 289/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1005 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1005 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1005 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1005/1005 variables, and 323 constraints, problems are : Problem set: 0 solved, 2 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 289/289 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/97 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 180/277 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/289 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 716/1005 variables, 289/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1005 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1005 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1005 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1005 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1005/1005 variables, and 325 constraints, problems are : Problem set: 0 solved, 2 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 289/289 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1449ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 201 ms.
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 716/716 transitions.
Applied a total of 0 rules in 9 ms. Remains 289 /289 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 289/289 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 716/716 transitions.
Applied a total of 0 rules in 9 ms. Remains 289 /289 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2025-05-30 01:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:28] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-30 01:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 01:55:29] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:55:29] [INFO ] Redundant transitions in 44 ms returned []
Running 715 sub problems to find dead transitions.
[2025-05-30 01:55:29] [INFO ] Invariant cache hit.
[2025-05-30 01:55:29] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/289 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:55:46] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:55:53] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/1005 variables, and 32 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/289 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/289 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 6 (OVERLAPS) 716/1005 variables, 289/321 constraints. Problems are: Problem set: 203 solved, 512 unsolved
SMT process timed out in 60306ms, After SMT, problems are : Problem set: 203 solved, 512 unsolved
Search for dead transitions found 203 dead transitions in 60310ms
Found 203 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 203 transitions
Dead transitions reduction (with SMT) removed 203 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 289/289 places, 513/716 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 282 transition count 513
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 282 transition count 506
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 275 transition count 506
Applied a total of 21 rules in 10 ms. Remains 275 /289 variables (removed 14) and now considering 506/513 (removed 7) transitions.
// Phase 1: matrix 506 rows 275 cols
[2025-05-30 01:56:30] [INFO ] Computed 30 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:30] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-30 01:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:56:30] [INFO ] Implicit Places using invariants and state equation in 650 ms returned [2, 49, 78, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196]
[2025-05-30 01:56:30] [INFO ] Actually due to overlaps returned [2, 78, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196]
Discarding 16 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 850 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 259/289 places, 505/716 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 259 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 504
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 258 transition count 503
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 257 transition count 503
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 11 place count 257 transition count 502
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 250 transition count 502
Applied a total of 18 rules in 17 ms. Remains 250 /259 variables (removed 9) and now considering 502/505 (removed 3) transitions.
// Phase 1: matrix 502 rows 250 cols
[2025-05-30 01:56:30] [INFO ] Computed 26 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:31] [INFO ] Implicit Places using invariants in 168 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 249/289 places, 502/716 transitions.
Applied a total of 0 rules in 6 ms. Remains 249 /249 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 62398 ms. Remains : 249/289 places, 502/716 transitions.
FORMULA ASLink-PT-03a-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ASLink-PT-03a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(G(p0)))'
Support contains 1 out of 727 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 726 transition count 1058
Reduce places removed 140 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 143 rules applied. Total rules applied 279 place count 586 transition count 1055
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 282 place count 583 transition count 1055
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 282 place count 583 transition count 963
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 495 place count 462 transition count 963
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 26 rules applied. Total rules applied 521 place count 451 transition count 948
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 536 place count 436 transition count 948
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 536 place count 436 transition count 939
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 554 place count 427 transition count 939
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 563 place count 418 transition count 923
Iterating global reduction 5 with 9 rules applied. Total rules applied 572 place count 418 transition count 923
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 5 with 7 rules applied. Total rules applied 579 place count 418 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 580 place count 417 transition count 916
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 580 place count 417 transition count 915
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 582 place count 416 transition count 915
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 583 place count 415 transition count 907
Iterating global reduction 7 with 1 rules applied. Total rules applied 584 place count 415 transition count 907
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 585 place count 414 transition count 899
Iterating global reduction 7 with 1 rules applied. Total rules applied 586 place count 414 transition count 899
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 587 place count 413 transition count 891
Iterating global reduction 7 with 1 rules applied. Total rules applied 588 place count 413 transition count 891
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 589 place count 412 transition count 883
Iterating global reduction 7 with 1 rules applied. Total rules applied 590 place count 412 transition count 883
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 591 place count 411 transition count 875
Iterating global reduction 7 with 1 rules applied. Total rules applied 592 place count 411 transition count 875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 593 place count 410 transition count 867
Iterating global reduction 7 with 1 rules applied. Total rules applied 594 place count 410 transition count 867
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 595 place count 409 transition count 859
Iterating global reduction 7 with 1 rules applied. Total rules applied 596 place count 409 transition count 859
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 597 place count 408 transition count 851
Iterating global reduction 7 with 1 rules applied. Total rules applied 598 place count 408 transition count 851
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 599 place count 407 transition count 843
Iterating global reduction 7 with 1 rules applied. Total rules applied 600 place count 407 transition count 843
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 601 place count 406 transition count 835
Iterating global reduction 7 with 1 rules applied. Total rules applied 602 place count 406 transition count 835
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 603 place count 405 transition count 827
Iterating global reduction 7 with 1 rules applied. Total rules applied 604 place count 405 transition count 827
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 605 place count 404 transition count 819
Iterating global reduction 7 with 1 rules applied. Total rules applied 606 place count 404 transition count 819
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 607 place count 403 transition count 811
Iterating global reduction 7 with 1 rules applied. Total rules applied 608 place count 403 transition count 811
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 684 place count 365 transition count 773
Applied a total of 684 rules in 175 ms. Remains 365 /727 variables (removed 362) and now considering 773/1195 (removed 422) transitions.
// Phase 1: matrix 773 rows 365 cols
[2025-05-30 01:56:31] [INFO ] Computed 52 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:31] [INFO ] Implicit Places using invariants in 250 ms returned [72, 89, 95, 100, 159, 193, 202, 254, 271, 277, 282, 284, 313, 342, 362]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 251 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/727 places, 773/1195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 350 transition count 771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 348 transition count 771
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 348 transition count 767
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 344 transition count 767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 338 transition count 761
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 338 transition count 761
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 333 transition count 756
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 333 transition count 756
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 330 transition count 753
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 330 transition count 753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 329 transition count 752
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 329 transition count 752
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 66 place count 317 transition count 740
Applied a total of 66 rules in 59 ms. Remains 317 /350 variables (removed 33) and now considering 740/773 (removed 33) transitions.
// Phase 1: matrix 740 rows 317 cols
[2025-05-30 01:56:31] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:32] [INFO ] Implicit Places using invariants in 208 ms returned [163, 169, 174]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 209 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 314/727 places, 740/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 312 transition count 738
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 312 transition count 738
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 310 transition count 736
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 310 transition count 736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 309 transition count 735
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 309 transition count 735
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 308 transition count 734
Applied a total of 12 rules in 33 ms. Remains 308 /314 variables (removed 6) and now considering 734/740 (removed 6) transitions.
// Phase 1: matrix 734 rows 308 cols
[2025-05-30 01:56:32] [INFO ] Computed 34 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:32] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 01:56:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:32] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 308/727 places, 734/1195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1480 ms. Remains : 308/727 places, 734/1195 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-00
Product exploration explored 100000 steps with 1806 reset in 286 ms.
Stack based approach found an accepted trace after 64532 steps with 1193 reset with depth 179 and stack size 179 in 141 ms.
FORMULA ASLink-PT-03a-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-00 finished in 2142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 727 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 726 transition count 1059
Reduce places removed 139 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 142 rules applied. Total rules applied 277 place count 587 transition count 1056
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 280 place count 584 transition count 1056
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 280 place count 584 transition count 964
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 493 place count 463 transition count 964
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 26 rules applied. Total rules applied 519 place count 452 transition count 949
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 534 place count 437 transition count 949
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 534 place count 437 transition count 940
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 552 place count 428 transition count 940
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 561 place count 419 transition count 924
Iterating global reduction 5 with 9 rules applied. Total rules applied 570 place count 419 transition count 924
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 5 with 7 rules applied. Total rules applied 577 place count 419 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 578 place count 418 transition count 917
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 578 place count 418 transition count 916
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 580 place count 417 transition count 916
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 581 place count 416 transition count 908
Iterating global reduction 7 with 1 rules applied. Total rules applied 582 place count 416 transition count 908
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 583 place count 415 transition count 900
Iterating global reduction 7 with 1 rules applied. Total rules applied 584 place count 415 transition count 900
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 585 place count 414 transition count 892
Iterating global reduction 7 with 1 rules applied. Total rules applied 586 place count 414 transition count 892
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 587 place count 413 transition count 884
Iterating global reduction 7 with 1 rules applied. Total rules applied 588 place count 413 transition count 884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 589 place count 412 transition count 876
Iterating global reduction 7 with 1 rules applied. Total rules applied 590 place count 412 transition count 876
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 591 place count 411 transition count 868
Iterating global reduction 7 with 1 rules applied. Total rules applied 592 place count 411 transition count 868
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 593 place count 410 transition count 860
Iterating global reduction 7 with 1 rules applied. Total rules applied 594 place count 410 transition count 860
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 595 place count 409 transition count 852
Iterating global reduction 7 with 1 rules applied. Total rules applied 596 place count 409 transition count 852
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 597 place count 408 transition count 844
Iterating global reduction 7 with 1 rules applied. Total rules applied 598 place count 408 transition count 844
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 599 place count 407 transition count 836
Iterating global reduction 7 with 1 rules applied. Total rules applied 600 place count 407 transition count 836
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 601 place count 406 transition count 828
Iterating global reduction 7 with 1 rules applied. Total rules applied 602 place count 406 transition count 828
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 603 place count 405 transition count 820
Iterating global reduction 7 with 1 rules applied. Total rules applied 604 place count 405 transition count 820
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 605 place count 404 transition count 812
Iterating global reduction 7 with 1 rules applied. Total rules applied 606 place count 404 transition count 812
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 682 place count 366 transition count 774
Applied a total of 682 rules in 148 ms. Remains 366 /727 variables (removed 361) and now considering 774/1195 (removed 421) transitions.
// Phase 1: matrix 774 rows 366 cols
[2025-05-30 01:56:33] [INFO ] Computed 52 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:33] [INFO ] Implicit Places using invariants in 299 ms returned [72, 89, 95, 100, 160, 194, 203, 255, 272, 278, 283, 285, 314, 343, 363]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 301 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/727 places, 774/1195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 772
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 349 transition count 772
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 349 transition count 768
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 345 transition count 768
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 339 transition count 762
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 339 transition count 762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 334 transition count 757
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 334 transition count 757
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 331 transition count 754
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 331 transition count 754
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 330 transition count 753
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 330 transition count 753
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 66 place count 318 transition count 741
Applied a total of 66 rules in 78 ms. Remains 318 /351 variables (removed 33) and now considering 741/774 (removed 33) transitions.
// Phase 1: matrix 741 rows 318 cols
[2025-05-30 01:56:34] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:34] [INFO ] Implicit Places using invariants in 237 ms returned [164, 170, 175]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 246 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 315/727 places, 741/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 313 transition count 739
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 313 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 311 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 311 transition count 737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 310 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 310 transition count 736
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 309 transition count 735
Applied a total of 12 rules in 115 ms. Remains 309 /315 variables (removed 6) and now considering 735/741 (removed 6) transitions.
// Phase 1: matrix 735 rows 309 cols
[2025-05-30 01:56:34] [INFO ] Computed 34 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:34] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 01:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:35] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 309/727 places, 735/1195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1602 ms. Remains : 309/727 places, 735/1195 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-01
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-03a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-01 finished in 1707 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(G(p0)))'
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 726 transition count 1187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 726 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 725 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 725 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 724 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 724 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 723 transition count 1163
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 723 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 722 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 722 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 721 transition count 1147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 721 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 720 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 720 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 719 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 719 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 718 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 718 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 717 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 717 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 716 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 716 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 715 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 715 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 714 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 714 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 713 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 713 transition count 1083
Applied a total of 28 rules in 180 ms. Remains 713 /727 variables (removed 14) and now considering 1083/1195 (removed 112) transitions.
// Phase 1: matrix 1083 rows 713 cols
[2025-05-30 01:56:35] [INFO ] Computed 96 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:35] [INFO ] Implicit Places using invariants in 421 ms returned [391, 590, 611, 634]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 424 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 709/727 places, 1083/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 707 transition count 1081
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 707 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 705 transition count 1079
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 705 transition count 1079
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 703 transition count 1077
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 703 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 702 transition count 1076
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 702 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 701 transition count 1075
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 701 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 700 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 700 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 699 transition count 1073
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 699 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 698 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 698 transition count 1072
Applied a total of 22 rules in 111 ms. Remains 698 /709 variables (removed 11) and now considering 1072/1083 (removed 11) transitions.
// Phase 1: matrix 1072 rows 698 cols
[2025-05-30 01:56:35] [INFO ] Computed 92 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:36] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-05-30 01:56:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:37] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 698/727 places, 1072/1195 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2229 ms. Remains : 698/727 places, 1072/1195 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 38624 steps with 345 reset in 90 ms.
FORMULA ASLink-PT-03a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-03 finished in 2415 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' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(!p2)&&(p0 U (p1||G(p0)))))))'
Support contains 5 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 726 transition count 1187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 726 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 725 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 725 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 724 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 724 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 723 transition count 1163
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 723 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 722 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 722 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 721 transition count 1147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 721 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 720 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 720 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 719 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 719 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 718 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 718 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 717 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 717 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 716 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 716 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 715 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 715 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 714 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 714 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 713 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 713 transition count 1083
Applied a total of 28 rules in 159 ms. Remains 713 /727 variables (removed 14) and now considering 1083/1195 (removed 112) transitions.
// Phase 1: matrix 1083 rows 713 cols
[2025-05-30 01:56:37] [INFO ] Computed 96 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:38] [INFO ] Implicit Places using invariants in 436 ms returned [391, 611, 634]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 448 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 710/727 places, 1083/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 708 transition count 1081
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 708 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 706 transition count 1079
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 706 transition count 1079
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 704 transition count 1077
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 704 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 703 transition count 1076
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 703 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 702 transition count 1075
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 702 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 701 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 701 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 700 transition count 1073
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 700 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 699 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 699 transition count 1072
Applied a total of 22 rules in 101 ms. Remains 699 /710 variables (removed 11) and now considering 1072/1083 (removed 11) transitions.
// Phase 1: matrix 1072 rows 699 cols
[2025-05-30 01:56:38] [INFO ] Computed 93 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:38] [INFO ] Implicit Places using invariants in 450 ms returned []
[2025-05-30 01:56:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:39] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 699/727 places, 1072/1195 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2229 ms. Remains : 699/727 places, 1072/1195 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-05
Product exploration explored 100000 steps with 921 reset in 241 ms.
Product exploration explored 100000 steps with 924 reset in 279 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 p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (OR (AND p0 p2) (AND p1 p2))), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X p0)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 134 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 9 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (344 resets) in 248 ms. (160 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40002 steps (74 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (85 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (81 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (71 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
[2025-05-30 01:56:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 301/361 variables, 21/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 338/699 variables, 68/93 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1771 variables, 699/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1771 variables, 0/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1771 variables, 0/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1771/1771 variables, and 792 constraints, problems are : Problem set: 2 solved, 3 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 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: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 301/361 variables, 21/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf8 is UNSAT
At refinement iteration 5 (OVERLAPS) 338/699 variables, 68/93 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1771 variables, 699/792 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1771/1771 variables, and 794 constraints, problems are : Problem set: 3 solved, 2 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3168ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1072/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 699 transition count 941
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 568 transition count 941
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 262 place count 568 transition count 852
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 468 place count 451 transition count 852
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 484 place count 444 transition count 843
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 493 place count 435 transition count 843
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 493 place count 435 transition count 832
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 515 place count 424 transition count 832
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 520 place count 419 transition count 827
Iterating global reduction 4 with 5 rules applied. Total rules applied 525 place count 419 transition count 827
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 529 place count 419 transition count 823
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 418 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 530 place count 418 transition count 822
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 532 place count 417 transition count 822
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 606 place count 380 transition count 785
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 609 place count 380 transition count 782
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 612 place count 377 transition count 782
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 624 place count 377 transition count 770
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 637 place count 364 transition count 770
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 640 place count 364 transition count 767
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 650 place count 364 transition count 767
Applied a total of 650 rules in 97 ms. Remains 364 /699 variables (removed 335) and now considering 767/1072 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 364/699 places, 767/1072 transitions.
RANDOM walk for 40000 steps (660 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (193 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (191 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 48122 steps, run visited all 2 properties in 377 ms. (steps per millisecond=127 )
Probabilistic random walk after 48122 steps, saw 26886 distinct states, run finished after 380 ms. (steps per millisecond=126 ) properties seen :2
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (OR (AND p0 p2) (AND p1 p2))), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X p0)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p2 (NOT p1))))]
Knowledge based reduction with 20 factoid took 551 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), true, (AND (NOT p0) p2), (NOT p0), false, false, false]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), true, (AND (NOT p0) p2), (NOT p0), false, false, false]
Support contains 5 out of 699 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 699/699 places, 1072/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 699 transition count 943
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 258 place count 570 transition count 943
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 258 place count 570 transition count 854
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 464 place count 453 transition count 854
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 480 place count 446 transition count 845
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 489 place count 437 transition count 845
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 489 place count 437 transition count 834
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 511 place count 426 transition count 834
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 516 place count 421 transition count 829
Iterating global reduction 4 with 5 rules applied. Total rules applied 521 place count 421 transition count 829
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 525 place count 421 transition count 825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 526 place count 420 transition count 825
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 526 place count 420 transition count 824
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 528 place count 419 transition count 824
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 600 place count 383 transition count 788
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 383 transition count 788
Applied a total of 601 rules in 67 ms. Remains 383 /699 variables (removed 316) and now considering 788/1072 (removed 284) transitions.
// Phase 1: matrix 788 rows 383 cols
[2025-05-30 01:56:46] [INFO ] Computed 58 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:46] [INFO ] Implicit Places using invariants in 260 ms returned [90, 96, 101, 117, 190, 196, 204, 220, 290, 296, 301, 320, 380]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 262 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 370/699 places, 788/1072 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 370 transition count 787
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 369 transition count 787
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 369 transition count 781
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 363 transition count 781
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 358 transition count 776
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 358 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 353 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 353 transition count 771
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 351 transition count 769
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 351 transition count 769
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 345 transition count 763
Applied a total of 50 rules in 35 ms. Remains 345 /370 variables (removed 25) and now considering 763/788 (removed 25) transitions.
// Phase 1: matrix 763 rows 345 cols
[2025-05-30 01:56:46] [INFO ] Computed 45 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:46] [INFO ] Implicit Places using invariants in 240 ms returned [93, 96, 186, 189, 270, 273]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 241 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 339/699 places, 763/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 339 transition count 760
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 336 transition count 760
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 333 transition count 757
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 333 transition count 757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 333 transition count 754
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 332 transition count 753
Applied a total of 17 rules in 24 ms. Remains 332 /339 variables (removed 7) and now considering 753/763 (removed 10) transitions.
// Phase 1: matrix 753 rows 332 cols
[2025-05-30 01:56:46] [INFO ] Computed 39 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:47] [INFO ] Implicit Places using invariants in 230 ms returned [72, 151, 240]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 231 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 329/699 places, 753/1072 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 326 transition count 750
Applied a total of 6 rules in 14 ms. Remains 326 /329 variables (removed 3) and now considering 750/753 (removed 3) transitions.
// Phase 1: matrix 750 rows 326 cols
[2025-05-30 01:56:47] [INFO ] Computed 36 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:47] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 01:56:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 01:56:47] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 326/699 places, 750/1072 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1701 ms. Remains : 326/699 places, 750/1072 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 p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 99 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), true, (AND (NOT p0) p2), (NOT p0), false, false, false]
RANDOM walk for 40000 steps (702 resets) in 190 ms. (209 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40002 steps (228 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (205 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (225 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
[2025-05-30 01:56:48] [INFO ] Invariant cache hit.
[2025-05-30 01:56:48] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 74/87 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 236/323 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/326 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 750/1076 variables, 326/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1076 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1076 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1076 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1076/1076 variables, and 365 constraints, problems are : Problem set: 0 solved, 3 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, ReadFeed: 3/3 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 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 74/87 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 5 (OVERLAPS) 236/323 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/326 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 750/1076 variables, 326/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1076 variables, 3/365 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1076 variables, 2/367 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1076 variables, and 367 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2760 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3147ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 326 transition count 748
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 324 transition count 748
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 323 transition count 747
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 323 transition count 736
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 31 place count 312 transition count 733
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 39 place count 312 transition count 725
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 47 place count 304 transition count 725
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 304 transition count 725
Applied a total of 49 rules in 50 ms. Remains 304 /326 variables (removed 22) and now considering 725/750 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 304/326 places, 725/750 transitions.
RANDOM walk for 40000 steps (827 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (270 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (272 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4811 steps, run visited all 2 properties in 52 ms. (steps per millisecond=92 )
Probabilistic random walk after 4811 steps, saw 2595 distinct states, run finished after 53 ms. (steps per millisecond=90 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 p1)))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F p1), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 22 factoid took 359 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), true, (AND (NOT p0) p2), (NOT p0), false, false, false]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), true, (AND (NOT p0) p2), (NOT p0), false, false, false]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), true, (AND (NOT p0) p2), (NOT p0), false, false, false]
Product exploration explored 100000 steps with 1774 reset in 193 ms.
Product exploration explored 100000 steps with 1879 reset in 209 ms.
Built C files in :
/tmp/ltsmin10242353796522034314
[2025-05-30 01:56:53] [INFO ] Computing symmetric may disable matrix : 750 transitions.
[2025-05-30 01:56:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:56:53] [INFO ] Computing symmetric may enable matrix : 750 transitions.
[2025-05-30 01:56:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:56:53] [INFO ] Computing Do-Not-Accords matrix : 750 transitions.
[2025-05-30 01:56:53] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:56:53] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10242353796522034314
Running compilation step : cd /tmp/ltsmin10242353796522034314;'/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 1997 ms.
Running link step : cd /tmp/ltsmin10242353796522034314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin10242353796522034314;'/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' '--hoa' '/tmp/stateBased5956291712725769646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 326/326 places, 750/750 transitions.
Applied a total of 0 rules in 13 ms. Remains 326 /326 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2025-05-30 01:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:08] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-30 01:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 01:57:09] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:57:09] [INFO ] Redundant transitions in 89 ms returned []
Running 749 sub problems to find dead transitions.
[2025-05-30 01:57:09] [INFO ] Invariant cache hit.
[2025-05-30 01:57:09] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:57:29] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:57:30] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/1076 variables, and 38 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/326 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 6 (OVERLAPS) 750/1076 variables, 326/364 constraints. Problems are: Problem set: 169 solved, 580 unsolved
SMT process timed out in 60228ms, After SMT, problems are : Problem set: 169 solved, 580 unsolved
Search for dead transitions found 169 dead transitions in 60232ms
Found 169 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 169 transitions
Dead transitions reduction (with SMT) removed 169 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 326/326 places, 581/750 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 318 transition count 581
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 318 transition count 573
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 24 place count 310 transition count 573
Applied a total of 24 rules in 9 ms. Remains 310 /326 variables (removed 16) and now considering 573/581 (removed 8) transitions.
// Phase 1: matrix 573 rows 310 cols
[2025-05-30 01:58:09] [INFO ] Computed 35 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:09] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 01:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 01:58:10] [INFO ] Implicit Places using invariants and state equation in 597 ms returned [62, 63, 64, 65, 66, 67, 68, 69]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 838 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 302/326 places, 573/750 transitions.
Applied a total of 0 rules in 11 ms. Remains 302 /302 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 62001 ms. Remains : 302/326 places, 573/750 transitions.
Built C files in :
/tmp/ltsmin9896571612588070102
[2025-05-30 01:58:10] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2025-05-30 01:58:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:58:10] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2025-05-30 01:58:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:58:10] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2025-05-30 01:58:10] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:58:10] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9896571612588070102
Running compilation step : cd /tmp/ltsmin9896571612588070102;'/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 1312 ms.
Running link step : cd /tmp/ltsmin9896571612588070102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9896571612588070102;'/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' '--hoa' '/tmp/stateBased13022344643946654711.hoa' '--buchi-type=spotba'
LTSmin run took 8798 ms.
FORMULA ASLink-PT-03a-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03a-LTLCardinality-05 finished in 103277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 726 transition count 1187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 726 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 725 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 725 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 724 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 724 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 723 transition count 1163
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 723 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 722 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 722 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 721 transition count 1147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 721 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 720 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 720 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 719 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 719 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 718 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 718 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 717 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 717 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 716 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 716 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 715 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 715 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 714 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 714 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 713 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 713 transition count 1083
Applied a total of 28 rules in 153 ms. Remains 713 /727 variables (removed 14) and now considering 1083/1195 (removed 112) transitions.
// Phase 1: matrix 1083 rows 713 cols
[2025-05-30 01:58:21] [INFO ] Computed 96 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:21] [INFO ] Implicit Places using invariants in 462 ms returned [590, 611, 634]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 463 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 710/727 places, 1083/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 708 transition count 1081
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 708 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 706 transition count 1079
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 706 transition count 1079
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 704 transition count 1077
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 704 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 703 transition count 1076
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 703 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 702 transition count 1075
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 702 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 701 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 701 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 700 transition count 1073
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 700 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 699 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 699 transition count 1072
Applied a total of 22 rules in 95 ms. Remains 699 /710 variables (removed 11) and now considering 1072/1083 (removed 11) transitions.
// Phase 1: matrix 1072 rows 699 cols
[2025-05-30 01:58:21] [INFO ] Computed 93 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:22] [INFO ] Implicit Places using invariants in 438 ms returned []
[2025-05-30 01:58:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:23] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 699/727 places, 1072/1195 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2304 ms. Remains : 699/727 places, 1072/1195 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-07 finished in 2475 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(p1) U p2)&&F(p3)&&p0)))'
Support contains 8 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 726 transition count 1187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 726 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 725 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 725 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 724 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 724 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 723 transition count 1163
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 723 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 722 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 722 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 721 transition count 1147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 721 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 720 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 720 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 719 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 719 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 718 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 718 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 717 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 717 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 716 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 716 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 715 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 715 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 714 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 714 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 713 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 713 transition count 1083
Applied a total of 28 rules in 150 ms. Remains 713 /727 variables (removed 14) and now considering 1083/1195 (removed 112) transitions.
// Phase 1: matrix 1083 rows 713 cols
[2025-05-30 01:58:23] [INFO ] Computed 96 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:23] [INFO ] Implicit Places using invariants in 439 ms returned [391, 590, 611]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 440 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 710/727 places, 1083/1195 transitions.
Applied a total of 0 rules in 13 ms. Remains 710 /710 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 604 ms. Remains : 710/727 places, 1083/1195 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-09 finished in 864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 726 transition count 1187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 726 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 725 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 725 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 724 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 724 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 723 transition count 1163
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 723 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 722 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 722 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 721 transition count 1147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 721 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 720 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 720 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 719 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 719 transition count 1131
Applied a total of 16 rules in 99 ms. Remains 719 /727 variables (removed 8) and now considering 1131/1195 (removed 64) transitions.
// Phase 1: matrix 1131 rows 719 cols
[2025-05-30 01:58:24] [INFO ] Computed 96 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:24] [INFO ] Implicit Places using invariants in 466 ms returned [391, 596, 617, 640]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 467 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 715/727 places, 1131/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 713 transition count 1129
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 713 transition count 1129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 711 transition count 1127
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 711 transition count 1127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 709 transition count 1125
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 709 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 708 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 708 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 707 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 707 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 706 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 706 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 705 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 705 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 704 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 704 transition count 1120
Applied a total of 22 rules in 90 ms. Remains 704 /715 variables (removed 11) and now considering 1120/1131 (removed 11) transitions.
// Phase 1: matrix 1120 rows 704 cols
[2025-05-30 01:58:24] [INFO ] Computed 92 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:25] [INFO ] Implicit Places using invariants in 427 ms returned []
[2025-05-30 01:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:26] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 704/727 places, 1120/1195 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2285 ms. Remains : 704/727 places, 1120/1195 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 275 ms.
Product exploration explored 100000 steps with 25000 reset in 296 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2668 steps (18 resets) in 16 ms. (156 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1120/1120 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2025-05-30 01:58:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:28] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-05-30 01:58:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:29] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
Running 1119 sub problems to find dead transitions.
[2025-05-30 01: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/703 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1824 variables, and 64 constraints, problems are : Problem set: 0 solved, 1119 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 1119/1119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 2 (OVERLAPS) 1/704 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/1824 variables, and 92 constraints, problems are : Problem set: 0 solved, 1119 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 0/1119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 1119 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in LTL mode , in 1 iterations and 61987 ms. Remains : 704/704 places, 1120/1120 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2406 steps (17 resets) in 11 ms. (200 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 302 ms.
Product exploration explored 100000 steps with 25000 reset in 317 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 1120/1120 transitions.
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 704 transition count 1120
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 132 place count 704 transition count 1137
Deduced a syphon composed of 182 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 182 place count 704 transition count 1137
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 188 place count 701 transition count 1137
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 211 place count 678 transition count 1114
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 234 place count 678 transition count 1114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 234 place count 678 transition count 1114
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 678 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 677 transition count 1113
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 677 transition count 1113
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 251 places in 1 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 324 place count 677 transition count 1124
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 366 place count 635 transition count 1082
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 408 place count 635 transition count 1082
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 635 transition count 1110
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 413 place count 635 transition count 1114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 415 place count 633 transition count 1108
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 417 place count 633 transition count 1108
Deduced a syphon composed of 212 places in 0 ms
Applied a total of 417 rules in 174 ms. Remains 633 /704 variables (removed 71) and now considering 1108/1120 (removed 12) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:59:31] [INFO ] Redundant transitions in 26 ms returned []
Running 1107 sub problems to find dead transitions.
// Phase 1: matrix 1108 rows 633 cols
[2025-05-30 01:59:31] [INFO ] Computed 89 invariants in 8 ms
[2025-05-30 01:59:31] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1741 variables, and 61 constraints, problems are : Problem set: 0 solved, 1107 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 61/65 constraints, State Equation: 0/633 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 1107/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1107 unsolved
At refinement iteration 2 (OVERLAPS) 1/633 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 1107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/633 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:22] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 15 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:22] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 20 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:23] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 13 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:23] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 27 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:23] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:23] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 13 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:23] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 14 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 14 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 11 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 12 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 7 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:24] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:25] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 9 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:25] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 21 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:25] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 9 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:25] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:26] [INFO ] Deduced a trap composed of 70 places in 259 ms of which 56 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 20/109 constraints. Problems are: Problem set: 213 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:28] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(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 1)
(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 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(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 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(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 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(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 0)
(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 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(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 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/1741 variables, and 110 constraints, problems are : Problem set: 214 solved, 893 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 0/633 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1107 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 214 solved, 893 unsolved
Search for dead transitions found 214 dead transitions in 60315ms
Found 214 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 214 transitions
Dead transitions reduction (with SMT) removed 214 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 633/704 places, 894/1120 transitions.
Graph (complete) has 2302 edges and 633 vertex of which 474 are kept as prefixes of interest. Removing 159 places using SCC suffix rule.2 ms
Discarding 159 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 894
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 458 transition count 898
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 3 rules in 23 ms. Remains 458 /633 variables (removed 175) and now considering 898/894 (removed -4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 458/704 places, 898/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60550 ms. Remains : 458/704 places, 898/1120 transitions.
Built C files in :
/tmp/ltsmin1612346786913087233
[2025-05-30 02:00:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1612346786913087233
Running compilation step : cd /tmp/ltsmin1612346786913087233;'/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 1878 ms.
Running link step : cd /tmp/ltsmin1612346786913087233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1612346786913087233;'/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/stateBased11364415200123345674.hoa' '--buchi-type=spotba'
LTSmin run took 2176 ms.
FORMULA ASLink-PT-03a-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03a-LTLCardinality-10 finished in 132097 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((F(p1)||p0))))'
Support contains 4 out of 727 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 726 transition count 1060
Reduce places removed 137 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 273 place count 589 transition count 1058
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 275 place count 587 transition count 1058
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 275 place count 587 transition count 969
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 481 place count 470 transition count 969
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 21 rules applied. Total rules applied 502 place count 460 transition count 958
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 12 rules applied. Total rules applied 514 place count 449 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 515 place count 448 transition count 957
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 515 place count 448 transition count 948
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 533 place count 439 transition count 948
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 540 place count 432 transition count 934
Iterating global reduction 6 with 7 rules applied. Total rules applied 547 place count 432 transition count 934
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 552 place count 432 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 553 place count 431 transition count 929
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 553 place count 431 transition count 928
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 555 place count 430 transition count 928
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 429 transition count 920
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 429 transition count 920
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 558 place count 428 transition count 912
Iterating global reduction 8 with 1 rules applied. Total rules applied 559 place count 428 transition count 912
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 560 place count 427 transition count 904
Iterating global reduction 8 with 1 rules applied. Total rules applied 561 place count 427 transition count 904
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 562 place count 426 transition count 896
Iterating global reduction 8 with 1 rules applied. Total rules applied 563 place count 426 transition count 896
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 425 transition count 888
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 425 transition count 888
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 566 place count 424 transition count 880
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 424 transition count 880
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 568 place count 423 transition count 872
Iterating global reduction 8 with 1 rules applied. Total rules applied 569 place count 423 transition count 872
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 570 place count 422 transition count 864
Iterating global reduction 8 with 1 rules applied. Total rules applied 571 place count 422 transition count 864
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 572 place count 421 transition count 856
Iterating global reduction 8 with 1 rules applied. Total rules applied 573 place count 421 transition count 856
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 574 place count 420 transition count 848
Iterating global reduction 8 with 1 rules applied. Total rules applied 575 place count 420 transition count 848
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 576 place count 419 transition count 840
Iterating global reduction 8 with 1 rules applied. Total rules applied 577 place count 419 transition count 840
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 578 place count 418 transition count 832
Iterating global reduction 8 with 1 rules applied. Total rules applied 579 place count 418 transition count 832
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 580 place count 417 transition count 824
Iterating global reduction 8 with 1 rules applied. Total rules applied 581 place count 417 transition count 824
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 659 place count 378 transition count 785
Applied a total of 659 rules in 136 ms. Remains 378 /727 variables (removed 349) and now considering 785/1195 (removed 410) transitions.
// Phase 1: matrix 785 rows 378 cols
[2025-05-30 02:00:36] [INFO ] Computed 55 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:36] [INFO ] Implicit Places using invariants in 269 ms returned [72, 89, 95, 100, 159, 185, 196, 205, 275, 281, 286, 324, 353, 375]
[2025-05-30 02:00:36] [INFO ] Actually due to overlaps returned [324, 205, 196, 72, 89, 95, 100, 159, 275, 281, 286, 353, 375]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 270 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 365/727 places, 785/1195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 783
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 363 transition count 783
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 363 transition count 779
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 359 transition count 779
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 353 transition count 773
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 353 transition count 773
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 348 transition count 768
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 348 transition count 768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 345 transition count 765
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 345 transition count 765
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 344 transition count 764
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 344 transition count 764
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 333 transition count 753
Applied a total of 64 rules in 40 ms. Remains 333 /365 variables (removed 32) and now considering 753/785 (removed 32) transitions.
// Phase 1: matrix 753 rows 333 cols
[2025-05-30 02:00:36] [INFO ] Computed 42 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:36] [INFO ] Implicit Places using invariants in 227 ms returned [163, 169, 177]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 228 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 330/727 places, 753/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 329 transition count 752
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 329 transition count 752
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 328 transition count 751
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 328 transition count 751
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 6 place count 327 transition count 750
Applied a total of 6 rules in 30 ms. Remains 327 /330 variables (removed 3) and now considering 750/753 (removed 3) transitions.
// Phase 1: matrix 750 rows 327 cols
[2025-05-30 02:00:37] [INFO ] Computed 39 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:37] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-30 02:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:37] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 327/727 places, 750/1195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1519 ms. Remains : 327/727 places, 750/1195 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 1666 reset in 177 ms.
Product exploration explored 100000 steps with 1588 reset in 170 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (662 resets) in 182 ms. (218 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (179 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (181 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2025-05-30 02:00:38] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/234 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/263 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/327 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 750/1077 variables, 327/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1077 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1077 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/234 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/263 variables, 4/25 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 02:00:39] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/327 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 750/1077 variables, 327/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1077 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1077 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1077 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 369 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2022ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 209 ms.
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 750/750 transitions.
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 738
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 26 place count 315 transition count 736
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 315 transition count 727
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 44 place count 306 transition count 727
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 306 transition count 726
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 306 transition count 726
Applied a total of 47 rules in 50 ms. Remains 306 /327 variables (removed 21) and now considering 726/750 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 306/327 places, 726/750 transitions.
RANDOM walk for 40000 steps (739 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (242 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 141117 steps, run visited all 1 properties in 581 ms. (steps per millisecond=242 )
Probabilistic random walk after 141117 steps, saw 42246 distinct states, run finished after 581 ms. (steps per millisecond=242 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 750/750 transitions.
Applied a total of 0 rules in 11 ms. Remains 327 /327 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2025-05-30 02:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:42] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-30 02:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:42] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:00:42] [INFO ] Redundant transitions in 20 ms returned []
Running 728 sub problems to find dead transitions.
[2025-05-30 02: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/326 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (OVERLAPS) 1/327 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:05] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 728 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 327/1077 variables, and 40 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (OVERLAPS) 1/327 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 7 (OVERLAPS) 750/1077 variables, 327/367 constraints. Problems are: Problem set: 165 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 930 constraints, problems are : Problem set: 165 solved, 563 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 563/728 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 165 solved, 563 unsolved
Search for dead transitions found 165 dead transitions in 60241ms
Found 165 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 165 transitions
Dead transitions reduction (with SMT) removed 165 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 327/327 places, 585/750 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 312 transition count 570
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 297 transition count 570
Applied a total of 30 rules in 8 ms. Remains 297 /327 variables (removed 30) and now considering 570/585 (removed 15) transitions.
// Phase 1: matrix 570 rows 297 cols
[2025-05-30 02:01:43] [INFO ] Computed 38 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:43] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-05-30 02:01:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:43] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [64, 65, 66, 67, 68, 69]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 622 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 291/327 places, 570/750 transitions.
Applied a total of 0 rules in 6 ms. Remains 291 /291 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61663 ms. Remains : 291/327 places, 570/750 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (653 resets) in 116 ms. (341 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (164 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (182 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
// Phase 1: matrix 570 rows 291 cols
[2025-05-30 02:01:44] [INFO ] Computed 36 invariants in 3 ms
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 157/203 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/226 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 39/265 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 519/784 variables, 265/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 72/856 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/856 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/856 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/861 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/861 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/861 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 327 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 157/203 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/226 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 39/265 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 519/784 variables, 265/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 72/856 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/856 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/856 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/856 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/861 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/861 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/861 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 329 constraints, problems are : Problem set: 0 solved, 2 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 570/570 transitions.
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 291 transition count 558
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 26 place count 279 transition count 556
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 279 transition count 547
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 44 place count 270 transition count 547
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 270 transition count 546
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 270 transition count 546
Applied a total of 47 rules in 31 ms. Remains 270 /291 variables (removed 21) and now considering 546/570 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 270/291 places, 546/570 transitions.
RANDOM walk for 40000 steps (763 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (256 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (199 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 141027 steps, run visited all 2 properties in 686 ms. (steps per millisecond=205 )
Probabilistic random walk after 141027 steps, saw 42186 distinct states, run finished after 686 ms. (steps per millisecond=205 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1652 reset in 163 ms.
Product exploration explored 100000 steps with 1579 reset in 166 ms.
Built C files in :
/tmp/ltsmin7999217612848437921
[2025-05-30 02:01:46] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2025-05-30 02:01:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:01:46] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2025-05-30 02:01:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:01:46] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2025-05-30 02:01:46] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:01:46] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7999217612848437921
Running compilation step : cd /tmp/ltsmin7999217612848437921;'/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 1310 ms.
Running link step : cd /tmp/ltsmin7999217612848437921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7999217612848437921;'/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' '--hoa' '/tmp/stateBased10652903255452424042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 570/570 transitions.
Applied a total of 0 rules in 11 ms. Remains 291 /291 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2025-05-30 02:02:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:01] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-30 02:02:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:02] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:02:02] [INFO ] Redundant transitions in 4 ms returned []
Running 548 sub problems to find dead transitions.
[2025-05-30 02:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:16] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
At refinement iteration 7 (OVERLAPS) 570/861 variables, 291/328 constraints. Problems are: Problem set: 43 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 861/861 variables, and 328 constraints, problems are : Problem set: 43 solved, 505 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 505 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 8/8 constraints. Problems are: Problem set: 43 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 23/31 constraints. Problems are: Problem set: 43 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/31 constraints. Problems are: Problem set: 43 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 3/34 constraints. Problems are: Problem set: 43 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 2/36 constraints. Problems are: Problem set: 43 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 1/37 constraints. Problems are: Problem set: 43 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/37 constraints. Problems are: Problem set: 43 solved, 505 unsolved
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 7 (OVERLAPS) 570/861 variables, 291/328 constraints. Problems are: Problem set: 155 solved, 393 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 393/721 constraints. Problems are: Problem set: 158 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/861 variables, and 721 constraints, problems are : Problem set: 158 solved, 390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 393/548 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 158 solved, 390 unsolved
Search for dead transitions found 158 dead transitions in 60146ms
Found 158 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 158 transitions
Dead transitions reduction (with SMT) removed 158 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 291/291 places, 412/570 transitions.
Ensure Unique test removed 15 places
Discarding 1 places :
Implicit places reduction removed 1 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 0 with 22 rules applied. Total rules applied 22 place count 275 transition count 391
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 254 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 254 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 253 transition count 390
Applied a total of 45 rules in 9 ms. Remains 253 /291 variables (removed 38) and now considering 390/412 (removed 22) transitions.
// Phase 1: matrix 390 rows 253 cols
[2025-05-30 02:03:02] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:02] [INFO ] Implicit Places using invariants in 154 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/291 places, 390/570 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 60998 ms. Remains : 252/291 places, 390/570 transitions.
Built C files in :
/tmp/ltsmin8786224313204922985
[2025-05-30 02:03:02] [INFO ] Computing symmetric may disable matrix : 390 transitions.
[2025-05-30 02:03:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:03:02] [INFO ] Computing symmetric may enable matrix : 390 transitions.
[2025-05-30 02:03:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:03:02] [INFO ] Computing Do-Not-Accords matrix : 390 transitions.
[2025-05-30 02:03:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:03:02] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8786224313204922985
Running compilation step : cd /tmp/ltsmin8786224313204922985;'/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 835 ms.
Running link step : cd /tmp/ltsmin8786224313204922985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8786224313204922985;'/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' '--hoa' '/tmp/stateBased10252429102139204996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 02:03:17] [INFO ] Flatten gal took : 21 ms
[2025-05-30 02:03:17] [INFO ] Flatten gal took : 21 ms
[2025-05-30 02:03:17] [INFO ] Time to serialize gal into /tmp/LTL10268458176733812897.gal : 4 ms
[2025-05-30 02:03:17] [INFO ] Time to serialize properties into /tmp/LTL3682475332974525802.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10268458176733812897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1088278052698175419.hoa' '-atoms' '/tmp/LTL3682475332974525802.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3682475332974525802.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1088278052698175419.hoa
Detected timeout of ITS tools.
[2025-05-30 02:03:33] [INFO ] Flatten gal took : 24 ms
[2025-05-30 02:03:33] [INFO ] Flatten gal took : 24 ms
[2025-05-30 02:03:33] [INFO ] Time to serialize gal into /tmp/LTL11846250666070232381.gal : 15 ms
[2025-05-30 02:03:33] [INFO ] Time to serialize properties into /tmp/LTL1271449568528124826.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11846250666070232381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1271449568528124826.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(("((p78==0)||(p362==1))")||(F("((p788==0)||(p614==1))"))))))
Formula 0 simplified : G(F!"((p78==0)||(p362==1))" & FG!"((p788==0)||(p614==1))")
Detected timeout of ITS tools.
[2025-05-30 02:03:48] [INFO ] Flatten gal took : 22 ms
[2025-05-30 02:03:48] [INFO ] Applying decomposition
[2025-05-30 02:03:48] [INFO ] Flatten gal took : 22 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/graph866328107540061484.txt' '-o' '/tmp/graph866328107540061484.bin' '-w' '/tmp/graph866328107540061484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph866328107540061484.bin' '-l' '-1' '-v' '-w' '/tmp/graph866328107540061484.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:03:48] [INFO ] Decomposing Gal with order
[2025-05-30 02:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:03:48] [INFO ] Removed a total of 978 redundant transitions.
[2025-05-30 02:03:48] [INFO ] Flatten gal took : 76 ms
[2025-05-30 02:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 14 ms.
[2025-05-30 02:03:48] [INFO ] Time to serialize gal into /tmp/LTL1043413367014536293.gal : 6 ms
[2025-05-30 02:03:48] [INFO ] Time to serialize properties into /tmp/LTL6630940749345561818.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/LTL1043413367014536293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6630940749345561818.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 : !((F(G(("((i0.u17.p78==0)||(i2.u30.p362==1))")||(F("((u63.p788==0)||(i4.u49.p614==1))"))))))
Formula 0 simplified : G(F!"((i0.u17.p78==0)||(i2.u30.p362==1))" & FG!"((u63.p788==0)||(i4.u49.p614==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03a-LTLCardinality-12 finished in 207175 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))))'
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 726 transition count 1187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 726 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 725 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 725 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 724 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 724 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 723 transition count 1163
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 723 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 722 transition count 1155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 722 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 721 transition count 1147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 721 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 720 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 720 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 719 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 719 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 718 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 718 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 717 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 717 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 716 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 716 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 715 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 715 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 714 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 714 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 713 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 713 transition count 1083
Applied a total of 28 rules in 201 ms. Remains 713 /727 variables (removed 14) and now considering 1083/1195 (removed 112) transitions.
// Phase 1: matrix 1083 rows 713 cols
[2025-05-30 02:04:03] [INFO ] Computed 96 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:04] [INFO ] Implicit Places using invariants in 510 ms returned [391, 590, 611, 634]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 511 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 709/727 places, 1083/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 707 transition count 1081
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 707 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 705 transition count 1079
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 705 transition count 1079
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 703 transition count 1077
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 703 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 702 transition count 1076
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 702 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 701 transition count 1075
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 701 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 700 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 700 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 699 transition count 1073
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 699 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 698 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 698 transition count 1072
Applied a total of 22 rules in 114 ms. Remains 698 /709 variables (removed 11) and now considering 1072/1083 (removed 11) transitions.
// Phase 1: matrix 1072 rows 698 cols
[2025-05-30 02:04:04] [INFO ] Computed 92 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:04] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-05-30 02:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:05] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 698/727 places, 1072/1195 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2382 ms. Remains : 698/727 places, 1072/1195 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-13
Product exploration explored 100000 steps with 861 reset in 192 ms.
Product exploration explored 100000 steps with 850 reset in 194 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (359 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (81 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 479866 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 479866 steps, saw 172451 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2025-05-30 02:04:09] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1770 variables, 698/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1770/1770 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 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 02:04:10] [INFO ] Deduced a trap composed of 91 places in 298 ms of which 65 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1072/1770 variables, 698/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1770/1770 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1897 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2289ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 941
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 567 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 566 transition count 940
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 264 place count 566 transition count 850
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 473 place count 447 transition count 850
Discarding 7 places :
Implicit places reduction removed 7 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 16 rules applied. Total rules applied 489 place count 440 transition count 841
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 498 place count 431 transition count 841
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 498 place count 431 transition count 829
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 522 place count 419 transition count 829
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 527 place count 414 transition count 824
Iterating global reduction 5 with 5 rules applied. Total rules applied 532 place count 414 transition count 824
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 536 place count 414 transition count 820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 537 place count 413 transition count 820
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 537 place count 413 transition count 819
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 539 place count 412 transition count 819
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 623 place count 370 transition count 777
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 626 place count 370 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 629 place count 367 transition count 774
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 641 place count 367 transition count 762
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 654 place count 354 transition count 762
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 657 place count 354 transition count 759
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 666 place count 354 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 667 place count 353 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 670 place count 350 transition count 758
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 670 place count 350 transition count 752
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 15 rules applied. Total rules applied 685 place count 341 transition count 752
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 688 place count 338 transition count 749
Iterating global reduction 10 with 3 rules applied. Total rules applied 691 place count 338 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 694 place count 338 transition count 746
Applied a total of 694 rules in 110 ms. Remains 338 /698 variables (removed 360) and now considering 746/1072 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 338/698 places, 746/1072 transitions.
RANDOM walk for 40000 steps (794 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (232 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 716 steps, run visited all 1 properties in 5 ms. (steps per millisecond=143 )
Probabilistic random walk after 716 steps, saw 657 distinct states, run finished after 5 ms. (steps per millisecond=143 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Applied a total of 0 rules in 17 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2025-05-30 02:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:12] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-05-30 02:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:14] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2025-05-30 02:04:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 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 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.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 16.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 8.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 18.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 7.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 2.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 3.0)
(s201 1.0)
(s202 2.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 16.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 11.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 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 6.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 10.0)
(s349 1.0)
(s350 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1770 variables, and 64 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 64/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 2 (OVERLAPS) 1/698 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/698 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1071 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 698/1770 variables, and 92 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in LTL mode , in 1 iterations and 61782 ms. Remains : 698/698 places, 1072/1072 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (352 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (65 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 484063 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 484063 steps, saw 174028 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2025-05-30 02:05:17] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1770 variables, 698/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1770/1770 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 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 02:05:18] [INFO ] Deduced a trap composed of 91 places in 284 ms of which 64 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1072/1770 variables, 698/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1770/1770 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2293ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 941
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 567 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 566 transition count 940
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 264 place count 566 transition count 850
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 473 place count 447 transition count 850
Discarding 7 places :
Implicit places reduction removed 7 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 16 rules applied. Total rules applied 489 place count 440 transition count 841
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 498 place count 431 transition count 841
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 498 place count 431 transition count 829
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 522 place count 419 transition count 829
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 527 place count 414 transition count 824
Iterating global reduction 5 with 5 rules applied. Total rules applied 532 place count 414 transition count 824
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 536 place count 414 transition count 820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 537 place count 413 transition count 820
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 537 place count 413 transition count 819
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 539 place count 412 transition count 819
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 623 place count 370 transition count 777
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 626 place count 370 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 629 place count 367 transition count 774
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 641 place count 367 transition count 762
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 654 place count 354 transition count 762
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 657 place count 354 transition count 759
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 666 place count 354 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 667 place count 353 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 670 place count 350 transition count 758
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 670 place count 350 transition count 752
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 15 rules applied. Total rules applied 685 place count 341 transition count 752
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 688 place count 338 transition count 749
Iterating global reduction 10 with 3 rules applied. Total rules applied 691 place count 338 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 694 place count 338 transition count 746
Applied a total of 694 rules in 97 ms. Remains 338 /698 variables (removed 360) and now considering 746/1072 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 338/698 places, 746/1072 transitions.
RANDOM walk for 40000 steps (796 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (230 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 716 steps, run visited all 1 properties in 5 ms. (steps per millisecond=143 )
Probabilistic random walk after 716 steps, saw 657 distinct states, run finished after 5 ms. (steps per millisecond=143 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 890 reset in 181 ms.
Product exploration explored 100000 steps with 872 reset in 208 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 1072
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 131 place count 698 transition count 1089
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 181 place count 698 transition count 1089
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 187 place count 695 transition count 1089
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 210 place count 672 transition count 1066
Deduced a syphon composed of 163 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 233 place count 672 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 233 place count 672 transition count 1066
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 672 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 671 transition count 1065
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 671 transition count 1065
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 251 places in 1 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 324 place count 671 transition count 1077
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 366 place count 629 transition count 1035
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 408 place count 629 transition count 1035
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 629 transition count 1063
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 413 place count 629 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 415 place count 627 transition count 1061
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 417 place count 627 transition count 1061
Deduced a syphon composed of 212 places in 1 ms
Applied a total of 417 rules in 104 ms. Remains 627 /698 variables (removed 71) and now considering 1061/1072 (removed 11) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:05:21] [INFO ] Redundant transitions in 16 ms returned []
Running 1060 sub problems to find dead transitions.
// Phase 1: matrix 1061 rows 627 cols
[2025-05-30 02:05:21] [INFO ] Computed 89 invariants in 12 ms
[2025-05-30 02:05:21] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 2 (OVERLAPS) 1/627 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1688 variables, and 89 constraints, problems are : Problem set: 0 solved, 1060 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 0/627 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 1060/1060 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1060 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 2 (OVERLAPS) 1/627 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:11] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 20 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:11] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 16 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:11] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 21 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:12] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:12] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 29 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:12] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:12] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:13] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 15 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:13] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 15 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:13] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 17 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:13] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 12 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:13] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 12 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:13] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 12 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:14] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 7 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:14] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 8 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:14] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 9 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:14] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 19 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:14] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 20 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:14] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 10 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:15] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 54 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/109 constraints. Problems are: Problem set: 211 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:17] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1688 variables, and 110 constraints, problems are : Problem set: 212 solved, 848 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 0/627 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1060 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 212 solved, 848 unsolved
Search for dead transitions found 212 dead transitions in 60305ms
Found 212 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 212 transitions
Dead transitions reduction (with SMT) removed 212 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 627/698 places, 849/1072 transitions.
Graph (complete) has 2212 edges and 627 vertex of which 471 are kept as prefixes of interest. Removing 156 places using SCC suffix rule.1 ms
Discarding 156 places :
Also discarding 0 output transitions
Ensure Unique test removed 13 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 849
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 458 transition count 853
Deduced a syphon composed of 58 places in 1 ms
Applied a total of 3 rules in 20 ms. Remains 458 /627 variables (removed 169) and now considering 853/849 (removed -4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 458/698 places, 853/1072 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60455 ms. Remains : 458/698 places, 853/1072 transitions.
Built C files in :
/tmp/ltsmin16955542714591833444
[2025-05-30 02:06:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16955542714591833444
Running compilation step : cd /tmp/ltsmin16955542714591833444;'/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 1815 ms.
Running link step : cd /tmp/ltsmin16955542714591833444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16955542714591833444;'/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/stateBased1303916956396012732.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Applied a total of 0 rules in 23 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
// Phase 1: matrix 1072 rows 698 cols
[2025-05-30 02:06:36] [INFO ] Computed 92 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:06:37] [INFO ] Implicit Places using invariants in 404 ms returned []
[2025-05-30 02:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:06:38] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2025-05-30 02:06:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1770 variables, and 64 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 64/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 2 (OVERLAPS) 1/698 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/698 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/1770 variables, and 92 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in LTL mode , in 1 iterations and 61896 ms. Remains : 698/698 places, 1072/1072 transitions.
Built C files in :
/tmp/ltsmin15411336486531742512
[2025-05-30 02:07:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15411336486531742512
Running compilation step : cd /tmp/ltsmin15411336486531742512;'/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 1826 ms.
Running link step : cd /tmp/ltsmin15411336486531742512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15411336486531742512;'/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/stateBased610060207351035442.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 02:07:53] [INFO ] Flatten gal took : 33 ms
[2025-05-30 02:07:53] [INFO ] Flatten gal took : 31 ms
[2025-05-30 02:07:53] [INFO ] Time to serialize gal into /tmp/LTL6496783209030923312.gal : 5 ms
[2025-05-30 02:07:53] [INFO ] Time to serialize properties into /tmp/LTL1596133947228792030.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/LTL6496783209030923312.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2953071565838214095.hoa' '-atoms' '/tmp/LTL1596133947228792030.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/LTL1596133947228792030.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2953071565838214095.hoa
Detected timeout of ITS tools.
[2025-05-30 02:08:09] [INFO ] Flatten gal took : 30 ms
[2025-05-30 02:08:09] [INFO ] Flatten gal took : 30 ms
[2025-05-30 02:08:09] [INFO ] Time to serialize gal into /tmp/LTL4375900190280824997.gal : 5 ms
[2025-05-30 02:08:09] [INFO ] Time to serialize properties into /tmp/LTL13560461633702277902.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/LTL4375900190280824997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13560461633702277902.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 : !((X(X(G("((p49==0)||(p367==1))")))))
Formula 0 simplified : XXF!"((p49==0)||(p367==1))"
Detected timeout of ITS tools.
[2025-05-30 02:08:24] [INFO ] Flatten gal took : 30 ms
[2025-05-30 02:08:24] [INFO ] Applying decomposition
[2025-05-30 02:08:24] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14500713148076072234.txt' '-o' '/tmp/graph14500713148076072234.bin' '-w' '/tmp/graph14500713148076072234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14500713148076072234.bin' '-l' '-1' '-v' '-w' '/tmp/graph14500713148076072234.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:08:24] [INFO ] Decomposing Gal with order
[2025-05-30 02:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:08:24] [INFO ] Removed a total of 1503 redundant transitions.
[2025-05-30 02:08:24] [INFO ] Flatten gal took : 74 ms
[2025-05-30 02:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 18 ms.
[2025-05-30 02:08:24] [INFO ] Time to serialize gal into /tmp/LTL2099725047000156600.gal : 8 ms
[2025-05-30 02:08:24] [INFO ] Time to serialize properties into /tmp/LTL6697815702993702487.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/LTL2099725047000156600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6697815702993702487.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("((i5.u17.p49==0)||(i6.i2.u107.p367==1))")))))
Formula 0 simplified : XXF!"((i5.u17.p49==0)||(i6.i2.u107.p367==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03a-LTLCardinality-13 finished in 276109 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((F(p1)||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))))'
Found a Lengthening insensitive property : ASLink-PT-03a-LTLCardinality-13
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 727 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 727/727 places, 1195/1195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 726 transition count 1060
Reduce places removed 138 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 141 rules applied. Total rules applied 275 place count 588 transition count 1057
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 279 place count 585 transition count 1056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 584 transition count 1056
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 92 Pre rules applied. Total rules applied 280 place count 584 transition count 964
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 213 rules applied. Total rules applied 493 place count 463 transition count 964
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 26 rules applied. Total rules applied 519 place count 452 transition count 949
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 534 place count 437 transition count 949
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 534 place count 437 transition count 940
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 552 place count 428 transition count 940
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 561 place count 419 transition count 924
Iterating global reduction 6 with 9 rules applied. Total rules applied 570 place count 419 transition count 924
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 577 place count 419 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 578 place count 418 transition count 917
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 578 place count 418 transition count 916
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 580 place count 417 transition count 916
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 581 place count 416 transition count 908
Iterating global reduction 8 with 1 rules applied. Total rules applied 582 place count 416 transition count 908
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 583 place count 415 transition count 900
Iterating global reduction 8 with 1 rules applied. Total rules applied 584 place count 415 transition count 900
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 585 place count 414 transition count 892
Iterating global reduction 8 with 1 rules applied. Total rules applied 586 place count 414 transition count 892
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 587 place count 413 transition count 884
Iterating global reduction 8 with 1 rules applied. Total rules applied 588 place count 413 transition count 884
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 589 place count 412 transition count 876
Iterating global reduction 8 with 1 rules applied. Total rules applied 590 place count 412 transition count 876
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 591 place count 411 transition count 868
Iterating global reduction 8 with 1 rules applied. Total rules applied 592 place count 411 transition count 868
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 593 place count 410 transition count 860
Iterating global reduction 8 with 1 rules applied. Total rules applied 594 place count 410 transition count 860
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 595 place count 409 transition count 852
Iterating global reduction 8 with 1 rules applied. Total rules applied 596 place count 409 transition count 852
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 597 place count 408 transition count 844
Iterating global reduction 8 with 1 rules applied. Total rules applied 598 place count 408 transition count 844
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 599 place count 407 transition count 836
Iterating global reduction 8 with 1 rules applied. Total rules applied 600 place count 407 transition count 836
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 601 place count 406 transition count 828
Iterating global reduction 8 with 1 rules applied. Total rules applied 602 place count 406 transition count 828
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 603 place count 405 transition count 820
Iterating global reduction 8 with 1 rules applied. Total rules applied 604 place count 405 transition count 820
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 605 place count 404 transition count 812
Iterating global reduction 8 with 1 rules applied. Total rules applied 606 place count 404 transition count 812
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 682 place count 366 transition count 774
Applied a total of 682 rules in 139 ms. Remains 366 /727 variables (removed 361) and now considering 774/1195 (removed 421) transitions.
// Phase 1: matrix 774 rows 366 cols
[2025-05-30 02:08:40] [INFO ] Computed 52 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:40] [INFO ] Implicit Places using invariants in 263 ms returned [72, 89, 95, 100, 159, 194, 203, 255, 272, 278, 283, 285, 314, 343, 363]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 264 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 351/727 places, 774/1195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 772
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 349 transition count 772
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 349 transition count 768
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 345 transition count 768
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 339 transition count 762
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 339 transition count 762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 334 transition count 757
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 334 transition count 757
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 331 transition count 754
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 331 transition count 754
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 330 transition count 753
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 330 transition count 753
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 318 transition count 741
Applied a total of 66 rules in 37 ms. Remains 318 /351 variables (removed 33) and now considering 741/774 (removed 33) transitions.
// Phase 1: matrix 741 rows 318 cols
[2025-05-30 02:08:40] [INFO ] Computed 37 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:40] [INFO ] Implicit Places using invariants in 215 ms returned [163, 169, 175]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 216 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 315/727 places, 741/1195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 313 transition count 739
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 313 transition count 739
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 312 transition count 738
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 312 transition count 738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 311 transition count 737
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 311 transition count 737
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 10 place count 310 transition count 736
Applied a total of 10 rules in 25 ms. Remains 310 /315 variables (removed 5) and now considering 736/741 (removed 5) transitions.
// Phase 1: matrix 736 rows 310 cols
[2025-05-30 02:08:40] [INFO ] Computed 34 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:40] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-05-30 02:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:41] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 310/727 places, 736/1195 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1395 ms. Remains : 310/727 places, 736/1195 transitions.
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-13
Product exploration explored 100000 steps with 1768 reset in 156 ms.
Product exploration explored 100000 steps with 1839 reset in 175 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (735 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (231 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 32542 steps, run visited all 1 properties in 172 ms. (steps per millisecond=189 )
Probabilistic random walk after 32542 steps, saw 20075 distinct states, run finished after 172 ms. (steps per millisecond=189 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 736/736 transitions.
Applied a total of 0 rules in 5 ms. Remains 310 /310 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2025-05-30 02:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:42] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-30 02:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:43] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2025-05-30 02:08:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:09:04] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/1046 variables, and 35 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 7 (OVERLAPS) 736/1046 variables, 310/345 constraints. Problems are: Problem set: 230 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 830 constraints, problems are : Problem set: 230 solved, 485 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 485/715 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 230 solved, 485 unsolved
Search for dead transitions found 230 dead transitions in 60208ms
Found 230 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 230 transitions
Dead transitions reduction (with SMT) removed 230 transitions
Starting structural reductions in LTL mode, iteration 1 : 310/310 places, 506/736 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 294 transition count 506
Applied a total of 16 rules in 3 ms. Remains 294 /310 variables (removed 16) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 294 cols
[2025-05-30 02:09:43] [INFO ] Computed 32 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:09:43] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-30 02:09:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:09:44] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [1, 3, 5, 7, 9, 11, 13, 55, 56, 57, 58, 59, 60, 61, 90, 92, 94, 96, 98, 100, 102, 123, 124, 203, 204, 205, 206, 207, 208, 209]
[2025-05-30 02:09:44] [INFO ] Actually due to overlaps returned [1, 3, 5, 7, 9, 11, 13, 90, 92, 94, 96, 98, 100, 102, 123, 124]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 626 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 278/310 places, 506/736 transitions.
Applied a total of 0 rules in 3 ms. Remains 278 /278 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61560 ms. Remains : 278/310 places, 506/736 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (721 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (243 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 32542 steps, run visited all 1 properties in 133 ms. (steps per millisecond=244 )
Probabilistic random walk after 32542 steps, saw 20075 distinct states, run finished after 133 ms. (steps per millisecond=244 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1820 reset in 163 ms.
Entered a terminal (fully accepting) state of product in 19045 steps with 358 reset in 31 ms.
Treatment of property ASLink-PT-03a-LTLCardinality-13 finished in 65317 ms.
FORMULA ASLink-PT-03a-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-30 02:09:45] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6397890947033650654
[2025-05-30 02:09:45] [INFO ] Applying decomposition
[2025-05-30 02:09:45] [INFO ] Computing symmetric may disable matrix : 1195 transitions.
[2025-05-30 02:09:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:09:45] [INFO ] Computing symmetric may enable matrix : 1195 transitions.
[2025-05-30 02:09:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:09:45] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1513077688275872745.txt' '-o' '/tmp/graph1513077688275872745.bin' '-w' '/tmp/graph1513077688275872745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1513077688275872745.bin' '-l' '-1' '-v' '-w' '/tmp/graph1513077688275872745.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:09:45] [INFO ] Decomposing Gal with order
[2025-05-30 02:09:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:09:45] [INFO ] Computing Do-Not-Accords matrix : 1195 transitions.
[2025-05-30 02:09:45] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:09:45] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6397890947033650654
Running compilation step : cd /tmp/ltsmin6397890947033650654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 02:09:45] [INFO ] Removed a total of 1802 redundant transitions.
[2025-05-30 02:09:45] [INFO ] Flatten gal took : 92 ms
[2025-05-30 02:09:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 15 ms.
[2025-05-30 02:09:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality5290271348560940696.gal : 9 ms
[2025-05-30 02:09:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality6506759933491452862.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/LTLCardinality5290271348560940696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6506759933491452862.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 1 LTL properties
Checking formula 0 : !((F(G(("((i1.u20.p78==0)||(i7.i0.u103.p362==1))")||(F("((i14.u216.p788==0)||(i11.u175.p614==1))"))))))
Formula 0 simplified : G(F!"((i1.u20.p78==0)||(i7.i0.u103.p362==1))" & FG!"((i14.u216.p788==0)||(i11.u175.p614==1))")
Compilation finished in 3918 ms.
Running link step : cd /tmp/ltsmin6397890947033650654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin6397890947033650654;'/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' '<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t9, t13, t14, t15, t25, t656, t658, t963, t1016, t1039, t1092, t1115,...646
Computing Next relation with stutter on 6.33124e+08 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
33674 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,336.829,2203812,1,0,4.01009e+06,145180,4954,9.07597e+06,771,1.72726e+06,1438785
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-03a-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1664923 ms.

BK_STOP 1748571747537

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-03a"
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-03a, 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-174853729000315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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