Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 332K 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 CO4-PT-19-LTLFireability-00
FORMULA_NAME CO4-PT-19-LTLFireability-01
FORMULA_NAME CO4-PT-19-LTLFireability-02
FORMULA_NAME CO4-PT-19-LTLFireability-03
FORMULA_NAME CO4-PT-19-LTLFireability-04
FORMULA_NAME CO4-PT-19-LTLFireability-05
FORMULA_NAME CO4-PT-19-LTLFireability-06
FORMULA_NAME CO4-PT-19-LTLFireability-07
FORMULA_NAME CO4-PT-19-LTLFireability-08
FORMULA_NAME CO4-PT-19-LTLFireability-09
FORMULA_NAME CO4-PT-19-LTLFireability-10
FORMULA_NAME CO4-PT-19-LTLFireability-11
FORMULA_NAME CO4-PT-19-LTLFireability-12
FORMULA_NAME CO4-PT-19-LTLFireability-13
FORMULA_NAME CO4-PT-19-LTLFireability-14
FORMULA_NAME CO4-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748610482913

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 13:08:04] [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 13:08:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:08:04] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-05-30 13:08:04] [INFO ] Transformed 1174 places.
[2025-05-30 13:08:04] [INFO ] Transformed 1447 transitions.
[2025-05-30 13:08:04] [INFO ] Found NUPN structural information;
[2025-05-30 13:08:04] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 201 places in 16 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 159 places :
Symmetric choice reduction at 1 with 159 rule applications. Total rules 192 place count 789 transition count 1004
Iterating global reduction 1 with 159 rules applied. Total rules applied 351 place count 789 transition count 1004
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 485 place count 655 transition count 866
Iterating global reduction 1 with 134 rules applied. Total rules applied 619 place count 655 transition count 866
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 626 place count 655 transition count 859
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 688 place count 593 transition count 793
Iterating global reduction 2 with 62 rules applied. Total rules applied 750 place count 593 transition count 793
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 752 place count 593 transition count 791
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 791 place count 554 transition count 752
Iterating global reduction 3 with 39 rules applied. Total rules applied 830 place count 554 transition count 752
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 837 place count 554 transition count 745
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 855 place count 536 transition count 727
Iterating global reduction 4 with 18 rules applied. Total rules applied 873 place count 536 transition count 727
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 875 place count 536 transition count 725
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 880 place count 531 transition count 720
Iterating global reduction 5 with 5 rules applied. Total rules applied 885 place count 531 transition count 720
Applied a total of 885 rules in 282 ms. Remains 531 /973 variables (removed 442) and now considering 720/1173 (removed 453) transitions.
// Phase 1: matrix 720 rows 531 cols
[2025-05-30 13:08:04] [INFO ] Computed 7 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:05] [INFO ] Implicit Places using invariants in 1039 ms returned [6, 461]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/973 places, 720/1173 transitions.
Applied a total of 0 rules in 9 ms. Remains 529 /529 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1375 ms. Remains : 529/973 places, 720/1173 transitions.
Support contains 33 out of 529 places after structural reductions.
[2025-05-30 13:08:06] [INFO ] Flatten gal took : 79 ms
[2025-05-30 13:08:06] [INFO ] Flatten gal took : 39 ms
[2025-05-30 13:08:06] [INFO ] Input system was already deterministic with 720 transitions.
RANDOM walk for 40000 steps (628 resets) in 2974 ms. (13 steps per ms) remains 19/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (14 resets) in 61 ms. (64 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
// Phase 1: matrix 720 rows 529 cols
[2025-05-30 13:08:07] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 13/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 192/252 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 439/691 variables, 166/231 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 383/1074 variables, 194/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1074 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 134/1208 variables, 82/507 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1208 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 32/1240 variables, 20/527 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1240 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 9/1249 variables, 7/534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1249 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1249 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1249/1249 variables, and 534 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2179 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 13/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 192/252 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 439/691 variables, 166/234 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 383/1074 variables, 194/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1074 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 134/1208 variables, 82/525 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1208 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 32/1240 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1240 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 9/1249 variables, 7/552 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1249 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/1249 variables, and 552 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7252ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 720/720 transitions.
Graph (trivial) has 521 edges and 529 vertex of which 3 / 529 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1019 edges and 527 vertex of which 521 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 521 transition count 485
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 443 place count 307 transition count 481
Reduce places removed 2 places and 0 transitions.
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 2 with 4 rules applied. Total rules applied 447 place count 305 transition count 479
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 458 place count 304 transition count 469
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 468 place count 294 transition count 469
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 43 Pre rules applied. Total rules applied 468 place count 294 transition count 426
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 554 place count 251 transition count 426
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 557 place count 248 transition count 423
Iterating global reduction 5 with 3 rules applied. Total rules applied 560 place count 248 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 562 place count 248 transition count 421
Performed 77 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 716 place count 171 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 728 place count 171 transition count 314
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 734 place count 165 transition count 305
Iterating global reduction 7 with 6 rules applied. Total rules applied 740 place count 165 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 742 place count 164 transition count 304
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 743 place count 163 transition count 302
Iterating global reduction 7 with 1 rules applied. Total rules applied 744 place count 163 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 745 place count 163 transition count 301
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 821 place count 125 transition count 352
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 838 place count 125 transition count 335
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 859 place count 104 transition count 251
Iterating global reduction 9 with 21 rules applied. Total rules applied 880 place count 104 transition count 251
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 891 place count 104 transition count 240
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 895 place count 100 transition count 220
Iterating global reduction 10 with 4 rules applied. Total rules applied 899 place count 100 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 901 place count 100 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 912 place count 100 transition count 207
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 924 place count 100 transition count 195
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 937 place count 88 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 940 place count 88 transition count 191
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 943 place count 88 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 944 place count 88 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 945 place count 87 transition count 189
Applied a total of 945 rules in 152 ms. Remains 87 /529 variables (removed 442) and now considering 189/720 (removed 531) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 87/529 places, 189/720 transitions.
RANDOM walk for 40000 steps (1381 resets) in 462 ms. (86 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (198 resets) in 47 ms. (833 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (227 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2025-05-30 13:08:14] [INFO ] Flow matrix only has 175 transitions (discarded 14 similar events)
// Phase 1: matrix 175 rows 87 cols
[2025-05-30 13:08:14] [INFO ] Computed 6 invariants in 1 ms
[2025-05-30 13:08:14] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 147/209 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/254 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/262 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 147/209 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/254 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/262 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/262 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 6 ms.
FORMULA CO4-PT-19-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-19-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 1022 edges and 529 vertex of which 524 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((G((p1 U p0))||X(X(F(p1)))))))'
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 515 transition count 706
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 515 transition count 706
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 504 transition count 694
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 504 transition count 694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 504 transition count 692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 496 transition count 683
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 496 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 496 transition count 682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 492 transition count 678
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 492 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 492 transition count 676
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 490 transition count 674
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 490 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 489 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 489 transition count 673
Applied a total of 85 rules in 60 ms. Remains 489 /529 variables (removed 40) and now considering 673/720 (removed 47) transitions.
// Phase 1: matrix 673 rows 489 cols
[2025-05-30 13:08:15] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:15] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-30 13:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:16] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2025-05-30 13:08: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/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:08:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:08:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 30191ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Starting structural reductions in LTL mode, iteration 1 : 489/529 places, 673/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30728 ms. Remains : 489/529 places, 673/720 transitions.
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-19-LTLFireability-00
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 2 ms.
FORMULA CO4-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-00 finished in 31150 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(X(G((p0||(p1 U (G(p1)||(p1&&G(!p2)))))))))))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 517 transition count 708
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 517 transition count 708
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 507 transition count 697
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 507 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 507 transition count 696
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 499 transition count 687
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 499 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 499 transition count 686
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 495 transition count 682
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 495 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 495 transition count 681
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 493 transition count 679
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 493 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 492 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 492 transition count 678
Applied a total of 77 rules in 64 ms. Remains 492 /529 variables (removed 37) and now considering 678/720 (removed 42) transitions.
// Phase 1: matrix 678 rows 492 cols
[2025-05-30 13:08:46] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:46] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 13:08:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:47] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 677 sub problems to find dead transitions.
[2025-05-30 13:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:09:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:09:05] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 30139ms
Starting structural reductions in LTL mode, iteration 1 : 492/529 places, 678/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30589 ms. Remains : 492/529 places, 678/720 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CO4-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 377 reset in 229 ms.
Product exploration explored 100000 steps with 692 reset in 189 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 967 edges and 492 vertex of which 487 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (666 resets) in 354 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (103 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (104 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (95 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (142 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (138 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (126 resets) in 97 ms. (408 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (97 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (139 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (140 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (139 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
[2025-05-30 13:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 194/232 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 394/626 variables, 150/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 25/651 variables, 5/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 338/989 variables, 171/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/989 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 149/1138 variables, 85/474 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1138 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 28/1166 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:09:19] [INFO ] Deduced a trap composed of 187 places in 83 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 4/1170 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 498 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 194/232 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 394/626 variables, 150/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 25/651 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 338/989 variables, 171/398 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/989 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 149/1138 variables, 85/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 28/1166 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1166 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 4/1170 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1170 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/1170 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 507 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2502 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4119ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 7 properties in 1226 ms.
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 678/678 transitions.
Graph (trivial) has 525 edges and 492 vertex of which 3 / 492 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 964 edges and 490 vertex of which 473 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 232 rules applied. Total rules applied 234 place count 473 transition count 430
Reduce places removed 211 places and 0 transitions.
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 1 with 213 rules applied. Total rules applied 447 place count 262 transition count 428
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 450 place count 261 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 452 place count 259 transition count 426
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 452 place count 259 transition count 379
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 546 place count 212 transition count 379
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 549 place count 209 transition count 376
Iterating global reduction 4 with 3 rules applied. Total rules applied 552 place count 209 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 555 place count 209 transition count 373
Performed 79 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 713 place count 130 transition count 271
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 725 place count 130 transition count 259
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 732 place count 123 transition count 248
Iterating global reduction 6 with 7 rules applied. Total rules applied 739 place count 123 transition count 248
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 745 place count 120 transition count 245
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 119 transition count 243
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 119 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 748 place count 119 transition count 242
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 826 place count 80 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 867 place count 80 transition count 246
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 894 place count 53 transition count 155
Iterating global reduction 8 with 27 rules applied. Total rules applied 921 place count 53 transition count 155
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 938 place count 53 transition count 138
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 945 place count 46 transition count 103
Iterating global reduction 9 with 7 rules applied. Total rules applied 952 place count 46 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 955 place count 46 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 957 place count 45 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 960 place count 45 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 968 place count 45 transition count 97
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 975 place count 45 transition count 90
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 983 place count 38 transition count 89
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 986 place count 38 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 987 place count 37 transition count 88
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t104.t108.t657.t101.t616 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 33 vertex of which 5 / 33 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
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 12 with 5 rules applied. Total rules applied 992 place count 30 transition count 84
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 23 edges and 26 vertex of which 7 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 15 rules applied. Total rules applied 1007 place count 20 transition count 74
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 14 with 27 rules applied. Total rules applied 1034 place count 19 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1037 place count 17 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 14 edges and 17 vertex of which 5 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 6 rules applied. Total rules applied 1043 place count 13 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1063 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 1067 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 1069 place count 12 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 1071 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 1073 place count 10 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1074 place count 10 transition count 15
Applied a total of 1074 rules in 48 ms. Remains 10 /492 variables (removed 482) and now considering 15/678 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 10/492 places, 15/678 transitions.
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND (OR p0 p1) (OR p1 (NOT p2))))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p2), (F (NOT (AND (OR p0 p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 344 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 376 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 492 /492 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2025-05-30 13:09:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:09:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 13:09:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:09:25] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 677 sub problems to find dead transitions.
[2025-05-30 13:09:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:09:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:09:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
SMT process timed out in 30121ms, After SMT, problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 30123ms
Finished structural reductions in LTL mode , in 1 iterations and 30509 ms. Remains : 492/492 places, 678/678 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 967 edges and 492 vertex of which 487 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (430 resets) in 559 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (105 resets) in 50 ms. (784 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (104 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (105 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (136 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (140 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (137 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (104 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (125 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (137 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (142 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
[2025-05-30 13:09:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 194/232 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 394/626 variables, 150/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 25/651 variables, 5/213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 338/989 variables, 171/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/989 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 149/1138 variables, 85/474 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1138 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 28/1166 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:09:57] [INFO ] Deduced a trap composed of 187 places in 88 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 4/1170 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 498 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 194/232 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 394/626 variables, 150/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 25/651 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 338/989 variables, 171/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/989 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 149/1138 variables, 85/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 28/1166 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1166 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 4/1170 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1170 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/1170 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 508 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4692ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 1026 ms.
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 678/678 transitions.
Graph (trivial) has 525 edges and 492 vertex of which 3 / 492 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 964 edges and 490 vertex of which 473 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 232 rules applied. Total rules applied 234 place count 473 transition count 430
Reduce places removed 211 places and 0 transitions.
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 1 with 213 rules applied. Total rules applied 447 place count 262 transition count 428
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 450 place count 261 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 452 place count 259 transition count 426
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 452 place count 259 transition count 379
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 546 place count 212 transition count 379
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 549 place count 209 transition count 376
Iterating global reduction 4 with 3 rules applied. Total rules applied 552 place count 209 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 555 place count 209 transition count 373
Performed 79 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 713 place count 130 transition count 271
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 725 place count 130 transition count 259
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 732 place count 123 transition count 248
Iterating global reduction 6 with 7 rules applied. Total rules applied 739 place count 123 transition count 248
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 745 place count 120 transition count 245
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 119 transition count 243
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 119 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 748 place count 119 transition count 242
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 826 place count 80 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 867 place count 80 transition count 246
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 894 place count 53 transition count 155
Iterating global reduction 8 with 27 rules applied. Total rules applied 921 place count 53 transition count 155
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 938 place count 53 transition count 138
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 945 place count 46 transition count 103
Iterating global reduction 9 with 7 rules applied. Total rules applied 952 place count 46 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 955 place count 46 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 957 place count 45 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 960 place count 45 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 968 place count 45 transition count 97
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 975 place count 45 transition count 90
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 983 place count 38 transition count 89
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 986 place count 38 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 987 place count 37 transition count 88
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t104.t108.t657.t101.t616 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 33 vertex of which 5 / 33 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
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 12 with 5 rules applied. Total rules applied 992 place count 30 transition count 84
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 23 edges and 26 vertex of which 7 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 15 rules applied. Total rules applied 1007 place count 20 transition count 74
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 14 with 27 rules applied. Total rules applied 1034 place count 19 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1037 place count 17 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 14 edges and 17 vertex of which 5 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 6 rules applied. Total rules applied 1043 place count 13 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1063 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 1067 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 1069 place count 12 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 1071 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 1073 place count 10 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1074 place count 10 transition count 15
Applied a total of 1074 rules in 44 ms. Remains 10 /492 variables (removed 482) and now considering 15/678 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 10/492 places, 15/678 transitions.
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND (OR p0 p1) (OR p1 (NOT p2))))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p2), (F (NOT (AND (OR p0 p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 346 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 128 reset in 114 ms.
Product exploration explored 100000 steps with 357 reset in 137 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 492/492 places, 678/678 transitions.
Graph (trivial) has 525 edges and 492 vertex of which 3 / 492 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 965 edges and 490 vertex of which 485 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 485 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 485 transition count 669
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 207 place count 485 transition count 672
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 212 place count 485 transition count 672
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 272 place count 425 transition count 612
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 332 place count 425 transition count 612
Performed 105 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 437 place count 425 transition count 659
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 453 place count 425 transition count 643
Discarding 95 places :
Symmetric choice reduction at 3 with 95 rule applications. Total rules 548 place count 330 transition count 544
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 95 rules applied. Total rules applied 643 place count 330 transition count 544
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 644 place count 329 transition count 543
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 645 place count 329 transition count 543
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 329 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 329 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 649 place count 327 transition count 540
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 651 place count 327 transition count 540
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 652 place count 327 transition count 540
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 325 transition count 537
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 325 transition count 537
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 658 place count 323 transition count 534
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 660 place count 323 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 661 place count 323 transition count 533
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 662 place count 322 transition count 532
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 663 place count 322 transition count 532
Performed 63 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 63 rules applied. Total rules applied 726 place count 322 transition count 848
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 780 place count 322 transition count 794
Discarding 106 places :
Symmetric choice reduction at 6 with 106 rule applications. Total rules 886 place count 216 transition count 494
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 6 with 106 rules applied. Total rules applied 992 place count 216 transition count 494
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1018 place count 216 transition count 468
Discarding 64 places :
Symmetric choice reduction at 7 with 64 rule applications. Total rules 1082 place count 152 transition count 338
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 7 with 64 rules applied. Total rules applied 1146 place count 152 transition count 338
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1151 place count 152 transition count 333
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1164 place count 139 transition count 308
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1177 place count 139 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1179 place count 139 transition count 337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1180 place count 138 transition count 335
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1181 place count 138 transition count 335
Deduced a syphon composed of 77 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 8 with 50 rules applied. Total rules applied 1231 place count 138 transition count 285
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1232 place count 137 transition count 284
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1233 place count 137 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1234 place count 137 transition count 305
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1236 place count 135 transition count 289
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1238 place count 135 transition count 289
Deduced a syphon composed of 75 places in 0 ms
Applied a total of 1238 rules in 132 ms. Remains 135 /492 variables (removed 357) and now considering 289/678 (removed 389) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:10:04] [INFO ] Redundant transitions in 14 ms returned []
Running 288 sub problems to find dead transitions.
[2025-05-30 13:10:04] [INFO ] Flow matrix only has 278 transitions (discarded 11 similar events)
// Phase 1: matrix 278 rows 135 cols
[2025-05-30 13:10:04] [INFO ] Computed 5 invariants in 2 ms
[2025-05-30 13:10:04] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:10:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:10:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:10:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:10:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:10:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 273 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 4 (OVERLAPS) 277/412 variables, 135/145 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 35/180 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/180 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/181 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/181 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/181 constraints. Problems are: Problem set: 163 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 181 constraints, problems are : Problem set: 163 solved, 125 unsolved in 11371 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 163 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 16/75 variables, 5/5 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/10 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 262/337 variables, 75/85 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 35/120 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 125/245 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/245 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 75/412 variables, 60/305 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/305 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/306 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/306 constraints. Problems are: Problem set: 163 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/306 constraints. Problems are: Problem set: 163 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 306 constraints, problems are : Problem set: 163 solved, 125 unsolved in 14068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 125/288 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25497ms problems are : Problem set: 163 solved, 125 unsolved
Search for dead transitions found 163 dead transitions in 25498ms
Found 163 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 163 transitions
Dead transitions reduction (with SMT) removed 163 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/492 places, 126/678 transitions.
Graph (complete) has 239 edges and 135 vertex of which 60 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 60 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 17 rules in 10 ms. Remains 60 /135 variables (removed 75) and now considering 147/126 (removed -21) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/492 places, 147/678 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25661 ms. Remains : 60/492 places, 147/678 transitions.
Built C files in :
/tmp/ltsmin4683423232554331604
[2025-05-30 13:10:30] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4683423232554331604
Running compilation step : cd /tmp/ltsmin4683423232554331604;'/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 1179 ms.
Running link step : cd /tmp/ltsmin4683423232554331604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4683423232554331604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2174639255233720146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 678/678 transitions.
Applied a total of 0 rules in 21 ms. Remains 492 /492 variables (removed 0) and now considering 678/678 (removed 0) transitions.
// Phase 1: matrix 678 rows 492 cols
[2025-05-30 13:10:45] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:10:45] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-30 13:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:10:45] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 677 sub problems to find dead transitions.
[2025-05-30 13:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:11:03] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:11:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Finished structural reductions in LTL mode , in 1 iterations and 30550 ms. Remains : 492/492 places, 678/678 transitions.
Built C files in :
/tmp/ltsmin12250311109966999367
[2025-05-30 13:11:16] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12250311109966999367
Running compilation step : cd /tmp/ltsmin12250311109966999367;'/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 964 ms.
Running link step : cd /tmp/ltsmin12250311109966999367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12250311109966999367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7815755713236187542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 13:11:31] [INFO ] Flatten gal took : 29 ms
[2025-05-30 13:11:31] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:11:31] [INFO ] Time to serialize gal into /tmp/LTL3045908225949420677.gal : 7 ms
[2025-05-30 13:11:31] [INFO ] Time to serialize properties into /tmp/LTL9313065591464736765.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3045908225949420677.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14778715975081913786.hoa' '-atoms' '/tmp/LTL9313065591464736765.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/LTL9313065591464736765.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14778715975081913786.hoa
Detected timeout of ITS tools.
[2025-05-30 13:11:46] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:11:46] [INFO ] Flatten gal took : 23 ms
[2025-05-30 13:11:46] [INFO ] Time to serialize gal into /tmp/LTL17055200054519947344.gal : 4 ms
[2025-05-30 13:11:46] [INFO ] Time to serialize properties into /tmp/LTL11397439298078749684.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17055200054519947344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11397439298078749684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G((("(p1073!=1)")U((G("(p1073!=1)"))||(("(p1073!=1)")&&(G(!("((p307==1)&&(p532==1))"))))))||("((p145==0)&&((p307==0)||(p532...170
Formula 0 simplified : XXXXF(!"((p145==0)&&((p307==0)||(p532==0)))" & (F"((p307==1)&&(p532==1))" U !"(p1073!=1)"))
Detected timeout of ITS tools.
[2025-05-30 13:12:01] [INFO ] Flatten gal took : 26 ms
[2025-05-30 13:12:01] [INFO ] Applying decomposition
[2025-05-30 13:12:01] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14773899794311907879.txt' '-o' '/tmp/graph14773899794311907879.bin' '-w' '/tmp/graph14773899794311907879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14773899794311907879.bin' '-l' '-1' '-v' '-w' '/tmp/graph14773899794311907879.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:12:01] [INFO ] Decomposing Gal with order
[2025-05-30 13:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:12:01] [INFO ] Removed a total of 409 redundant transitions.
[2025-05-30 13:12:01] [INFO ] Flatten gal took : 131 ms
[2025-05-30 13:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2025-05-30 13:12:01] [INFO ] Time to serialize gal into /tmp/LTL14648760254617207453.gal : 9 ms
[2025-05-30 13:12:01] [INFO ] Time to serialize properties into /tmp/LTL7236201261097819768.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14648760254617207453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7236201261097819768.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G((("(i21.u183.p1073!=1)")U((G("(i21.u183.p1073!=1)"))||(("(i21.u183.p1073!=1)")&&(G(!("((i4.u46.p307==1)&&(i9.u77.p532==1)...232
Formula 0 simplified : XXXXF(!"((i2.u11.p145==0)&&((i4.u46.p307==0)||(i9.u77.p532==0)))" & (F"((i4.u46.p307==1)&&(i9.u77.p532==1))" U !"(i21.u183.p1073!=1)...158
Reverse transition relation is NOT exact ! Due to transitions t29, t54, t67, t92, t102, t103, t150, t186, t198, t240, t285, t327, t339, t374, t389, t435, t...1024
Computing Next relation with stutter on 618239 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
1305 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,13.1185,446860,1,0,762087,3288,7851,2.70156e+06,369,22372,1244447
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-19-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property CO4-PT-19-LTLFireability-01 finished in 210224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Graph (trivial) has 569 edges and 529 vertex of which 3 / 529 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1020 edges and 527 vertex of which 522 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 236 place count 521 transition count 477
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 238 rules applied. Total rules applied 474 place count 287 transition count 473
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 476 place count 285 transition count 473
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 476 place count 285 transition count 429
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 564 place count 241 transition count 429
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 567 place count 238 transition count 426
Iterating global reduction 3 with 3 rules applied. Total rules applied 570 place count 238 transition count 426
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 570 place count 238 transition count 424
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 574 place count 236 transition count 424
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 576 place count 234 transition count 420
Iterating global reduction 3 with 2 rules applied. Total rules applied 578 place count 234 transition count 420
Performed 91 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 760 place count 143 transition count 301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 773 place count 143 transition count 288
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 781 place count 135 transition count 275
Iterating global reduction 4 with 8 rules applied. Total rules applied 789 place count 135 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 791 place count 134 transition count 274
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 792 place count 133 transition count 272
Iterating global reduction 4 with 1 rules applied. Total rules applied 793 place count 133 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 794 place count 133 transition count 271
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 876 place count 92 transition count 318
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 897 place count 92 transition count 297
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 925 place count 64 transition count 185
Iterating global reduction 6 with 28 rules applied. Total rules applied 953 place count 64 transition count 185
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 972 place count 64 transition count 166
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 979 place count 57 transition count 128
Iterating global reduction 7 with 7 rules applied. Total rules applied 986 place count 57 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 991 place count 57 transition count 123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 999 place count 53 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 8 with 47 rules applied. Total rules applied 1046 place count 53 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1048 place count 51 transition count 115
Applied a total of 1048 rules in 54 ms. Remains 51 /529 variables (removed 478) and now considering 115/720 (removed 605) transitions.
[2025-05-30 13:12:16] [INFO ] Flow matrix only has 87 transitions (discarded 28 similar events)
// Phase 1: matrix 87 rows 51 cols
[2025-05-30 13:12:16] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:12:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 13:12:17] [INFO ] Flow matrix only has 87 transitions (discarded 28 similar events)
[2025-05-30 13:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:12:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:12:17] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:12:17] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2025-05-30 13:12:17] [INFO ] Flow matrix only has 87 transitions (discarded 28 similar events)
[2025-05-30 13:12:17] [INFO ] Invariant cache hit.
[2025-05-30 13:12:17] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 86/137 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/138 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 59 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 86/137 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 95/153 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 154 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3218 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5316ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/529 places, 115/720 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5508 ms. Remains : 51/529 places, 115/720 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 318 reset in 133 ms.
Product exploration explored 100000 steps with 7 reset in 147 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7237 steps (593 resets) in 62 ms. (114 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 79 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-05-30 13:12:23] [INFO ] Flow matrix only has 87 transitions (discarded 28 similar events)
[2025-05-30 13:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:12:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 13:12:23] [INFO ] Flow matrix only has 87 transitions (discarded 28 similar events)
[2025-05-30 13:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:12:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:12:23] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:12:23] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2025-05-30 13:12:23] [INFO ] Flow matrix only has 87 transitions (discarded 28 similar events)
[2025-05-30 13:12:23] [INFO ] Invariant cache hit.
[2025-05-30 13:12:23] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 86/137 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/138 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 59 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 86/137 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 95/153 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 154 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5277ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5389 ms. Remains : 51/51 places, 115/115 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4349 steps (350 resets) in 13 ms. (310 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 83 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 192 reset in 41 ms.
Product exploration explored 100000 steps with 186 reset in 39 ms.
Built C files in :
/tmp/ltsmin13591545664882990411
[2025-05-30 13:12:29] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2025-05-30 13:12:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:12:29] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2025-05-30 13:12:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:12:29] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2025-05-30 13:12:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:12:29] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13591545664882990411
Running compilation step : cd /tmp/ltsmin13591545664882990411;'/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 212 ms.
Running link step : cd /tmp/ltsmin13591545664882990411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13591545664882990411;'/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/stateBased14470729798433207480.hoa' '--buchi-type=spotba'
LTSmin run took 255 ms.
FORMULA CO4-PT-19-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-03 finished in 12758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&p0)))'
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 516 transition count 707
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 516 transition count 707
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 504 transition count 694
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 504 transition count 694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 504 transition count 692
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 495 transition count 682
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 495 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 495 transition count 681
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 490 transition count 676
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 490 transition count 676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 490 transition count 674
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 488 transition count 672
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 487 transition count 671
Applied a total of 89 rules in 43 ms. Remains 487 /529 variables (removed 42) and now considering 671/720 (removed 49) transitions.
// Phase 1: matrix 671 rows 487 cols
[2025-05-30 13:12:29] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:12:29] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-30 13:12:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:12:30] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2025-05-30 13:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:12:48] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:12:48] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)timeout

( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
SMT process timed out in 30103ms, After SMT, problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 30110ms
Starting structural reductions in LTL mode, iteration 1 : 487/529 places, 671/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30609 ms. Remains : 487/529 places, 671/720 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-06 finished in 30752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 6 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Graph (trivial) has 554 edges and 529 vertex of which 3 / 529 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1020 edges and 527 vertex of which 522 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 521 transition count 486
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 229 rules applied. Total rules applied 456 place count 296 transition count 482
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 464 place count 294 transition count 476
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 470 place count 288 transition count 476
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 470 place count 288 transition count 432
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 558 place count 244 transition count 432
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 563 place count 239 transition count 427
Iterating global reduction 4 with 5 rules applied. Total rules applied 568 place count 239 transition count 427
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 568 place count 239 transition count 425
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 572 place count 237 transition count 425
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 574 place count 235 transition count 421
Iterating global reduction 4 with 2 rules applied. Total rules applied 576 place count 235 transition count 421
Performed 88 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 752 place count 147 transition count 305
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 765 place count 147 transition count 292
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 773 place count 139 transition count 280
Iterating global reduction 5 with 8 rules applied. Total rules applied 781 place count 139 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 782 place count 139 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 784 place count 138 transition count 278
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 785 place count 137 transition count 276
Iterating global reduction 6 with 1 rules applied. Total rules applied 786 place count 137 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 787 place count 137 transition count 275
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 867 place count 97 transition count 321
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 888 place count 97 transition count 300
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 914 place count 71 transition count 196
Iterating global reduction 8 with 26 rules applied. Total rules applied 940 place count 71 transition count 196
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 957 place count 71 transition count 179
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 964 place count 64 transition count 141
Iterating global reduction 9 with 7 rules applied. Total rules applied 971 place count 64 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 976 place count 64 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 982 place count 61 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 1002 place count 61 transition count 147
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1004 place count 59 transition count 145
Applied a total of 1004 rules in 64 ms. Remains 59 /529 variables (removed 470) and now considering 145/720 (removed 575) transitions.
[2025-05-30 13:13:00] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
// Phase 1: matrix 132 rows 59 cols
[2025-05-30 13:13:00] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-30 13:13:00] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 13:13:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:13:00] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2025-05-30 13:13:00] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:00] [INFO ] Invariant cache hit.
[2025-05-30 13:13:00] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 131/190 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 70 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4211 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 131/190 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 132/201 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 202 constraints, problems are : Problem set: 0 solved, 132 unsolved in 7102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11346ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/529 places, 145/720 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11674 ms. Remains : 59/529 places, 145/720 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 27 reset in 99 ms.
Product exploration explored 100000 steps with 92 reset in 96 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2599 resets) in 175 ms. (227 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (212 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2025-05-30 13:13:12] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:12] [INFO ] Invariant cache hit.
[2025-05-30 13:13:12] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/116 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/183 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/190 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/191 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/116 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/183 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/190 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/191 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/191 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 p0) (OR p0 p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 13 factoid took 444 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 145/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2025-05-30 13:13:13] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 13:13:13] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 13:13:13] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:13:13] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2025-05-30 13:13:13] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:13] [INFO ] Invariant cache hit.
[2025-05-30 13:13:13] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 131/190 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 70 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 131/190 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 132/201 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 202 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6947 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11126ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11246 ms. Remains : 59/59 places, 145/145 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X p0), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2581 resets) in 105 ms. (377 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (216 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2025-05-30 13:13:25] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
[2025-05-30 13:13:25] [INFO ] Invariant cache hit.
[2025-05-30 13:13:25] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/116 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/183 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/190 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/191 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/116 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/183 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/190 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/191 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/191 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X p0), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 p0) (OR p0 p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 13 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 115 reset in 70 ms.
Product exploration explored 100000 steps with 241 reset in 72 ms.
Built C files in :
/tmp/ltsmin1864370168437195045
[2025-05-30 13:13:26] [INFO ] Computing symmetric may disable matrix : 145 transitions.
[2025-05-30 13:13:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:13:26] [INFO ] Computing symmetric may enable matrix : 145 transitions.
[2025-05-30 13:13:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:13:26] [INFO ] Computing Do-Not-Accords matrix : 145 transitions.
[2025-05-30 13:13:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:13:26] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1864370168437195045
Running compilation step : cd /tmp/ltsmin1864370168437195045;'/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 286 ms.
Running link step : cd /tmp/ltsmin1864370168437195045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1864370168437195045;'/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/stateBased15687347657859663753.hoa' '--buchi-type=spotba'
LTSmin run took 4396 ms.
FORMULA CO4-PT-19-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-07 finished in 30750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0&&X(p1))||G(p1)))&&F((G(F(p2))||(p3&&F(p2))))))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 517 transition count 708
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 517 transition count 708
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 507 transition count 697
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 507 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 507 transition count 695
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 499 transition count 687
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 499 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 499 transition count 686
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 494 transition count 681
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 494 transition count 681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 494 transition count 679
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 492 transition count 677
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 492 transition count 677
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 491 transition count 676
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 491 transition count 676
Applied a total of 81 rules in 45 ms. Remains 491 /529 variables (removed 38) and now considering 676/720 (removed 44) transitions.
// Phase 1: matrix 676 rows 491 cols
[2025-05-30 13:13:31] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:31] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-30 13:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:31] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 675 sub problems to find dead transitions.
[2025-05-30 13:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:13:49] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:13:49] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 675 unsolved
SMT process timed out in 30100ms, After SMT, problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 30102ms
Starting structural reductions in LTL mode, iteration 1 : 491/529 places, 676/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30597 ms. Remains : 491/529 places, 676/720 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-08
Product exploration explored 100000 steps with 1086 reset in 94 ms.
Product exploration explored 100000 steps with 406 reset in 90 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 970 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p2), (X (NOT p3)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 86 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
RANDOM walk for 40000 steps (492 resets) in 91 ms. (434 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (144 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
[2025-05-30 13:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/28 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 147/175 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/192 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/208 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:14:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 344/552 variables, 141/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/948 variables, 184/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/948 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 159/1107 variables, 96/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 44/1151 variables, 28/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1151 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/1161 variables, 6/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/1166 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1166 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/1167 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1167 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1167 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/28 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 147/175 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/192 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/208 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 344/552 variables, 141/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/948 variables, 184/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/948 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 159/1107 variables, 96/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1107 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 44/1151 variables, 28/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1151 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/1161 variables, 6/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1161 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/1166 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1166 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/1167 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1167 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1167 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 676/676 transitions.
Graph (trivial) has 526 edges and 491 vertex of which 3 / 491 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 967 edges and 489 vertex of which 472 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 472 transition count 426
Reduce places removed 212 places and 0 transitions.
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 1 with 214 rules applied. Total rules applied 449 place count 260 transition count 424
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 451 place count 259 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 452 place count 258 transition count 423
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 452 place count 258 transition count 376
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 546 place count 211 transition count 376
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 550 place count 207 transition count 372
Iterating global reduction 4 with 4 rules applied. Total rules applied 554 place count 207 transition count 372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 557 place count 207 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 557 place count 207 transition count 368
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 559 place count 206 transition count 368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 560 place count 205 transition count 366
Iterating global reduction 5 with 1 rules applied. Total rules applied 561 place count 205 transition count 366
Performed 77 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 715 place count 128 transition count 267
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 725 place count 128 transition count 257
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 733 place count 120 transition count 244
Iterating global reduction 6 with 8 rules applied. Total rules applied 741 place count 120 transition count 244
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 116 transition count 240
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 116 transition count 239
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 751 place count 115 transition count 237
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 115 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 753 place count 115 transition count 236
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 831 place count 76 transition count 277
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 8 with 81 rules applied. Total rules applied 912 place count 76 transition count 196
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 941 place count 47 transition count 127
Iterating global reduction 9 with 29 rules applied. Total rules applied 970 place count 47 transition count 127
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 989 place count 47 transition count 108
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 996 place count 40 transition count 79
Iterating global reduction 10 with 7 rules applied. Total rules applied 1003 place count 40 transition count 79
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1008 place count 40 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1010 place count 39 transition count 89
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1013 place count 39 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 1023 place count 39 transition count 76
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1024 place count 38 transition count 74
Iterating global reduction 12 with 1 rules applied. Total rules applied 1025 place count 38 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1026 place count 38 transition count 73
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1034 place count 38 transition count 65
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1044 place count 30 transition count 63
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1047 place count 30 transition count 63
Graph (complete) has 107 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 1048 place count 29 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1051 place count 29 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1052 place count 28 transition count 59
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t390.t394.t584.t617 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 24 vertex of which 3 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 16 with 5 rules applied. Total rules applied 1057 place count 22 transition count 55
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 20 edges and 16 vertex of which 11 / 16 are part of one of the 2 SCC in 1 ms
Free SCC test removed 9 places
Iterating post reduction 17 with 18 rules applied. Total rules applied 1075 place count 7 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 18 with 36 rules applied. Total rules applied 1111 place count 7 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1112 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1113 place count 6 transition count 7
Applied a total of 1113 rules in 36 ms. Remains 6 /491 variables (removed 485) and now considering 7/676 (removed 669) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 6/491 places, 7/676 transitions.
RANDOM walk for 33339 steps (7 resets) in 17 ms. (1852 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p3) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p2), (X (NOT p3)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F p3), (F (NOT p2)), (F (NOT (OR p2 (NOT p3))))]
Knowledge based reduction with 17 factoid took 231 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
Support contains 2 out of 491 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 : 491/491 places, 676/676 transitions.
Graph (trivial) has 522 edges and 491 vertex of which 3 / 491 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 483 transition count 466
Reduce places removed 201 places and 0 transitions.
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 1 with 203 rules applied. Total rules applied 406 place count 282 transition count 464
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 408 place count 281 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 409 place count 280 transition count 463
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 409 place count 280 transition count 415
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 505 place count 232 transition count 415
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 673 place count 148 transition count 305
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 683 place count 148 transition count 295
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 691 place count 140 transition count 282
Iterating global reduction 5 with 8 rules applied. Total rules applied 699 place count 140 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 701 place count 139 transition count 281
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 702 place count 138 transition count 279
Iterating global reduction 5 with 1 rules applied. Total rules applied 703 place count 138 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 704 place count 138 transition count 278
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 786 place count 97 transition count 326
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 806 place count 97 transition count 306
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 834 place count 69 transition count 194
Iterating global reduction 7 with 28 rules applied. Total rules applied 862 place count 69 transition count 194
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 879 place count 69 transition count 177
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 885 place count 63 transition count 145
Iterating global reduction 8 with 6 rules applied. Total rules applied 891 place count 63 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 896 place count 63 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 902 place count 60 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 950 place count 60 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 952 place count 59 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 954 place count 57 transition count 139
Applied a total of 954 rules in 48 ms. Remains 57 /491 variables (removed 434) and now considering 139/676 (removed 537) transitions.
[2025-05-30 13:14:04] [INFO ] Flow matrix only has 115 transitions (discarded 24 similar events)
// Phase 1: matrix 115 rows 57 cols
[2025-05-30 13:14:04] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-30 13:14:04] [INFO ] Flow matrix only has 115 transitions (discarded 24 similar events)
[2025-05-30 13:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 13:14:04] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:14:04] [INFO ] Redundant transitions in 1 ms returned []
Running 119 sub problems to find dead transitions.
[2025-05-30 13:14:04] [INFO ] Flow matrix only has 115 transitions (discarded 24 similar events)
[2025-05-30 13:14:04] [INFO ] Invariant cache hit.
[2025-05-30 13:14:04] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 114/171 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 1/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 66 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 114/171 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 119/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 185 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4531 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7552ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 7554ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/491 places, 139/676 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7746 ms. Remains : 57/491 places, 139/676 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X p2), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
RANDOM walk for 39861 steps (3122 resets) in 93 ms. (424 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X p2), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F p3), (F (NOT p2)), (F (NOT (OR p2 (NOT p3))))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p3 (NOT p2)), false]
Product exploration explored 100000 steps with 55 reset in 38 ms.
Product exploration explored 100000 steps with 210 reset in 81 ms.
Built C files in :
/tmp/ltsmin10342139030144404894
[2025-05-30 13:14:13] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2025-05-30 13:14:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:14:13] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2025-05-30 13:14:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:14:13] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2025-05-30 13:14:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:14:13] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10342139030144404894
Running compilation step : cd /tmp/ltsmin10342139030144404894;'/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 259 ms.
Running link step : cd /tmp/ltsmin10342139030144404894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10342139030144404894;'/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/stateBased12031254873184721341.hoa' '--buchi-type=spotba'
LTSmin run took 330 ms.
FORMULA CO4-PT-19-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-08 finished in 42669 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||(p1&&F(p2))) U X(X(X(p3)))))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 516 transition count 707
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 516 transition count 707
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 505 transition count 696
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 505 transition count 696
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 505 transition count 694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 496 transition count 684
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 496 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 496 transition count 683
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 491 transition count 678
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 491 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 491 transition count 676
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 489 transition count 674
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 488 transition count 673
Applied a total of 87 rules in 51 ms. Remains 488 /529 variables (removed 41) and now considering 673/720 (removed 47) transitions.
// Phase 1: matrix 673 rows 488 cols
[2025-05-30 13:14:13] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:14] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 13:14:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:14] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2025-05-30 13:14:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:14:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:14:32] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Starting structural reductions in LTL mode, iteration 1 : 488/529 places, 673/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30508 ms. Remains : 488/529 places, 673/720 transitions.
Stuttering acceptance computed with spot in 673 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2)]
Running random walk in product with property : CO4-PT-19-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 236 ms.
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 965 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (OR p0 p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (OR p0 p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 18 states, 26 edges and 4 AP (stutter sensitive) to 12 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2)]
RANDOM walk for 40000 steps (650 resets) in 172 ms. (231 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (142 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (143 resets) in 35 ms. (1111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (137 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (130 resets) in 34 ms. (1142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (139 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (141 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (143 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
[2025-05-30 13:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 82/96 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 151/247 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 12/259 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 23/282 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 313/595 variables, 119/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 293/888 variables, 136/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/888 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 205/1093 variables, 110/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1093 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 17 (OVERLAPS) 57/1150 variables, 37/486 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1150 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 9/1159 variables, 5/491 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1159 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/1161 variables, 2/493 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 493 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 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: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 82/96 variables, 12/16 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 4/20 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 151/247 variables, 63/83 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 12/259 variables, 1/84 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 23/282 variables, 4/88 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 313/595 variables, 119/207 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/595 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 293/888 variables, 136/343 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/888 variables, 0/343 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 205/1093 variables, 110/453 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1093 variables, 0/453 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 57/1150 variables, 37/490 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1150 variables, 0/490 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 9/1159 variables, 5/495 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1159 variables, 0/495 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/1161 variables, 2/497 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1161 variables, 0/497 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1161 variables, 0/497 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 497 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2476ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 42 ms.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 527 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 962 edges and 486 vertex of which 469 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 232 rules applied. Total rules applied 234 place count 469 transition count 424
Reduce places removed 211 places and 0 transitions.
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 1 with 213 rules applied. Total rules applied 447 place count 258 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 448 place count 257 transition count 422
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 448 place count 257 transition count 373
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 546 place count 208 transition count 373
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 549 place count 205 transition count 370
Iterating global reduction 3 with 3 rules applied. Total rules applied 552 place count 205 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 555 place count 205 transition count 367
Performed 79 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 713 place count 126 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 724 place count 126 transition count 254
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 732 place count 118 transition count 241
Iterating global reduction 5 with 8 rules applied. Total rules applied 740 place count 118 transition count 241
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 748 place count 114 transition count 237
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 749 place count 114 transition count 236
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 750 place count 113 transition count 234
Iterating global reduction 6 with 1 rules applied. Total rules applied 751 place count 113 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 752 place count 113 transition count 233
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 830 place count 74 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 7 with 81 rules applied. Total rules applied 911 place count 74 transition count 195
Discarding 29 places :
Symmetric choice reduction at 8 with 29 rule applications. Total rules 940 place count 45 transition count 126
Iterating global reduction 8 with 29 rules applied. Total rules applied 969 place count 45 transition count 126
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 990 place count 45 transition count 105
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 996 place count 39 transition count 81
Iterating global reduction 9 with 6 rules applied. Total rules applied 1002 place count 39 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1007 place count 39 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1009 place count 38 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1012 place count 38 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 1022 place count 38 transition count 74
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1023 place count 37 transition count 72
Iterating global reduction 11 with 1 rules applied. Total rules applied 1024 place count 37 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1025 place count 37 transition count 71
Free-agglomeration rule applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1033 place count 37 transition count 63
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1043 place count 29 transition count 61
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1046 place count 29 transition count 61
Graph (complete) has 103 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 1047 place count 28 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1050 place count 28 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1051 place count 27 transition count 57
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t390.t394.t584.t617 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 23 vertex of which 3 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 15 with 5 rules applied. Total rules applied 1056 place count 21 transition count 53
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 21 edges and 15 vertex of which 12 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 16 with 18 rules applied. Total rules applied 1074 place count 5 transition count 42
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 5 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 39 rules applied. Total rules applied 1113 place count 3 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1114 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 1116 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1117 place count 2 transition count 2
Applied a total of 1117 rules in 28 ms. Remains 2 /488 variables (removed 486) and now considering 2/673 (removed 671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/488 places, 2/673 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (OR p0 p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (OR p0 p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (G (OR p0 p1 p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p2 p3))]
False Knowledge obtained : [(F (NOT p3)), (F p0), (F (NOT (AND (OR (NOT p0) p3) (OR (NOT p1) p3)))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 212 ms. Reduced automaton from 12 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 1 out of 488 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2025-05-30 13:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:49] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 13:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:49] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2025-05-30 13:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:08] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
(s204 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0timeout
)
(s205 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30111ms
Finished structural reductions in LTL mode , in 1 iterations and 30468 ms. Remains : 488/488 places, 673/673 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 965 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [p3]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (740 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (137 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1168445 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 1168445 steps, saw 223528 distinct states, run finished after 3007 ms. (steps per millisecond=388 ) properties seen :0
[2025-05-30 13:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/89 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/239 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/251 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/274 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 315/589 variables, 120/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/589 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 297/886 variables, 138/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 205/1091 variables, 110/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1091 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 58/1149 variables, 37/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1149 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/1159 variables, 6/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1159 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/1161 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/19 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 70/89 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 150/239 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/251 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/274 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 315/589 variables, 120/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/589 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 297/886 variables, 138/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/886 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 205/1091 variables, 110/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1091 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 58/1149 variables, 37/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1149 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/1159 variables, 6/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1159 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/1161 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1161 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1161 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 525 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 962 edges and 486 vertex of which 469 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 230 rules applied. Total rules applied 232 place count 469 transition count 426
Reduce places removed 209 places and 0 transitions.
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 1 with 211 rules applied. Total rules applied 443 place count 260 transition count 424
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 445 place count 259 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 446 place count 258 transition count 423
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 446 place count 258 transition count 374
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 544 place count 209 transition count 374
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 548 place count 205 transition count 370
Iterating global reduction 4 with 4 rules applied. Total rules applied 552 place count 205 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 555 place count 205 transition count 367
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 555 place count 205 transition count 366
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 557 place count 204 transition count 366
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 558 place count 203 transition count 364
Iterating global reduction 5 with 1 rules applied. Total rules applied 559 place count 203 transition count 364
Performed 78 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 715 place count 125 transition count 263
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 726 place count 125 transition count 252
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 734 place count 117 transition count 239
Iterating global reduction 6 with 8 rules applied. Total rules applied 742 place count 117 transition count 239
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 750 place count 113 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 751 place count 113 transition count 234
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 752 place count 112 transition count 232
Iterating global reduction 7 with 1 rules applied. Total rules applied 753 place count 112 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 754 place count 112 transition count 231
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 830 place count 74 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 8 with 81 rules applied. Total rules applied 911 place count 74 transition count 190
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 940 place count 45 transition count 121
Iterating global reduction 9 with 29 rules applied. Total rules applied 969 place count 45 transition count 121
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 990 place count 45 transition count 100
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 996 place count 39 transition count 76
Iterating global reduction 10 with 6 rules applied. Total rules applied 1002 place count 39 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1006 place count 39 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1008 place count 38 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1011 place count 38 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 1018 place count 38 transition count 70
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1019 place count 37 transition count 68
Iterating global reduction 12 with 1 rules applied. Total rules applied 1020 place count 37 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1021 place count 37 transition count 67
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1029 place count 37 transition count 59
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1039 place count 29 transition count 57
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1042 place count 29 transition count 57
Graph (complete) has 100 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 1043 place count 28 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1046 place count 28 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1047 place count 27 transition count 53
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t390.t394.t584.t617 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 23 vertex of which 3 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 16 with 5 rules applied. Total rules applied 1052 place count 21 transition count 49
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 21 edges and 15 vertex of which 11 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 17 with 18 rules applied. Total rules applied 1070 place count 6 transition count 38
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 6 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 34 rules applied. Total rules applied 1104 place count 4 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1105 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 1105 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1107 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1109 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1110 place count 2 transition count 2
Applied a total of 1110 rules in 34 ms. Remains 2 /488 variables (removed 486) and now considering 2/673 (removed 671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2/488 places, 2/673 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p3]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 525 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 963 edges and 486 vertex of which 481 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 481 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 204 place count 481 transition count 664
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 204 place count 481 transition count 667
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 211 place count 481 transition count 667
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 272 place count 420 transition count 606
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 333 place count 420 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 334 place count 419 transition count 604
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 419 transition count 604
Performed 106 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 106 rules applied. Total rules applied 441 place count 419 transition count 660
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 458 place count 419 transition count 643
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 554 place count 323 transition count 542
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 650 place count 323 transition count 542
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 651 place count 322 transition count 541
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 652 place count 322 transition count 541
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 653 place count 322 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 654 place count 322 transition count 540
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 320 transition count 538
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 320 transition count 538
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 659 place count 320 transition count 538
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 661 place count 318 transition count 535
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 663 place count 318 transition count 535
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 665 place count 316 transition count 532
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 667 place count 316 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 668 place count 316 transition count 531
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 669 place count 315 transition count 530
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 670 place count 315 transition count 530
Performed 61 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 5 with 61 rules applied. Total rules applied 731 place count 315 transition count 828
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 791 place count 315 transition count 768
Discarding 104 places :
Symmetric choice reduction at 6 with 104 rule applications. Total rules 895 place count 211 transition count 483
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 6 with 104 rules applied. Total rules applied 999 place count 211 transition count 483
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1034 place count 211 transition count 448
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1100 place count 145 transition count 320
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1166 place count 145 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1173 place count 145 transition count 313
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1184 place count 134 transition count 292
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1195 place count 134 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1198 place count 134 transition count 330
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1201 place count 131 transition count 324
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1204 place count 131 transition count 324
Deduced a syphon composed of 76 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 8 with 69 rules applied. Total rules applied 1273 place count 131 transition count 255
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1275 place count 129 transition count 253
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1277 place count 129 transition count 253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1279 place count 129 transition count 298
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1282 place count 126 transition count 275
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1285 place count 126 transition count 275
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1285 rules in 100 ms. Remains 126 /488 variables (removed 362) and now considering 275/673 (removed 398) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:15:25] [INFO ] Redundant transitions in 1 ms returned []
Running 274 sub problems to find dead transitions.
[2025-05-30 13:15:25] [INFO ] Flow matrix only has 257 transitions (discarded 18 similar events)
// Phase 1: matrix 257 rows 126 cols
[2025-05-30 13:15:25] [INFO ] Computed 5 invariants in 1 ms
[2025-05-30 13:15:25] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:27] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:27] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 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 TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 4 (OVERLAPS) 256/382 variables, 126/136 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 33/169 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/169 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/170 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/170 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/170 constraints. Problems are: Problem set: 166 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 170 constraints, problems are : Problem set: 166 solved, 108 unsolved in 10287 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 166 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 16/68 variables, 5/5 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 5/10 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 239/307 variables, 68/78 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 33/111 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 108/219 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/219 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 75/382 variables, 58/277 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/277 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/278 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/278 constraints. Problems are: Problem set: 166 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/278 constraints. Problems are: Problem set: 166 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 278 constraints, problems are : Problem set: 166 solved, 108 unsolved in 11394 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 108/274 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21730ms problems are : Problem set: 166 solved, 108 unsolved
Search for dead transitions found 166 dead transitions in 21731ms
Found 166 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 166 transitions
Dead transitions reduction (with SMT) removed 166 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/488 places, 109/673 transitions.
Graph (complete) has 227 edges and 126 vertex of which 53 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 53 /126 variables (removed 73) and now considering 109/109 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/488 places, 109/673 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21841 ms. Remains : 53/488 places, 109/673 transitions.
Built C files in :
/tmp/ltsmin2017985846980027352
[2025-05-30 13:15:46] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2017985846980027352
Running compilation step : cd /tmp/ltsmin2017985846980027352;'/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 920 ms.
Running link step : cd /tmp/ltsmin2017985846980027352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2017985846980027352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17546743437108618066.hoa' '--buchi-type=spotba'
LTSmin run took 986 ms.
FORMULA CO4-PT-19-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-11 finished in 95074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 517 transition count 708
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 517 transition count 708
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 507 transition count 697
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 507 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 507 transition count 695
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 500 transition count 687
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 500 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 500 transition count 686
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 497 transition count 683
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 497 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 497 transition count 681
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 496 transition count 680
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 496 transition count 680
Applied a total of 71 rules in 38 ms. Remains 496 /529 variables (removed 33) and now considering 680/720 (removed 40) transitions.
// Phase 1: matrix 680 rows 496 cols
[2025-05-30 13:15:48] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:15:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 13:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:15:49] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2025-05-30 13:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:16:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:16:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 679 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 30109ms
Starting structural reductions in LTL mode, iteration 1 : 496/529 places, 680/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30551 ms. Remains : 496/529 places, 680/720 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 45 steps with 1 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-14 finished in 30763 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((p0||F(p1)))))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 720/720 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 517 transition count 708
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 517 transition count 708
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 506 transition count 696
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 506 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 506 transition count 695
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 498 transition count 686
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 498 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 498 transition count 685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 494 transition count 681
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 494 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 494 transition count 680
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 492 transition count 678
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 492 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 491 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 491 transition count 677
Applied a total of 79 rules in 44 ms. Remains 491 /529 variables (removed 38) and now considering 677/720 (removed 43) transitions.
// Phase 1: matrix 677 rows 491 cols
[2025-05-30 13:16:19] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:16:19] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 13:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:16:20] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2025-05-30 13:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (OVERLAPS) 677/1168 variables, 491/496 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 496 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:17:03] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:17:03] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1174 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:17:19] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 1175 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 491/529 places, 677/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60545 ms. Remains : 491/529 places, 677/720 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 3022 reset in 137 ms.
Product exploration explored 100000 steps with 3014 reset in 145 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 966 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 126 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-05-30 13:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:17:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-30 13:17:21] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-05-30 13:17:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:17:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-30 13:17:22] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-05-30 13:17:22] [INFO ] Computed and/alt/rep : 657/1165/657 causal constraints (skipped 19 transitions) in 31 ms.
[2025-05-30 13:17:27] [INFO ] Added : 597 causal constraints over 121 iterations in 5560 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 491 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Applied a total of 0 rules in 5 ms. Remains 491 /491 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2025-05-30 13:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:17:27] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-30 13:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:17:27] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2025-05-30 13:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 677/1168 variables, 491/496 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 496 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1174 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:28] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 8 ms to minimize.
SMT process timed out in 60132ms, After SMT, problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 491/491 places, 677/677 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 966 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 120 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-05-30 13:18:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:18:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-30 13:18:29] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2025-05-30 13:18:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:18:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 13:18:29] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-05-30 13:18:29] [INFO ] Computed and/alt/rep : 657/1165/657 causal constraints (skipped 19 transitions) in 36 ms.
[2025-05-30 13:18:35] [INFO ] Added : 597 causal constraints over 121 iterations in 5673 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3043 reset in 136 ms.
Product exploration explored 100000 steps with 3030 reset in 142 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Graph (trivial) has 526 edges and 491 vertex of which 3 / 491 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 964 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 484 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 484 transition count 668
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 207 place count 484 transition count 672
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 484 transition count 672
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 423 transition count 611
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 423 transition count 611
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 440 place count 423 transition count 667
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 457 place count 423 transition count 650
Discarding 94 places :
Symmetric choice reduction at 3 with 94 rule applications. Total rules 551 place count 329 transition count 551
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 94 rules applied. Total rules applied 645 place count 329 transition count 551
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 328 transition count 550
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 328 transition count 550
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 328 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 328 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 651 place count 326 transition count 547
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 326 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 326 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 324 transition count 544
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 324 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 660 place count 322 transition count 541
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 322 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 322 transition count 540
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 664 place count 321 transition count 539
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 665 place count 321 transition count 539
Performed 63 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 63 rules applied. Total rules applied 728 place count 321 transition count 848
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 789 place count 321 transition count 787
Discarding 107 places :
Symmetric choice reduction at 6 with 107 rule applications. Total rules 896 place count 214 transition count 494
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 6 with 107 rules applied. Total rules applied 1003 place count 214 transition count 494
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1038 place count 214 transition count 459
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1104 place count 148 transition count 331
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1170 place count 148 transition count 331
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1175 place count 148 transition count 326
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1186 place count 137 transition count 305
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1197 place count 137 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1200 place count 137 transition count 358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1210 place count 137 transition count 348
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1215 place count 132 transition count 326
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1220 place count 132 transition count 326
Deduced a syphon composed of 75 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 1256 place count 132 transition count 290
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1257 place count 131 transition count 289
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1258 place count 131 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1259 place count 131 transition count 313
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1261 place count 129 transition count 295
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1263 place count 129 transition count 295
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1263 rules in 79 ms. Remains 129 /491 variables (removed 362) and now considering 295/677 (removed 382) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:18:36] [INFO ] Redundant transitions in 1 ms returned []
Running 294 sub problems to find dead transitions.
[2025-05-30 13:18:36] [INFO ] Flow matrix only has 286 transitions (discarded 9 similar events)
// Phase 1: matrix 286 rows 129 cols
[2025-05-30 13:18:36] [INFO ] Computed 5 invariants in 2 ms
[2025-05-30 13:18:36] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:18:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 279 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem 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 TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 4 (OVERLAPS) 285/414 variables, 129/139 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 49/188 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/188 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 1/415 variables, 1/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 189 constraints, problems are : Problem set: 173 solved, 121 unsolved in 11876 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 173 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 16/71 variables, 5/5 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/10 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 269/340 variables, 71/81 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 49/130 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 121/251 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/251 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 74/414 variables, 58/309 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/309 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 310 constraints, problems are : Problem set: 173 solved, 121 unsolved in 14338 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 121/294 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26259ms problems are : Problem set: 173 solved, 121 unsolved
Search for dead transitions found 173 dead transitions in 26261ms
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 : 129/491 places, 122/677 transitions.
Graph (complete) has 233 edges and 129 vertex of which 56 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 56 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 20 place count 56 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 20 rules in 9 ms. Remains 56 /129 variables (removed 73) and now considering 145/122 (removed -23) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/491 places, 145/677 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26359 ms. Remains : 56/491 places, 145/677 transitions.
Built C files in :
/tmp/ltsmin7155965886982155074
[2025-05-30 13:19:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7155965886982155074
Running compilation step : cd /tmp/ltsmin7155965886982155074;'/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 1027 ms.
Running link step : cd /tmp/ltsmin7155965886982155074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7155965886982155074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10826016351544383980.hoa' '--buchi-type=spotba'
LTSmin run took 196 ms.
FORMULA CO4-PT-19-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-15 finished in 164050 ms.
All properties solved by simple procedures.
Total runtime 659645 ms.

BK_STOP 1748611143786

--------------------
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="CO4-PT-19"
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 CO4-PT-19, 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 r044-tall-174854028600524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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