Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899100315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FireWire-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-19-LTLCardinality-00
FORMULA_NAME FireWire-PT-19-LTLCardinality-01
FORMULA_NAME FireWire-PT-19-LTLCardinality-02
FORMULA_NAME FireWire-PT-19-LTLCardinality-03
FORMULA_NAME FireWire-PT-19-LTLCardinality-04
FORMULA_NAME FireWire-PT-19-LTLCardinality-05
FORMULA_NAME FireWire-PT-19-LTLCardinality-06
FORMULA_NAME FireWire-PT-19-LTLCardinality-07
FORMULA_NAME FireWire-PT-19-LTLCardinality-08
FORMULA_NAME FireWire-PT-19-LTLCardinality-09
FORMULA_NAME FireWire-PT-19-LTLCardinality-10
FORMULA_NAME FireWire-PT-19-LTLCardinality-11
FORMULA_NAME FireWire-PT-19-LTLCardinality-12
FORMULA_NAME FireWire-PT-19-LTLCardinality-13
FORMULA_NAME FireWire-PT-19-LTLCardinality-14
FORMULA_NAME FireWire-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717370942190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 23:29:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:29:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:29:03] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 23:29:03] [INFO ] Transformed 602 places.
[2024-06-02 23:29:03] [INFO ] Transformed 944 transitions.
[2024-06-02 23:29:03] [INFO ] Found NUPN structural information;
[2024-06-02 23:29:03] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 130 place count 472 transition count 823
Iterating global reduction 1 with 121 rules applied. Total rules applied 251 place count 472 transition count 823
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 285 place count 438 transition count 749
Iterating global reduction 1 with 34 rules applied. Total rules applied 319 place count 438 transition count 749
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 323 place count 438 transition count 745
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 327 place count 434 transition count 741
Iterating global reduction 2 with 4 rules applied. Total rules applied 331 place count 434 transition count 741
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 431 transition count 738
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 431 transition count 738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 339 place count 429 transition count 736
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 429 transition count 736
Applied a total of 341 rules in 137 ms. Remains 429 /602 variables (removed 173) and now considering 736/944 (removed 208) transitions.
// Phase 1: matrix 736 rows 429 cols
[2024-06-02 23:29:03] [INFO ] Computed 10 invariants in 27 ms
[2024-06-02 23:29:04] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-02 23:29:04] [INFO ] Invariant cache hit.
[2024-06-02 23:29:04] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-02 23:29:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/429 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 23:29:15] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 16 ms to minimize.
[2024-06-02 23:29:16] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 2 ms to minimize.
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:29:19] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1165 variables, and 21 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/429 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/429 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (OVERLAPS) 736/1165 variables, 429/450 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 735/1185 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 23:29:56] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:29:56] [INFO ] Deduced a trap composed of 222 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:30:00] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 1188 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 14/14 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60568ms
Starting structural reductions in LTL mode, iteration 1 : 429/602 places, 736/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61513 ms. Remains : 429/602 places, 736/944 transitions.
Support contains 20 out of 429 places after structural reductions.
[2024-06-02 23:30:05] [INFO ] Flatten gal took : 71 ms
[2024-06-02 23:30:05] [INFO ] Flatten gal took : 40 ms
[2024-06-02 23:30:05] [INFO ] Input system was already deterministic with 736 transitions.
RANDOM walk for 40000 steps (15 resets) in 1678 ms. (23 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 316 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (17 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (13 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (16 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (15 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (16 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (30 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
[2024-06-02 23:30:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 300/316 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 61/377 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 682/1059 variables, 377/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 27/1086 variables, 13/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 31/1117 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1117 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 21/1138 variables, 11/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1138 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 17/1155 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1155 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 10/1165 variables, 7/439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1165 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1165 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 439 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 300/316 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 61/377 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:30:09] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 682/1059 variables, 377/391 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:30:09] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1059 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:30:09] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:30:10] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1059 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1059 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 27/1086 variables, 13/415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1086 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 31/1117 variables, 14/430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1117 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 21/1138 variables, 11/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1138 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 17/1155 variables, 7/448 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1155 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 10/1165 variables, 7/455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:30:11] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1165 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1165 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 0/1165 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 456 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 8/8 constraints]
After SMT, in 5787ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 8614 ms.
Support contains 12 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 322 edges and 429 vertex of which 13 / 429 are part of one of the 2 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 418 transition count 648
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 347 transition count 642
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 344 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 343 transition count 641
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 154 place count 343 transition count 599
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 238 place count 301 transition count 599
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 240 place count 299 transition count 568
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 299 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 299 transition count 567
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 339 place count 251 transition count 519
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -116
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 425 place count 208 transition count 635
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 434 place count 208 transition count 626
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 480 place count 208 transition count 580
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 510 place count 208 transition count 550
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 549 place count 178 transition count 541
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 7 with 80 rules applied. Total rules applied 629 place count 178 transition count 461
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 632 place count 178 transition count 461
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 633 place count 178 transition count 461
Applied a total of 633 rules in 162 ms. Remains 178 /429 variables (removed 251) and now considering 461/736 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 178/429 places, 461/736 transitions.
RANDOM walk for 40000 steps (1647 resets) in 420 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (344 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (339 resets) in 108 ms. (367 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (329 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (327 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (327 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (343 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
[2024-06-02 23:30:21] [INFO ] Flow matrix only has 404 transitions (discarded 57 similar events)
// Phase 1: matrix 404 rows 178 cols
[2024-06-02 23:30:21] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:30:21] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 58/171 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 404/575 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 7/582 variables, 7/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/582 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 281 constraints, problems are : Problem set: 0 solved, 5 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:22] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 58/171 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:22] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:30:22] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 404/575 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 93/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 7/582 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/582 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 289 constraints, problems are : Problem set: 0 solved, 5 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1056ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1364 ms.
Support contains 10 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 461/461 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 176 transition count 459
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 175 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 175 transition count 455
Applied a total of 15 rules in 22 ms. Remains 175 /178 variables (removed 3) and now considering 455/461 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 175/178 places, 455/461 transitions.
RANDOM walk for 40000 steps (1633 resets) in 168 ms. (236 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (343 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (339 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (352 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (335 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
[2024-06-02 23:30:24] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
// Phase 1: matrix 399 rows 175 cols
[2024-06-02 23:30:24] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:30:24] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 58/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/567 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 94/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/574 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 279 constraints, problems are : Problem set: 0 solved, 4 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:30:24] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 58/168 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:30:24] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:30:24] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 399/567 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 94/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:30:25] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 7/574 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/574 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 287 constraints, problems are : Problem set: 0 solved, 4 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 1078ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 375 ms.
Support contains 8 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 455/455 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 175 transition count 453
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 453
Applied a total of 4 rules in 14 ms. Remains 173 /175 variables (removed 2) and now considering 453/455 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 173/175 places, 453/455 transitions.
RANDOM walk for 40000 steps (1662 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (337 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (335 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (322 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (352 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 16571 steps, run visited all 4 properties in 126 ms. (steps per millisecond=131 )
Probabilistic random walk after 16571 steps, saw 6416 distinct states, run finished after 130 ms. (steps per millisecond=127 ) properties seen :4
Computed a total of 65 stabilizing places and 71 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 334 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 413 transition count 647
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 151 place count 341 transition count 641
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 338 transition count 641
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 154 place count 338 transition count 597
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 242 place count 294 transition count 597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 291 transition count 565
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 291 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 291 transition count 564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 249 place count 291 transition count 563
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 343 place count 244 transition count 517
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -139
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 437 place count 197 transition count 656
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 494 place count 197 transition count 599
Applied a total of 494 rules in 77 ms. Remains 197 /429 variables (removed 232) and now considering 599/736 (removed 137) transitions.
[2024-06-02 23:30:26] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
// Phase 1: matrix 570 rows 197 cols
[2024-06-02 23:30:26] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:30:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 23:30:26] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:30:26] [INFO ] Invariant cache hit.
[2024-06-02 23:30:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:30:26] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-06-02 23:30:27] [INFO ] Redundant transitions in 90 ms returned []
Running 571 sub problems to find dead transitions.
[2024-06-02 23:30:27] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:30:27] [INFO ] Invariant cache hit.
[2024-06-02 23:30:27] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:30:35] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-02 23:30:38] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 1 ms to minimize.
[2024-06-02 23:30:40] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (OVERLAPS) 569/766 variables, 197/228 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 66/294 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/767 variables, and 294 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (OVERLAPS) 569/766 variables, 197/228 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 66/294 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 571/865 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/767 variables, and 865 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 21/21 constraints]
After SMT, in 60700ms problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60706ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/429 places, 599/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61424 ms. Remains : 197/429 places, 599/736 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-00
Product exploration explored 100000 steps with 1 reset in 164 ms.
Product exploration explored 100000 steps with 2 reset in 99 ms.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2410 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (352 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15567 steps, run visited all 1 properties in 75 ms. (steps per millisecond=207 )
Probabilistic random walk after 15567 steps, saw 5778 distinct states, run finished after 76 ms. (steps per millisecond=204 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 599/599 transitions.
Applied a total of 0 rules in 10 ms. Remains 197 /197 variables (removed 0) and now considering 599/599 (removed 0) transitions.
[2024-06-02 23:31:28] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:31:28] [INFO ] Invariant cache hit.
[2024-06-02 23:31:29] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-02 23:31:29] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:31:29] [INFO ] Invariant cache hit.
[2024-06-02 23:31:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:31:29] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-06-02 23:31:29] [INFO ] Redundant transitions in 57 ms returned []
Running 571 sub problems to find dead transitions.
[2024-06-02 23:31:29] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:31:29] [INFO ] Invariant cache hit.
[2024-06-02 23:31:29] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-02 23:31:34] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 5 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-02 23:31:41] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:31:42] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (OVERLAPS) 569/766 variables, 197/228 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 66/294 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/767 variables, and 294 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (OVERLAPS) 569/766 variables, 197/228 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 66/294 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 571/865 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/767 variables, and 865 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 21/21 constraints]
After SMT, in 60626ms problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61401 ms. Remains : 197/197 places, 599/599 transitions.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2399 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (344 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15567 steps, run visited all 1 properties in 66 ms. (steps per millisecond=235 )
Probabilistic random walk after 15567 steps, saw 5778 distinct states, run finished after 66 ms. (steps per millisecond=235 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 72 ms.
Product exploration explored 100000 steps with 3 reset in 77 ms.
Built C files in :
/tmp/ltsmin6100515117539720546
[2024-06-02 23:32:31] [INFO ] Computing symmetric may disable matrix : 599 transitions.
[2024-06-02 23:32:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:32:31] [INFO ] Computing symmetric may enable matrix : 599 transitions.
[2024-06-02 23:32:31] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:32:31] [INFO ] Computing Do-Not-Accords matrix : 599 transitions.
[2024-06-02 23:32:31] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:32:31] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6100515117539720546
Running compilation step : cd /tmp/ltsmin6100515117539720546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1955 ms.
Running link step : cd /tmp/ltsmin6100515117539720546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6100515117539720546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16631557004318381611.hoa' '--buchi-type=spotba'
LTSmin run took 4942 ms.
FORMULA FireWire-PT-19-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLCardinality-00 finished in 131951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 330 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 413 transition count 648
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 342 transition count 642
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 339 transition count 642
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 152 place count 339 transition count 599
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 238 place count 296 transition count 599
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 242 place count 292 transition count 566
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 292 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 292 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 247 place count 292 transition count 563
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 251 place count 290 transition count 563
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 339 place count 246 transition count 519
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -137
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 431 place count 200 transition count 656
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 4 with 63 rules applied. Total rules applied 494 place count 200 transition count 593
Applied a total of 494 rules in 53 ms. Remains 200 /429 variables (removed 229) and now considering 593/736 (removed 143) transitions.
[2024-06-02 23:32:38] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
// Phase 1: matrix 564 rows 200 cols
[2024-06-02 23:32:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:32:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 23:32:38] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:32:38] [INFO ] Invariant cache hit.
[2024-06-02 23:32:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:32:38] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-06-02 23:32:38] [INFO ] Redundant transitions in 46 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-02 23:32:38] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:32:38] [INFO ] Invariant cache hit.
[2024-06-02 23:32:38] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-02 23:32:43] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:32:44] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:32:44] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:32:44] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:32:44] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:32:44] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:32:45] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:32:45] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:32:45] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:32:45] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-02 23:32:50] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 563/763 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 64/285 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-02 23:33:02] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 574 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 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 (/ 1.0 4.0))
(s72 0.0)
(s73 (/ 3.0 4.0))
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 timeout
0.0)
(s106 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/764 variables, and 286 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 563/763 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 64/286 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 574/860 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 860 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 12/12 constraints]
After SMT, in 60588ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/429 places, 593/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61243 ms. Remains : 200/429 places, 593/736 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-04
Product exploration explored 100000 steps with 1 reset in 209 ms.
Product exploration explored 100000 steps with 1 reset in 197 ms.
Computed a total of 9 stabilizing places and 29 stable transitions
Computed a total of 9 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 350 steps (15 resets) in 11 ms. (29 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 510 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 593/593 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 593/593 (removed 0) transitions.
[2024-06-02 23:33:40] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:33:40] [INFO ] Invariant cache hit.
[2024-06-02 23:33:41] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-02 23:33:41] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:33:41] [INFO ] Invariant cache hit.
[2024-06-02 23:33:41] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:33:41] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-06-02 23:33:41] [INFO ] Redundant transitions in 50 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-02 23:33:41] [INFO ] Flow matrix only has 564 transitions (discarded 29 similar events)
[2024-06-02 23:33:41] [INFO ] Invariant cache hit.
[2024-06-02 23:33:41] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-02 23:33:46] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:33:46] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:33:47] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:33:47] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:33:47] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:33:47] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:33:48] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:33:48] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:33:48] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:33:48] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-02 23:33:53] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 563/763 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 64/285 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-02 23:34:05] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/764 variables, and 286 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 563/763 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 64/286 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 574/860 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 860 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 12/12 constraints]
After SMT, in 60691ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61427 ms. Remains : 200/200 places, 593/593 transitions.
Computed a total of 9 stabilizing places and 29 stable transitions
Computed a total of 9 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 270 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 1114 steps (56 resets) in 11 ms. (92 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 515 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 4 reset in 80 ms.
Built C files in :
/tmp/ltsmin4217846783678635486
[2024-06-02 23:34:43] [INFO ] Computing symmetric may disable matrix : 593 transitions.
[2024-06-02 23:34:43] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:34:43] [INFO ] Computing symmetric may enable matrix : 593 transitions.
[2024-06-02 23:34:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:34:43] [INFO ] Computing Do-Not-Accords matrix : 593 transitions.
[2024-06-02 23:34:43] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:34:43] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4217846783678635486
Running compilation step : cd /tmp/ltsmin4217846783678635486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1665 ms.
Running link step : cd /tmp/ltsmin4217846783678635486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4217846783678635486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13477620815910060457.hoa' '--buchi-type=spotba'
LTSmin run took 2284 ms.
FORMULA FireWire-PT-19-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLCardinality-04 finished in 129392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 334 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 413 transition count 647
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 151 place count 341 transition count 641
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 338 transition count 641
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 154 place count 338 transition count 597
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 242 place count 294 transition count 597
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 246 place count 290 transition count 564
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 290 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 251 place count 290 transition count 561
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 255 place count 288 transition count 561
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 343 place count 244 transition count 517
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -139
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 437 place count 197 transition count 656
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 494 place count 197 transition count 599
Applied a total of 494 rules in 55 ms. Remains 197 /429 variables (removed 232) and now considering 599/736 (removed 137) transitions.
[2024-06-02 23:34:47] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
// Phase 1: matrix 570 rows 197 cols
[2024-06-02 23:34:47] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:34:47] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 23:34:47] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:34:47] [INFO ] Invariant cache hit.
[2024-06-02 23:34:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:34:48] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-06-02 23:34:48] [INFO ] Redundant transitions in 60 ms returned []
Running 571 sub problems to find dead transitions.
[2024-06-02 23:34:48] [INFO ] Flow matrix only has 570 transitions (discarded 29 similar events)
[2024-06-02 23:34:48] [INFO ] Invariant cache hit.
[2024-06-02 23:34:48] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-02 23:34:53] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:34:53] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:34:53] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:34:53] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:34:53] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:34:54] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:34:54] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:34:54] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:34:54] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:34:54] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:34:55] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 569/766 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 66/284 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 8 (OVERLAPS) 0/766 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 571 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/767 variables, and 284 constraints, problems are : Problem set: 0 solved, 571 unsolved in 25248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (OVERLAPS) 569/766 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 66/284 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 571/855 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/767 variables, and 855 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 11/11 constraints]
After SMT, in 55760ms problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 55765ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/429 places, 599/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56467 ms. Remains : 197/429 places, 599/736 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-06 finished in 56543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 420 transition count 727
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 418 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 418 transition count 724
Applied a total of 22 rules in 16 ms. Remains 418 /429 variables (removed 11) and now considering 724/736 (removed 12) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:35:44] [INFO ] Computed 10 invariants in 15 ms
[2024-06-02 23:35:44] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-02 23:35:44] [INFO ] Invariant cache hit.
[2024-06-02 23:35:44] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 23:35:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:35:54] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:35:55] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:35:56] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:02] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:36:02] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:14] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
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 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:26] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Starting structural reductions in LTL mode, iteration 1 : 418/429 places, 724/736 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60895 ms. Remains : 418/429 places, 724/736 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-10 finished in 61114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 336 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 413 transition count 646
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 79 rules applied. Total rules applied 153 place count 340 transition count 640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 156 place count 337 transition count 640
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 156 place count 337 transition count 596
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 244 place count 293 transition count 596
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 290 transition count 564
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 290 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 290 transition count 563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 251 place count 290 transition count 561
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 255 place count 288 transition count 561
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 345 place count 243 transition count 516
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -147
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 441 place count 195 transition count 663
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 444 place count 195 transition count 660
Applied a total of 444 rules in 52 ms. Remains 195 /429 variables (removed 234) and now considering 660/736 (removed 76) transitions.
[2024-06-02 23:36:45] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
// Phase 1: matrix 623 rows 195 cols
[2024-06-02 23:36:45] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:36:45] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:36:45] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
[2024-06-02 23:36:45] [INFO ] Invariant cache hit.
[2024-06-02 23:36:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-02 23:36:45] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-06-02 23:36:45] [INFO ] Redundant transitions in 61 ms returned []
Running 632 sub problems to find dead transitions.
[2024-06-02 23:36:45] [INFO ] Flow matrix only has 623 transitions (discarded 37 similar events)
[2024-06-02 23:36:45] [INFO ] Invariant cache hit.
[2024-06-02 23:36:45] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 23:36:51] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:36:51] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:36:51] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:36:51] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:36:51] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:36:52] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:36:52] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:36:52] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:36:52] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-06-02 23:36:53] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:36:53] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:36:53] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:36:54] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (OVERLAPS) 622/817 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 632 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 19/237 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 23:37:09] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/817 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/818 variables, and 238 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (OVERLAPS) 622/817 variables, 195/219 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 19/238 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/817 variables, 632/870 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/817 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/818 variables, and 870 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 14/14 constraints]
After SMT, in 60812ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/429 places, 660/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61492 ms. Remains : 195/429 places, 660/736 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-11 finished in 61663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Graph (trivial) has 335 edges and 429 vertex of which 18 / 429 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 413 transition count 648
Reduce places removed 71 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 75 rules applied. Total rules applied 147 place count 342 transition count 644
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 340 transition count 644
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 149 place count 340 transition count 599
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 239 place count 295 transition count 599
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 243 place count 291 transition count 566
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 291 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 248 place count 291 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 248 place count 291 transition count 563
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 252 place count 289 transition count 563
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 342 place count 244 transition count 518
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -155
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 438 place count 196 transition count 673
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 4 with 63 rules applied. Total rules applied 501 place count 196 transition count 610
Applied a total of 501 rules in 50 ms. Remains 196 /429 variables (removed 233) and now considering 610/736 (removed 126) transitions.
[2024-06-02 23:37:47] [INFO ] Flow matrix only has 581 transitions (discarded 29 similar events)
// Phase 1: matrix 581 rows 196 cols
[2024-06-02 23:37:47] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:37:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 23:37:47] [INFO ] Flow matrix only has 581 transitions (discarded 29 similar events)
[2024-06-02 23:37:47] [INFO ] Invariant cache hit.
[2024-06-02 23:37:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 23:37:47] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-06-02 23:37:47] [INFO ] Redundant transitions in 77 ms returned []
Running 573 sub problems to find dead transitions.
[2024-06-02 23:37:47] [INFO ] Flow matrix only has 581 transitions (discarded 29 similar events)
[2024-06-02 23:37:47] [INFO ] Invariant cache hit.
[2024-06-02 23:37:47] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:37:54] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 4 ms to minimize.
[2024-06-02 23:37:54] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:37:54] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:37:54] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (OVERLAPS) 580/776 variables, 196/220 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 66/286 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 8 (OVERLAPS) 0/776 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 573 unsolved
No progress, stopping.
After SMT solving in domain Real declared 776/777 variables, and 286 constraints, problems are : Problem set: 0 solved, 573 unsolved in 26608 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 6 (OVERLAPS) 580/776 variables, 196/220 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 66/286 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 573/859 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/777 variables, and 859 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 14/14 constraints]
After SMT, in 57160ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 57166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/429 places, 610/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57753 ms. Remains : 196/429 places, 610/736 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-12 finished in 57823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((p1&&G(p2))||p0))))))'
Support contains 5 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 423 transition count 730
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 423 transition count 730
Applied a total of 12 rules in 11 ms. Remains 423 /429 variables (removed 6) and now considering 730/736 (removed 6) transitions.
// Phase 1: matrix 730 rows 423 cols
[2024-06-02 23:38:44] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:38:44] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 23:38:44] [INFO ] Invariant cache hit.
[2024-06-02 23:38:45] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 729 sub problems to find dead transitions.
[2024-06-02 23:38:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:38:55] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:38:56] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:38:58] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:39:00] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:39:01] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:39:02] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:39:03] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:39:03] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:39:14] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1153 variables, and 22 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/423 constraints, PredecessorRefiner: 729/729 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:39:26] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:39:29] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:39:37] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:39:37] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:39:37] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/1153 variables, and 27 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/423 constraints, PredecessorRefiner: 0/729 constraints, Known Traps: 17/17 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 729 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Starting structural reductions in LTL mode, iteration 1 : 423/429 places, 730/736 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60873 ms. Remains : 423/429 places, 730/736 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-14
Product exploration explored 100000 steps with 20000 reset in 137 ms.
Product exploration explored 100000 steps with 20000 reset in 161 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Detected a total of 63/423 stabilizing places and 69/730 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (21 resets) in 185 ms. (215 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (23 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 559 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (18 resets) in 416 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 494 ms. (80 steps per ms) remains 4/4 properties
[2024-06-02 23:39:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/373 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 678/1051 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1051 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/1079 variables, 13/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/1111 variables, 15/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1111 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 21/1132 variables, 11/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 15/1147 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1147 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/1153 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1153 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1153 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1153/1153 variables, and 433 constraints, problems are : Problem set: 0 solved, 4 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/373 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 678/1051 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1051 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1051 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/1079 variables, 13/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1079 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 32/1111 variables, 15/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1111 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 21/1132 variables, 11/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1132 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 15/1147 variables, 7/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1147 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1153 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1153 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1153 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1153/1153 variables, and 437 constraints, problems are : Problem set: 0 solved, 4 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1552ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2316 ms.
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 730/730 transitions.
Graph (trivial) has 322 edges and 423 vertex of which 13 / 423 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 412 transition count 642
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 341 transition count 636
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 338 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 337 transition count 635
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 154 place count 337 transition count 589
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 246 place count 291 transition count 589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 290 transition count 559
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 290 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 290 transition count 558
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 337 place count 246 transition count 514
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 425 place count 202 transition count 638
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 434 place count 202 transition count 629
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 486 place count 202 transition count 577
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 516 place count 202 transition count 547
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 555 place count 172 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 7 with 83 rules applied. Total rules applied 638 place count 172 transition count 455
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 641 place count 172 transition count 455
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 642 place count 172 transition count 455
Applied a total of 642 rules in 70 ms. Remains 172 /423 variables (removed 251) and now considering 455/730 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 172/423 places, 455/730 transitions.
RANDOM walk for 40000 steps (1673 resets) in 694 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (337 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (349 resets) in 344 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (274 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (336 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1140667 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :3 out of 4
Probabilistic random walk after 1140667 steps, saw 311436 distinct states, run finished after 3006 ms. (steps per millisecond=379 ) properties seen :3
[2024-06-02 23:39:54] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
// Phase 1: matrix 399 rows 172 cols
[2024-06-02 23:39:54] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:39:54] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/564 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 94/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/571 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/564 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 94/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:39:55] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/571 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/571 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 172/172 places, 455/455 transitions.
RANDOM walk for 40000 steps (1621 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (267 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1169824 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 1169824 steps, saw 320346 distinct states, run finished after 3003 ms. (steps per millisecond=389 ) properties seen :0
[2024-06-02 23:39:58] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:39:58] [INFO ] Invariant cache hit.
[2024-06-02 23:39:58] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/564 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 94/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/571 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:39:58] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 399/564 variables, 165/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 94/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:39:58] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/571 variables, 7/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/571 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 569ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 770 steps, including 55 resets, run visited all 1 properties in 3 ms. (steps per millisecond=256 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (AND (OR p1 p0) (OR p0 p2))))]
Knowledge based reduction with 2 factoid took 265 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 730/730 transitions.
Applied a total of 0 rules in 4 ms. Remains 423 /423 variables (removed 0) and now considering 730/730 (removed 0) transitions.
// Phase 1: matrix 730 rows 423 cols
[2024-06-02 23:39:59] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:40:00] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-02 23:40:00] [INFO ] Invariant cache hit.
[2024-06-02 23:40:00] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 729 sub problems to find dead transitions.
[2024-06-02 23:40:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:40:10] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:40:11] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:40:12] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:40:12] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:40:13] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:40:13] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:40:15] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:40:17] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:40:17] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:40:18] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:40:18] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:40:29] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1153 variables, and 22 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/423 constraints, PredecessorRefiner: 729/729 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:40:41] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:40:43] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/1153 variables, and 27 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/423 constraints, PredecessorRefiner: 0/729 constraints, Known Traps: 17/17 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 729 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Finished structural reductions in LTL mode , in 1 iterations and 60879 ms. Remains : 423/423 places, 730/730 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Detected a total of 63/423 stabilizing places and 69/730 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (13 resets) in 459 ms. (86 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (19 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (16 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (17 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (24 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
[2024-06-02 23:41:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/373 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 678/1051 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1051 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/1079 variables, 13/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/1111 variables, 15/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1111 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 21/1132 variables, 11/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 15/1147 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1147 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/1153 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1153 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1153 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1153/1153 variables, and 433 constraints, problems are : Problem set: 0 solved, 4 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/373 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 678/1051 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1051 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1051 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/1079 variables, 13/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1079 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 32/1111 variables, 15/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1111 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 21/1132 variables, 11/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1132 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 15/1147 variables, 7/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1147 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1153 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1153 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1153 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1153/1153 variables, and 437 constraints, problems are : Problem set: 0 solved, 4 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1564ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2413 ms.
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 730/730 transitions.
Graph (trivial) has 322 edges and 423 vertex of which 13 / 423 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 412 transition count 642
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 341 transition count 636
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 338 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 337 transition count 635
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 154 place count 337 transition count 589
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 246 place count 291 transition count 589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 290 transition count 559
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 290 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 290 transition count 558
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 337 place count 246 transition count 514
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 425 place count 202 transition count 638
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 434 place count 202 transition count 629
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 486 place count 202 transition count 577
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 516 place count 202 transition count 547
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 555 place count 172 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 7 with 83 rules applied. Total rules applied 638 place count 172 transition count 455
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 641 place count 172 transition count 455
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 642 place count 172 transition count 455
Applied a total of 642 rules in 56 ms. Remains 172 /423 variables (removed 251) and now considering 455/730 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 172/423 places, 455/730 transitions.
RANDOM walk for 40000 steps (1615 resets) in 785 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (332 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (348 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (269 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (334 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1188259 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :3 out of 4
Probabilistic random walk after 1188259 steps, saw 326389 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :3
[2024-06-02 23:41:09] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
// Phase 1: matrix 399 rows 172 cols
[2024-06-02 23:41:09] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:41:09] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/564 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 94/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/571 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/564 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 94/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/571 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/571 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 172/172 places, 455/455 transitions.
RANDOM walk for 40000 steps (1584 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (278 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1170948 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1170948 steps, saw 320720 distinct states, run finished after 3001 ms. (steps per millisecond=390 ) properties seen :0
[2024-06-02 23:41:12] [INFO ] Flow matrix only has 399 transitions (discarded 56 similar events)
[2024-06-02 23:41:12] [INFO ] Invariant cache hit.
[2024-06-02 23:41:12] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/564 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 94/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/571 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/571 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/165 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:41:12] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 399/564 variables, 165/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 94/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/571 variables, 7/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/571 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 875 steps, including 67 resets, run visited all 1 properties in 5 ms. (steps per millisecond=175 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (AND (OR p1 p0) (OR p0 p2))))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 20000 reset in 112 ms.
Product exploration explored 100000 steps with 20000 reset in 119 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 730/730 transitions.
Graph (trivial) has 322 edges and 423 vertex of which 13 / 423 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 412 transition count 718
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 412 transition count 715
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 73 place count 412 transition count 745
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 100 place count 412 transition count 745
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 122 place count 390 transition count 694
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 144 place count 390 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 390 transition count 693
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 3 with 55 rules applied. Total rules applied 200 place count 390 transition count 696
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 227 place count 363 transition count 669
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 254 place count 363 transition count 669
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -318
Deduced a syphon composed of 161 places in 1 ms
Iterating global reduction 3 with 58 rules applied. Total rules applied 312 place count 363 transition count 987
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 328 place count 347 transition count 952
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 344 place count 347 transition count 952
Deduced a syphon composed of 145 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 399 place count 347 transition count 897
Deduced a syphon composed of 145 places in 1 ms
Applied a total of 399 rules in 75 ms. Remains 347 /423 variables (removed 76) and now considering 897/730 (removed -167) transitions.
[2024-06-02 23:41:15] [INFO ] Redundant transitions in 33 ms returned []
Running 888 sub problems to find dead transitions.
[2024-06-02 23:41:15] [INFO ] Flow matrix only has 872 transitions (discarded 25 similar events)
// Phase 1: matrix 872 rows 347 cols
[2024-06-02 23:41:15] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:41:15] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem 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 TDEAD36 is UNSAT
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 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
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-02 23:41:25] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
[2024-06-02 23:41:27] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD167 is UNSAT
[2024-06-02 23:41:27] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD200 is UNSAT
[2024-06-02 23:41:27] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD295 is UNSAT
[2024-06-02 23:41:28] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem 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 TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 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 TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 20/30 constraints. Problems are: Problem set: 282 solved, 606 unsolved
[2024-06-02 23:41:30] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:41:30] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:41:30] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 3/33 constraints. Problems are: Problem set: 282 solved, 606 unsolved
[2024-06-02 23:41:38] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:41:38] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 2/35 constraints. Problems are: Problem set: 282 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/1219 variables, and 35 constraints, problems are : Problem set: 282 solved, 606 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/347 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 282 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 282 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 137/347 variables, 10/10 constraints. Problems are: Problem set: 282 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 25/35 constraints. Problems are: Problem set: 282 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 282 solved, 606 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
At refinement iteration 4 (OVERLAPS) 871/1218 variables, 347/382 constraints. Problems are: Problem set: 300 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 75/457 constraints. Problems are: Problem set: 300 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 588/1045 constraints. Problems are: Problem set: 300 solved, 588 unsolved
[2024-06-02 23:42:12] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1219 variables, and 1046 constraints, problems are : Problem set: 300 solved, 588 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 347/347 constraints, ReadFeed: 75/76 constraints, PredecessorRefiner: 588/888 constraints, Known Traps: 26/26 constraints]
After SMT, in 60626ms problems are : Problem set: 300 solved, 588 unsolved
Search for dead transitions found 300 dead transitions in 60633ms
Found 300 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 300 transitions
Dead transitions reduction (with SMT) removed 300 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 347/423 places, 597/730 transitions.
Graph (complete) has 1068 edges and 347 vertex of which 202 are kept as prefixes of interest. Removing 145 places using SCC suffix rule.2 ms
Discarding 145 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 202 /347 variables (removed 145) and now considering 597/597 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 202/423 places, 597/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60763 ms. Remains : 202/423 places, 597/730 transitions.
Built C files in :
/tmp/ltsmin2792953621985447578
[2024-06-02 23:42:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2792953621985447578
Running compilation step : cd /tmp/ltsmin2792953621985447578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1320 ms.
Running link step : cd /tmp/ltsmin2792953621985447578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2792953621985447578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16651868266644905079.hoa' '--buchi-type=spotba'
LTSmin run took 372 ms.
FORMULA FireWire-PT-19-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLCardinality-14 finished in 212768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(p1)))))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 736/736 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 421 transition count 728
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 421 transition count 728
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 419 transition count 725
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 419 transition count 725
Applied a total of 20 rules in 18 ms. Remains 419 /429 variables (removed 10) and now considering 725/736 (removed 11) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 23:42:17] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:42:17] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 23:42:17] [INFO ] Invariant cache hit.
[2024-06-02 23:42:18] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-02 23:42:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:42:28] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:42:29] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:42:34] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (OVERLAPS) 725/1144 variables, 419/435 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:42:48] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 436 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:42:56] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (OVERLAPS) 725/1144 variables, 419/437 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 724/1161 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:43:14] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:43:14] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:43:15] [INFO ] Deduced a trap composed of 222 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:43:16] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1165 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 12/12 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Starting structural reductions in LTL mode, iteration 1 : 419/429 places, 725/736 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60903 ms. Remains : 419/429 places, 725/736 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-19-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLCardinality-15 finished in 61623 ms.
All properties solved by simple procedures.
Total runtime 855819 ms.

BK_STOP 1717371799232

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-19, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899100315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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