Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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.9K 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 417K 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-02b-LTLFireability-00
FORMULA_NAME ASLink-PT-02b-LTLFireability-01
FORMULA_NAME ASLink-PT-02b-LTLFireability-02
FORMULA_NAME ASLink-PT-02b-LTLFireability-03
FORMULA_NAME ASLink-PT-02b-LTLFireability-04
FORMULA_NAME ASLink-PT-02b-LTLFireability-05
FORMULA_NAME ASLink-PT-02b-LTLFireability-06
FORMULA_NAME ASLink-PT-02b-LTLFireability-07
FORMULA_NAME ASLink-PT-02b-LTLFireability-08
FORMULA_NAME ASLink-PT-02b-LTLFireability-09
FORMULA_NAME ASLink-PT-02b-LTLFireability-10
FORMULA_NAME ASLink-PT-02b-LTLFireability-11
FORMULA_NAME ASLink-PT-02b-LTLFireability-12
FORMULA_NAME ASLink-PT-02b-LTLFireability-13
FORMULA_NAME ASLink-PT-02b-LTLFireability-14
FORMULA_NAME ASLink-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748569393315

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 01:43:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 01:43:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:43:14] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-05-30 01:43:14] [INFO ] Transformed 1242 places.
[2025-05-30 01:43:14] [INFO ] Transformed 1621 transitions.
[2025-05-30 01:43:14] [INFO ] Found NUPN structural information;
[2025-05-30 01:43:14] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-02b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 1170 transition count 1549
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 1170 transition count 1549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 145 place count 1170 transition count 1548
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 170 place count 1145 transition count 1513
Iterating global reduction 1 with 25 rules applied. Total rules applied 195 place count 1145 transition count 1513
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 203 place count 1145 transition count 1505
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 1140 transition count 1500
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 1140 transition count 1500
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 216 place count 1137 transition count 1497
Iterating global reduction 2 with 3 rules applied. Total rules applied 219 place count 1137 transition count 1497
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 221 place count 1135 transition count 1495
Iterating global reduction 2 with 2 rules applied. Total rules applied 223 place count 1135 transition count 1495
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 225 place count 1133 transition count 1493
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 1133 transition count 1493
Applied a total of 227 rules in 608 ms. Remains 1133 /1242 variables (removed 109) and now considering 1493/1621 (removed 128) transitions.
// Phase 1: matrix 1493 rows 1133 cols
[2025-05-30 01:43:15] [INFO ] Computed 121 invariants in 65 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:16] [INFO ] Implicit Places using invariants in 995 ms returned [967, 978, 989, 997, 1005, 1013, 1021, 1032, 1040, 1048, 1059]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1122/1242 places, 1493/1621 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1110 transition count 1481
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1110 transition count 1481
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1100 transition count 1471
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1100 transition count 1471
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1092 transition count 1463
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1092 transition count 1463
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1088 transition count 1459
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1088 transition count 1459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1086 transition count 1457
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1086 transition count 1457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1084 transition count 1455
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1084 transition count 1455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1082 transition count 1453
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1082 transition count 1453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1080 transition count 1451
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1080 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1079 transition count 1450
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1079 transition count 1450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1078 transition count 1449
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1078 transition count 1449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1077 transition count 1448
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1077 transition count 1448
Applied a total of 90 rules in 445 ms. Remains 1077 /1122 variables (removed 45) and now considering 1448/1493 (removed 45) transitions.
// Phase 1: matrix 1448 rows 1077 cols
[2025-05-30 01:43:17] [INFO ] Computed 110 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:17] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-05-30 01:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:19] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 2652 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1077/1242 places, 1448/1621 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4756 ms. Remains : 1077/1242 places, 1448/1621 transitions.
Support contains 61 out of 1077 places after structural reductions.
[2025-05-30 01:43:21] [INFO ] Flatten gal took : 127 ms
[2025-05-30 01:43:21] [INFO ] Flatten gal took : 72 ms
[2025-05-30 01:43:21] [INFO ] Input system was already deterministic with 1448 transitions.
Reduction of identical properties reduced properties to check from 44 to 43
RANDOM walk for 40000 steps (160 resets) in 1592 ms. (25 steps per ms) remains 22/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
[2025-05-30 01:43:22] [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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 81/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 219/339 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 5 (OVERLAPS) 721/1060 variables, 76/104 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:24] [INFO ] Deduced a trap composed of 41 places in 1675 ms of which 1393 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:24] [INFO ] Deduced a trap composed of 153 places in 507 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:25] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 51 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 3/107 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:26] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:26] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 51 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1060 variables, 2/109 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2525 variables, and 109 constraints, problems are : Problem set: 1 solved, 21 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 76/82 constraints, State Equation: 0/1077 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 48/83 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 254/337 variables, 25/28 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 723/1060 variables, 76/104 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 5/109 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:28] [INFO ] Deduced a trap composed of 230 places in 579 ms of which 241 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:29] [INFO ] Deduced a trap composed of 117 places in 467 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:29] [INFO ] Deduced a trap composed of 243 places in 573 ms of which 252 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:30] [INFO ] Deduced a trap composed of 225 places in 523 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:30] [INFO ] Deduced a trap composed of 243 places in 510 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:31] [INFO ] Deduced a trap composed of 243 places in 499 ms of which 203 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1060 variables, 6/115 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:32] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2525 variables, and 116 constraints, problems are : Problem set: 1 solved, 21 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 76/82 constraints, State Equation: 0/1077 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10068ms problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 1077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 1077 transition count 1269
Reduce places removed 179 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 184 rules applied. Total rules applied 363 place count 898 transition count 1264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 366 place count 895 transition count 1264
Performed 277 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 277 Pre rules applied. Total rules applied 366 place count 895 transition count 987
Deduced a syphon composed of 277 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 578 rules applied. Total rules applied 944 place count 594 transition count 987
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 962 place count 592 transition count 971
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 978 place count 576 transition count 971
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 978 place count 576 transition count 962
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1005 place count 558 transition count 962
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1005 place count 558 transition count 954
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 1021 place count 550 transition count 954
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1025 place count 546 transition count 942
Iterating global reduction 5 with 4 rules applied. Total rules applied 1029 place count 546 transition count 942
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1029 place count 546 transition count 941
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1031 place count 545 transition count 941
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1033 place count 543 transition count 932
Iterating global reduction 5 with 2 rules applied. Total rules applied 1035 place count 543 transition count 932
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 174 rules applied. Total rules applied 1209 place count 455 transition count 846
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1213 place count 451 transition count 842
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1218 place count 450 transition count 842
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 1219 place count 450 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1220 place count 449 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1220 place count 449 transition count 840
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1222 place count 448 transition count 840
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1224 place count 446 transition count 838
Iterating global reduction 7 with 2 rules applied. Total rules applied 1226 place count 446 transition count 838
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1228 place count 446 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1229 place count 445 transition count 836
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1231 place count 444 transition count 841
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1234 place count 444 transition count 838
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1237 place count 441 transition count 838
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1238 place count 441 transition count 837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1239 place count 440 transition count 837
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1241 place count 440 transition count 837
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1242 place count 439 transition count 836
Reduce places removed 4 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 11 with 6 rules applied. Total rules applied 1248 place count 435 transition count 834
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1250 place count 433 transition count 834
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1250 place count 433 transition count 828
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1263 place count 426 transition count 828
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1266 place count 423 transition count 828
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1266 place count 423 transition count 827
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1268 place count 422 transition count 827
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1278 place count 417 transition count 822
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1280 place count 415 transition count 820
Iterating global reduction 14 with 2 rules applied. Total rules applied 1282 place count 415 transition count 820
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1284 place count 415 transition count 818
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1286 place count 413 transition count 818
Applied a total of 1286 rules in 345 ms. Remains 413 /1077 variables (removed 664) and now considering 818/1448 (removed 630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 413/1077 places, 818/1448 transitions.
RANDOM walk for 40000 steps (550 resets) in 615 ms. (64 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (16 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (16 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (14 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (15 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (13 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (16 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 360444 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 21
Probabilistic random walk after 360444 steps, saw 78494 distinct states, run finished after 3005 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 818 rows 413 cols
[2025-05-30 01:43:35] [INFO ] Computed 64 invariants in 7 ms
[2025-05-30 01:43:35] [INFO ] State equation strengthened by 2 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 45/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 43/123 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 207/330 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 25/355 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:36] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 56/411 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:37] [INFO ] Deduced a trap composed of 86 places in 244 ms of which 52 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:37] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 2/413 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 818/1231 variables, 413/480 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1231 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1231 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 0/1231 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1231/1231 variables, and 482 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3666 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 413/413 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 45/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 43/123 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 207/330 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 25/355 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 56/411 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 2/413 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 15 (OVERLAPS) 818/1231 variables, 413/480 constraints. Problems are: Problem set: 17 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1231 variables, 2/482 constraints. Problems are: Problem set: 17 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1231 variables, 4/486 constraints. Problems are: Problem set: 17 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1231 variables, 0/486 constraints. Problems are: Problem set: 17 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1231 variables, 0/486 constraints. Problems are: Problem set: 17 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1231/1231 variables, and 486 constraints, problems are : Problem set: 17 solved, 4 unsolved in 3174 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 413/413 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/21 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6872ms problems are : Problem set: 17 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 700 ms.
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 818/818 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 413 transition count 817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 817
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 2 place count 412 transition count 802
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 32 place count 397 transition count 802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 396 transition count 794
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 396 transition count 794
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 395 transition count 786
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 395 transition count 786
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 394 transition count 778
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 394 transition count 778
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 393 transition count 770
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 393 transition count 770
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 392 transition count 762
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 392 transition count 762
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 391 transition count 754
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 391 transition count 754
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 390 transition count 746
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 390 transition count 746
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 389 transition count 738
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 389 transition count 738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 388 transition count 730
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 388 transition count 730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 387 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 387 transition count 722
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 2 with 2 rules applied. Total rules applied 54 place count 386 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 385 transition count 720
Applied a total of 55 rules in 122 ms. Remains 385 /413 variables (removed 28) and now considering 720/818 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 385/413 places, 720/818 transitions.
RANDOM walk for 40000 steps (656 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (227 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (218 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (213 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 522306 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 3
Probabilistic random walk after 522306 steps, saw 144868 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
// Phase 1: matrix 720 rows 385 cols
[2025-05-30 01:43:46] [INFO ] Computed 64 invariants in 9 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 161/203 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/250 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/251 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 116/367 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/372 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 13/385 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 720/1105 variables, 385/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1105 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1105 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 449 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 385/385 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 161/203 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/250 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/251 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 116/367 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/372 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 13/385 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 720/1105 variables, 385/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1105 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1105 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1105 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1538ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 682 ms.
Support contains 5 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 720/720 transitions.
Applied a total of 0 rules in 11 ms. Remains 385 /385 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 385/385 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 720/720 transitions.
Applied a total of 0 rules in 11 ms. Remains 385 /385 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2025-05-30 01:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:49] [INFO ] Implicit Places using invariants in 392 ms returned [1, 18, 19, 31, 48, 67, 138, 143, 152, 153, 155, 172, 190, 259, 263, 264, 267, 278, 279, 280, 303, 324, 325, 326, 327]
[2025-05-30 01:43:49] [INFO ] Actually due to overlaps returned [303, 280, 48, 172, 31, 155, 152, 278, 324, 153, 279, 325, 1, 18, 263, 264, 67, 190, 326, 19, 267, 327]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 394 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 363/385 places, 720/720 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 361 transition count 680
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 47 rules applied. Total rules applied 89 place count 321 transition count 673
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 316 transition count 673
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 94 place count 316 transition count 658
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 125 place count 300 transition count 658
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 137 place count 296 transition count 650
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 145 place count 288 transition count 650
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 148 place count 285 transition count 647
Iterating global reduction 5 with 3 rules applied. Total rules applied 151 place count 285 transition count 647
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 154 place count 285 transition count 644
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 190 place count 267 transition count 626
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 192 place count 265 transition count 624
Iterating global reduction 6 with 2 rules applied. Total rules applied 194 place count 265 transition count 624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 265 transition count 623
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 199 place count 263 transition count 624
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 204 place count 263 transition count 619
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 210 place count 257 transition count 619
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 211 place count 257 transition count 618
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 214 place count 257 transition count 618
Applied a total of 214 rules in 69 ms. Remains 257 /363 variables (removed 106) and now considering 618/720 (removed 102) transitions.
// Phase 1: matrix 618 rows 257 cols
[2025-05-30 01:43:49] [INFO ] Computed 34 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:49] [INFO ] Implicit Places using invariants in 244 ms returned [74, 91, 97, 102, 104, 107, 108, 161, 177, 183, 186, 188]
[2025-05-30 01:43:49] [INFO ] Actually due to overlaps returned [107, 108, 177, 183, 188, 74, 91, 97, 102, 104, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 247 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 246/385 places, 618/720 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 240 transition count 612
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 240 transition count 612
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 237 transition count 609
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 237 transition count 609
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 233 transition count 605
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 233 transition count 599
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 227 transition count 599
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 227 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 226 transition count 598
Applied a total of 40 rules in 49 ms. Remains 226 /246 variables (removed 20) and now considering 598/618 (removed 20) transitions.
// Phase 1: matrix 598 rows 226 cols
[2025-05-30 01:43:49] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:49] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-30 01:43:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:50] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/385 places, 598/720 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1453 ms. Remains : 226/385 places, 598/720 transitions.
RANDOM walk for 40000 steps (994 resets) in 112 ms. (353 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (369 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 30879 steps (300 resets) in 80 ms. (381 steps per ms) remains 0/2 properties
FORMULA ASLink-PT-02b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-02b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 19 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-02b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 41 stable transitions
FORMULA ASLink-PT-02b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((p0 U (G(p0)||(p0&&(p1||F((G(F(p2))||(p1&&F(p2))))))))))||(p3&&F((p0 U (G(p0)||(p0&&(p1||F((G(F(p2))||(p1&&F(p2))))))))))))))'
Support contains 4 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1073 transition count 1436
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1073 transition count 1436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1071 transition count 1434
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1071 transition count 1434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1069 transition count 1425
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1069 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 1067 transition count 1423
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1067 transition count 1423
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1065 transition count 1414
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1065 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1064 transition count 1406
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1064 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1063 transition count 1405
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1063 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1062 transition count 1397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1062 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1061 transition count 1389
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1061 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1060 transition count 1388
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1060 transition count 1388
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1059 transition count 1380
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1059 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1058 transition count 1372
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1058 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1057 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1057 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1056 transition count 1363
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1056 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1055 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1055 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1054 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1054 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1053 transition count 1346
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1053 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1052 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1052 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1051 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1051 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1050 transition count 1329
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1050 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1049 transition count 1321
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1049 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1048 transition count 1320
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1048 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1047 transition count 1312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1047 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1046 transition count 1304
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1046 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1045 transition count 1303
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1045 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1044 transition count 1295
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1044 transition count 1295
Applied a total of 66 rules in 807 ms. Remains 1044 /1077 variables (removed 33) and now considering 1295/1448 (removed 153) transitions.
// Phase 1: matrix 1295 rows 1044 cols
[2025-05-30 01:43:51] [INFO ] Computed 110 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:52] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-05-30 01:43:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:54] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
Running 1294 sub problems to find dead transitions.
[2025-05-30 01:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1043 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1043/2339 variables, and 63 constraints, problems are : Problem set: 0 solved, 1294 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 63/80 constraints, State Equation: 0/1044 constraints, PredecessorRefiner: 1294/1294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1043 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 13)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 3)
(s45 1)
(s46 6)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 10)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 1)
(s113 1)
(s114 0)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 9)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 5)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 1)
(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 1)
(s267 1)
(s268 1)
(s269 1)
(s270 0)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 0)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 0)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 1)
(s305 1)
(s306 0)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 0)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 0)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 0)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 0)
(s348 1)
(s349 1)
(s350 1)
(s351 0)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 4)
(s359 1)
(s360 1)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 31)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 5)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 5)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 2)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 4)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 101)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 0)
(s451 1)
(s452 1)
(s453 1)
(s454 0)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1043/2339 variables, and 63 constraints, problems are : Problem set: 0 solved, 1294 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 63/80 constraints, State Equation: 0/1044 constraints, PredecessorRefiner: 0/1294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 1294 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in LTL mode, iteration 1 : 1044/1077 places, 1295/1448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63747 ms. Remains : 1044/1077 places, 1295/1448 transitions.
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 321 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 p1 p2), (X (NOT (AND (NOT p1) p0 p3))), (X p3), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 33 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02b-LTLFireability-00 finished in 64986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1076 transition count 1261
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 191 rules applied. Total rules applied 377 place count 890 transition count 1256
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 380 place count 887 transition count 1256
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 289 Pre rules applied. Total rules applied 380 place count 887 transition count 967
Deduced a syphon composed of 289 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 602 rules applied. Total rules applied 982 place count 574 transition count 967
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 1000 place count 572 transition count 951
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1016 place count 556 transition count 951
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1016 place count 556 transition count 942
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1043 place count 538 transition count 942
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1043 place count 538 transition count 934
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1059 place count 530 transition count 934
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1063 place count 526 transition count 922
Iterating global reduction 5 with 4 rules applied. Total rules applied 1067 place count 526 transition count 922
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1067 place count 526 transition count 921
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1069 place count 525 transition count 921
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1071 place count 523 transition count 912
Iterating global reduction 5 with 2 rules applied. Total rules applied 1073 place count 523 transition count 912
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1074 place count 522 transition count 904
Iterating global reduction 5 with 1 rules applied. Total rules applied 1075 place count 522 transition count 904
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1076 place count 521 transition count 896
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 521 transition count 896
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1078 place count 520 transition count 888
Iterating global reduction 5 with 1 rules applied. Total rules applied 1079 place count 520 transition count 888
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1080 place count 519 transition count 880
Iterating global reduction 5 with 1 rules applied. Total rules applied 1081 place count 519 transition count 880
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1082 place count 518 transition count 872
Iterating global reduction 5 with 1 rules applied. Total rules applied 1083 place count 518 transition count 872
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1084 place count 517 transition count 864
Iterating global reduction 5 with 1 rules applied. Total rules applied 1085 place count 517 transition count 864
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1086 place count 516 transition count 856
Iterating global reduction 5 with 1 rules applied. Total rules applied 1087 place count 516 transition count 856
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1088 place count 515 transition count 848
Iterating global reduction 5 with 1 rules applied. Total rules applied 1089 place count 515 transition count 848
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1090 place count 514 transition count 840
Iterating global reduction 5 with 1 rules applied. Total rules applied 1091 place count 514 transition count 840
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1092 place count 513 transition count 832
Iterating global reduction 5 with 1 rules applied. Total rules applied 1093 place count 513 transition count 832
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1094 place count 512 transition count 824
Iterating global reduction 5 with 1 rules applied. Total rules applied 1095 place count 512 transition count 824
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1096 place count 511 transition count 816
Iterating global reduction 5 with 1 rules applied. Total rules applied 1097 place count 511 transition count 816
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1098 place count 510 transition count 808
Iterating global reduction 5 with 1 rules applied. Total rules applied 1099 place count 510 transition count 808
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1100 place count 509 transition count 800
Iterating global reduction 5 with 1 rules applied. Total rules applied 1101 place count 509 transition count 800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1102 place count 508 transition count 792
Iterating global reduction 5 with 1 rules applied. Total rules applied 1103 place count 508 transition count 792
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 174 rules applied. Total rules applied 1277 place count 420 transition count 706
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1281 place count 416 transition count 702
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1286 place count 415 transition count 702
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 1287 place count 415 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1288 place count 414 transition count 701
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1288 place count 414 transition count 700
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 1290 place count 413 transition count 700
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1292 place count 411 transition count 698
Iterating global reduction 7 with 2 rules applied. Total rules applied 1294 place count 411 transition count 698
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1296 place count 411 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1297 place count 410 transition count 696
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1299 place count 409 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1301 place count 407 transition count 699
Reduce places removed 4 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 9 with 6 rules applied. Total rules applied 1307 place count 403 transition count 697
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1309 place count 401 transition count 697
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1309 place count 401 transition count 691
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1322 place count 394 transition count 691
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1327 place count 389 transition count 691
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1327 place count 389 transition count 690
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1329 place count 388 transition count 690
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1343 place count 381 transition count 683
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1347 place count 377 transition count 679
Iterating global reduction 12 with 4 rules applied. Total rules applied 1351 place count 377 transition count 679
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1353 place count 375 transition count 677
Iterating global reduction 12 with 2 rules applied. Total rules applied 1355 place count 375 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1357 place count 375 transition count 675
Applied a total of 1357 rules in 452 ms. Remains 375 /1077 variables (removed 702) and now considering 675/1448 (removed 773) transitions.
// Phase 1: matrix 675 rows 375 cols
[2025-05-30 01:44:56] [INFO ] Computed 62 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:56] [INFO ] Implicit Places using invariants in 349 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 206, 257, 258, 261, 272, 273, 274, 292, 313, 314, 315, 316]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 350 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/1077 places, 675/1448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 350 transition count 632
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 307 transition count 632
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 86 place count 307 transition count 617
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 117 place count 291 transition count 617
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 287 transition count 609
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 137 place count 279 transition count 609
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 276 transition count 606
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 276 transition count 606
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 276 transition count 603
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 186 place count 256 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 254 transition count 584
Applied a total of 190 rules in 26 ms. Remains 254 /350 variables (removed 96) and now considering 584/675 (removed 91) transitions.
// Phase 1: matrix 584 rows 254 cols
[2025-05-30 01:44:56] [INFO ] Computed 32 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:56] [INFO ] Implicit Places using invariants in 236 ms returned [88, 94, 99, 175, 181, 186, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 239 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/1077 places, 584/1448 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 247 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 246 transition count 583
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 243 transition count 580
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 243 transition count 580
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 240 transition count 577
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 240 transition count 577
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 238 transition count 575
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 238 transition count 575
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 2 with 4 rules applied. Total rules applied 22 place count 236 transition count 573
Applied a total of 22 rules in 28 ms. Remains 236 /247 variables (removed 11) and now considering 573/584 (removed 11) transitions.
// Phase 1: matrix 573 rows 236 cols
[2025-05-30 01:44:57] [INFO ] Computed 25 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:57] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-30 01:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:57] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 236/1077 places, 573/1448 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1653 ms. Remains : 236/1077 places, 573/1448 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-01
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLFireability-01 finished in 1713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(p1) U p2))))'
Support contains 3 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1071 transition count 1434
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1071 transition count 1434
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1068 transition count 1431
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1068 transition count 1431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1068 transition count 1430
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1066 transition count 1421
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1066 transition count 1421
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1064 transition count 1419
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1064 transition count 1419
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1062 transition count 1410
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1062 transition count 1410
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1061 transition count 1402
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1061 transition count 1402
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1060 transition count 1401
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1060 transition count 1401
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1059 transition count 1393
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1059 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1058 transition count 1385
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1041 transition count 1291
Applied a total of 73 rules in 859 ms. Remains 1041 /1077 variables (removed 36) and now considering 1291/1448 (removed 157) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2025-05-30 01:44:58] [INFO ] Computed 110 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:59] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-05-30 01:44:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:45:01] [INFO ] Implicit Places using invariants and state equation in 2339 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2025-05-30 01:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1077 places, 1291/1448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64130 ms. Remains : 1041/1077 places, 1291/1448 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLFireability-02 finished in 64398 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(G(p0)))))'
Support contains 1 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1071 transition count 1434
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1071 transition count 1434
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1068 transition count 1431
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1068 transition count 1431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1068 transition count 1430
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1066 transition count 1421
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1066 transition count 1421
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1064 transition count 1419
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1064 transition count 1419
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1062 transition count 1410
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1062 transition count 1410
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1061 transition count 1402
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1061 transition count 1402
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1060 transition count 1401
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1060 transition count 1401
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1059 transition count 1393
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1059 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1058 transition count 1385
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1041 transition count 1291
Applied a total of 73 rules in 854 ms. Remains 1041 /1077 variables (removed 36) and now considering 1291/1448 (removed 157) transitions.
[2025-05-30 01:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:46:03] [INFO ] Implicit Places using invariants in 552 ms returned []
[2025-05-30 01:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:46:05] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 2887 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2025-05-30 01:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1077 places, 1291/1448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64007 ms. Remains : 1041/1077 places, 1291/1448 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLFireability-07 finished in 64174 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 (F(p1) U p2)) U X((p3 U p4))))'
Support contains 6 out of 1077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1073 transition count 1444
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1073 transition count 1444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1072 transition count 1443
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1072 transition count 1443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 1072 transition count 1442
Applied a total of 11 rules in 97 ms. Remains 1072 /1077 variables (removed 5) and now considering 1442/1448 (removed 6) transitions.
// Phase 1: matrix 1442 rows 1072 cols
[2025-05-30 01:47:06] [INFO ] Computed 110 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:47:06] [INFO ] Implicit Places using invariants in 608 ms returned []
[2025-05-30 01:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:47:10] [INFO ] Implicit Places using invariants and state equation in 3476 ms returned []
Implicit Place search using SMT with State Equation took 4086 ms to find 0 implicit places.
Running 1441 sub problems to find dead transitions.
[2025-05-30 01:47:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1071 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1071/2514 variables, and 66 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 66/82 constraints, State Equation: 0/1072 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1071 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1071/2514 variables, and 66 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 66/82 constraints, State Equation: 0/1072 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 1072/1077 places, 1442/1448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64525 ms. Remains : 1072/1077 places, 1442/1448 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p4), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), (NOT p4), (AND (NOT p2) (NOT p3) (NOT p4)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-08
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLFireability-08 finished in 64952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1076 transition count 1260
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 192 rules applied. Total rules applied 379 place count 889 transition count 1255
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 382 place count 886 transition count 1255
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 289 Pre rules applied. Total rules applied 382 place count 886 transition count 966
Deduced a syphon composed of 289 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 602 rules applied. Total rules applied 984 place count 573 transition count 966
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 1002 place count 571 transition count 950
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1018 place count 555 transition count 950
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1018 place count 555 transition count 941
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1045 place count 537 transition count 941
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1045 place count 537 transition count 934
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1059 place count 530 transition count 934
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1062 place count 527 transition count 923
Iterating global reduction 5 with 3 rules applied. Total rules applied 1065 place count 527 transition count 923
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1067 place count 525 transition count 914
Iterating global reduction 5 with 2 rules applied. Total rules applied 1069 place count 525 transition count 914
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1070 place count 524 transition count 906
Iterating global reduction 5 with 1 rules applied. Total rules applied 1071 place count 524 transition count 906
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1072 place count 523 transition count 898
Iterating global reduction 5 with 1 rules applied. Total rules applied 1073 place count 523 transition count 898
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1074 place count 522 transition count 890
Iterating global reduction 5 with 1 rules applied. Total rules applied 1075 place count 522 transition count 890
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1076 place count 521 transition count 882
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 521 transition count 882
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1078 place count 520 transition count 874
Iterating global reduction 5 with 1 rules applied. Total rules applied 1079 place count 520 transition count 874
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1080 place count 519 transition count 866
Iterating global reduction 5 with 1 rules applied. Total rules applied 1081 place count 519 transition count 866
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1082 place count 518 transition count 858
Iterating global reduction 5 with 1 rules applied. Total rules applied 1083 place count 518 transition count 858
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1084 place count 517 transition count 850
Iterating global reduction 5 with 1 rules applied. Total rules applied 1085 place count 517 transition count 850
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1086 place count 516 transition count 842
Iterating global reduction 5 with 1 rules applied. Total rules applied 1087 place count 516 transition count 842
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1088 place count 515 transition count 834
Iterating global reduction 5 with 1 rules applied. Total rules applied 1089 place count 515 transition count 834
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1090 place count 514 transition count 826
Iterating global reduction 5 with 1 rules applied. Total rules applied 1091 place count 514 transition count 826
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1092 place count 513 transition count 818
Iterating global reduction 5 with 1 rules applied. Total rules applied 1093 place count 513 transition count 818
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1094 place count 512 transition count 810
Iterating global reduction 5 with 1 rules applied. Total rules applied 1095 place count 512 transition count 810
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1096 place count 511 transition count 802
Iterating global reduction 5 with 1 rules applied. Total rules applied 1097 place count 511 transition count 802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1098 place count 510 transition count 794
Iterating global reduction 5 with 1 rules applied. Total rules applied 1099 place count 510 transition count 794
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 5 with 176 rules applied. Total rules applied 1275 place count 421 transition count 707
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1279 place count 417 transition count 703
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1284 place count 416 transition count 703
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 1285 place count 416 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1286 place count 415 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1286 place count 415 transition count 701
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 1288 place count 414 transition count 701
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1290 place count 412 transition count 699
Iterating global reduction 7 with 2 rules applied. Total rules applied 1292 place count 412 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1294 place count 412 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1295 place count 411 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1297 place count 410 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1299 place count 408 transition count 700
Reduce places removed 4 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 9 with 6 rules applied. Total rules applied 1305 place count 404 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1307 place count 402 transition count 698
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1307 place count 402 transition count 692
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1320 place count 395 transition count 692
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1325 place count 390 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1325 place count 390 transition count 691
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1327 place count 389 transition count 691
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1341 place count 382 transition count 684
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1345 place count 378 transition count 680
Iterating global reduction 12 with 4 rules applied. Total rules applied 1349 place count 378 transition count 680
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1351 place count 376 transition count 678
Iterating global reduction 12 with 2 rules applied. Total rules applied 1353 place count 376 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1355 place count 376 transition count 676
Applied a total of 1355 rules in 294 ms. Remains 376 /1077 variables (removed 701) and now considering 676/1448 (removed 772) transitions.
// Phase 1: matrix 676 rows 376 cols
[2025-05-30 01:48:11] [INFO ] Computed 62 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:11] [INFO ] Implicit Places using invariants in 359 ms returned [1, 18, 19, 31, 48, 66, 86, 138, 148, 149, 151, 168, 186, 206, 257, 258, 261, 272, 273, 274, 292, 314, 316, 317]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 363 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/1077 places, 676/1448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 352 transition count 638
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 314 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 313 transition count 637
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 78 place count 313 transition count 628
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 96 place count 304 transition count 628
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 144 place count 280 transition count 604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 278 transition count 605
Applied a total of 148 rules in 20 ms. Remains 278 /352 variables (removed 74) and now considering 605/676 (removed 71) transitions.
// Phase 1: matrix 605 rows 278 cols
[2025-05-30 01:48:11] [INFO ] Computed 38 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:12] [INFO ] Implicit Places using invariants in 212 ms returned [88, 101, 176, 182, 187, 253]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 214 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 272/1077 places, 605/1448 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 269 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 269 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 266 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 266 transition count 599
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 265 transition count 598
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 265 transition count 598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 263 transition count 596
Applied a total of 18 rules in 21 ms. Remains 263 /272 variables (removed 9) and now considering 596/605 (removed 9) transitions.
// Phase 1: matrix 596 rows 263 cols
[2025-05-30 01:48:12] [INFO ] Computed 32 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:12] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-30 01:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:12] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 263/1077 places, 596/1448 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1470 ms. Remains : 263/1077 places, 596/1448 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 256 steps with 3 reset in 2 ms.
FORMULA ASLink-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLFireability-14 finished in 1559 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((G(p0)||(p0&&F((p1 U (p2||G(p1)))))))))'
Support contains 4 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 1448/1448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 1076 transition count 1262
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 190 rules applied. Total rules applied 375 place count 891 transition count 1257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 378 place count 888 transition count 1257
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 378 place count 888 transition count 970
Deduced a syphon composed of 287 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 976 place count 577 transition count 970
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 994 place count 575 transition count 954
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1010 place count 559 transition count 954
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1010 place count 559 transition count 945
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1037 place count 541 transition count 945
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1037 place count 541 transition count 937
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 1053 place count 533 transition count 937
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1057 place count 529 transition count 925
Iterating global reduction 5 with 4 rules applied. Total rules applied 1061 place count 529 transition count 925
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1061 place count 529 transition count 924
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1063 place count 528 transition count 924
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1065 place count 526 transition count 915
Iterating global reduction 5 with 2 rules applied. Total rules applied 1067 place count 526 transition count 915
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1068 place count 525 transition count 907
Iterating global reduction 5 with 1 rules applied. Total rules applied 1069 place count 525 transition count 907
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1070 place count 524 transition count 899
Iterating global reduction 5 with 1 rules applied. Total rules applied 1071 place count 524 transition count 899
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1072 place count 523 transition count 891
Iterating global reduction 5 with 1 rules applied. Total rules applied 1073 place count 523 transition count 891
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1074 place count 522 transition count 883
Iterating global reduction 5 with 1 rules applied. Total rules applied 1075 place count 522 transition count 883
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1076 place count 521 transition count 875
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 521 transition count 875
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1078 place count 520 transition count 867
Iterating global reduction 5 with 1 rules applied. Total rules applied 1079 place count 520 transition count 867
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1080 place count 519 transition count 859
Iterating global reduction 5 with 1 rules applied. Total rules applied 1081 place count 519 transition count 859
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1082 place count 518 transition count 851
Iterating global reduction 5 with 1 rules applied. Total rules applied 1083 place count 518 transition count 851
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1084 place count 517 transition count 843
Iterating global reduction 5 with 1 rules applied. Total rules applied 1085 place count 517 transition count 843
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1086 place count 516 transition count 835
Iterating global reduction 5 with 1 rules applied. Total rules applied 1087 place count 516 transition count 835
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 174 rules applied. Total rules applied 1261 place count 428 transition count 749
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1265 place count 424 transition count 745
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1270 place count 423 transition count 745
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 1271 place count 423 transition count 744
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1272 place count 422 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1272 place count 422 transition count 743
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1274 place count 421 transition count 743
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1276 place count 419 transition count 741
Iterating global reduction 7 with 2 rules applied. Total rules applied 1278 place count 419 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1280 place count 419 transition count 739
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1281 place count 418 transition count 739
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1283 place count 417 transition count 744
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1285 place count 415 transition count 742
Reduce places removed 4 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 9 with 6 rules applied. Total rules applied 1291 place count 411 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1293 place count 409 transition count 740
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1293 place count 409 transition count 734
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1306 place count 402 transition count 734
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1311 place count 397 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1311 place count 397 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1313 place count 396 transition count 733
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1327 place count 389 transition count 726
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1331 place count 385 transition count 722
Iterating global reduction 12 with 4 rules applied. Total rules applied 1335 place count 385 transition count 722
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1337 place count 383 transition count 720
Iterating global reduction 12 with 2 rules applied. Total rules applied 1339 place count 383 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1340 place count 383 transition count 719
Applied a total of 1340 rules in 234 ms. Remains 383 /1077 variables (removed 694) and now considering 719/1448 (removed 729) transitions.
// Phase 1: matrix 719 rows 383 cols
[2025-05-30 01:48:12] [INFO ] Computed 62 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:13] [INFO ] Implicit Places using invariants in 273 ms returned [1, 18, 19, 31, 50, 68, 89, 141, 151, 152, 154, 171, 189, 209, 260, 261, 264, 275, 276, 277, 300, 321, 322, 323, 324]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 276 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/1077 places, 719/1448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 358 transition count 677
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 316 transition count 677
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 84 place count 316 transition count 661
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 117 place count 299 transition count 661
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 295 transition count 653
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 137 place count 287 transition count 653
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 284 transition count 650
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 284 transition count 650
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 284 transition count 647
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 186 place count 264 transition count 627
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 262 transition count 628
Applied a total of 190 rules in 35 ms. Remains 262 /358 variables (removed 96) and now considering 628/719 (removed 91) transitions.
// Phase 1: matrix 628 rows 262 cols
[2025-05-30 01:48:13] [INFO ] Computed 32 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:13] [INFO ] Implicit Places using invariants in 176 ms returned [91, 97, 102, 178, 184, 189, 259]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 178 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 255/1077 places, 628/1448 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 255 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 254 transition count 627
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 250 transition count 623
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 250 transition count 623
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 246 transition count 619
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 246 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 244 transition count 617
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 244 transition count 617
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 2 with 4 rules applied. Total rules applied 26 place count 242 transition count 615
Applied a total of 26 rules in 20 ms. Remains 242 /255 variables (removed 13) and now considering 615/628 (removed 13) transitions.
// Phase 1: matrix 615 rows 242 cols
[2025-05-30 01:48:13] [INFO ] Computed 25 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:13] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-30 01:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:13] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 242/1077 places, 615/1448 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1286 ms. Remains : 242/1077 places, 615/1448 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLFireability-15
Product exploration explored 100000 steps with 2541 reset in 187 ms.
Product exploration explored 100000 steps with 2490 reset in 198 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (966 resets) in 362 ms. (110 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (342 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (331 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (347 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
[2025-05-30 01:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/90 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:15] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 123/213 variables, 13/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/242 variables, 5/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 615/857 variables, 242/268 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/857 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/857 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 268 constraints, problems are : Problem set: 2 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/90 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/213 variables, 13/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/242 variables, 5/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 857/857 variables, and 268 constraints, problems are : Problem set: 3 solved, 0 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 292 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 615/615 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2025-05-30 01:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:16] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-30 01:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:16] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:48:16] [INFO ] Redundant transitions in 29 ms returned []
Running 594 sub problems to find dead transitions.
[2025-05-30 01:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:27] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:32] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 8 (OVERLAPS) 1/242 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:44] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 26 ms to minimize.
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 242/857 variables, and 28 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/242 constraints, PredecessorRefiner: 594/594 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 594 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:54] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:55] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 594 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 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 TDEAD29 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 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 TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 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 TDEAD59 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 TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 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 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 TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 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 TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 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 TDEAD163 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 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 TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 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 TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 11 (OVERLAPS) 615/857 variables, 242/272 constraints. Problems are: Problem set: 173 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 693 constraints, problems are : Problem set: 173 solved, 421 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 421/594 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 173 solved, 421 unsolved
Search for dead transitions found 173 dead transitions in 60193ms
Found 173 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 173 transitions
Dead transitions reduction (with SMT) removed 173 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 242/242 places, 442/615 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:49:16] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60795 ms. Remains : 242/242 places, 442/615 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6324 steps (150 resets) in 14 ms. (421 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2563 reset in 130 ms.
Product exploration explored 100000 steps with 2559 reset in 246 ms.
Built C files in :
/tmp/ltsmin6365976818143028668
[2025-05-30 01:49:17] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2025-05-30 01:49:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:49:17] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2025-05-30 01:49:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:49:17] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2025-05-30 01:49:17] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:49:17] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6365976818143028668
Running compilation step : cd /tmp/ltsmin6365976818143028668;'/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 1078 ms.
Running link step : cd /tmp/ltsmin6365976818143028668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6365976818143028668;'/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/stateBased5754801954225616976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 442/442 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 242 transition count 440
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 240 transition count 439
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 239 transition count 437
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 437
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 238 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 238 transition count 429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 237 transition count 427
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 237 transition count 427
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 236 transition count 419
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 236 transition count 419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 235 transition count 418
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 235 transition count 418
Applied a total of 15 rules in 27 ms. Remains 235 /242 variables (removed 7) and now considering 418/442 (removed 24) transitions.
// Phase 1: matrix 418 rows 235 cols
[2025-05-30 01:49:32] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:33] [INFO ] Implicit Places using invariants in 169 ms returned [24, 26, 28, 30, 32, 36, 38, 135, 137, 139, 141, 143, 145, 147]
[2025-05-30 01:49:33] [INFO ] Actually due to overlaps returned [24, 26, 28, 30, 32, 36, 38]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 170 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/242 places, 418/442 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 370
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 370
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 215 transition count 363
Applied a total of 26 rules in 8 ms. Remains 215 /228 variables (removed 13) and now considering 363/418 (removed 55) transitions.
// Phase 1: matrix 363 rows 215 cols
[2025-05-30 01:49:33] [INFO ] Computed 25 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:33] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-30 01:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 01:49:33] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [45, 47, 49, 51, 53, 55, 57, 90, 92, 94, 96, 98, 100, 102]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 542 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 201/242 places, 363/442 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 189 transition count 267
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 189 transition count 267
Applied a total of 24 rules in 6 ms. Remains 189 /201 variables (removed 12) and now considering 267/363 (removed 96) transitions.
// Phase 1: matrix 267 rows 189 cols
[2025-05-30 01:49:33] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 01:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 01:49:33] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 189/242 places, 267/442 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1117 ms. Remains : 189/242 places, 267/442 transitions.
Built C files in :
/tmp/ltsmin17703342988952181221
[2025-05-30 01:49:33] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2025-05-30 01:49:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:49:33] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2025-05-30 01:49:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:49:33] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2025-05-30 01:49:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:49:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17703342988952181221
Running compilation step : cd /tmp/ltsmin17703342988952181221;'/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 511 ms.
Running link step : cd /tmp/ltsmin17703342988952181221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17703342988952181221;'/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/stateBased13881771212687351323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 01:49:49] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:49:49] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:49:49] [INFO ] Time to serialize gal into /tmp/LTL12201278788519564401.gal : 3 ms
[2025-05-30 01:49:49] [INFO ] Time to serialize properties into /tmp/LTL9706998548231789352.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/LTL12201278788519564401.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4352541379610303605.hoa' '-atoms' '/tmp/LTL9706998548231789352.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/LTL9706998548231789352.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4352541379610303605.hoa
Reverse transition relation is NOT exact ! Due to transitions t500, t270.t318.t1326.t319.t1325, t269.t318.t1328.t319.t1327, t48.t166.t1242.t167.t131.t1244....2099
Computing Next relation with stutter on 859362 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1296 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,12.9965,320060,1,0,519,1.33984e+06,526,271,7969,1.08582e+06,849
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ASLink-PT-02b-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ASLink-PT-02b-LTLFireability-15 finished in 111287 ms.
All properties solved by simple procedures.
Total runtime 409521 ms.

BK_STOP 1748569804037

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729000308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;